COMP682 Data Mining Exam 2026 Graded A+

COMP682



COMP682 Data Mining Exam 2026 Graded A+
1

What types of inputs do each of the 3 types of decision trees take?

ID3: categorical only

C4.5: numeric and categorical

CART: numeric and categorical



2

How do each of the 3 types of decision trees split?

ID3: max information gain and minimum entropy

C4.5: information gain and gain ratio

CART: Gini index and twoing creation



3

How do each of the 3 types of decision trees handle missing data?

ID3: does not

C4.5: omits from calculations

CART: surrogate splits



4

What is CBA?

Classification based on association.



5

What is an iceberg cube?

An Iceberg-Cube contains only those cells of the data cube that meet an aggregate condition.




COMP682

, COMP682


6

What is OLAP, ROLAP, and MOLAP?

Online analytical processing,

Relational OLAP

Multidimensional Analytical Processing



7

What is naïve Bayesian classification? What is the formula?

A probabilistic classifier using Bayes Theorem.

posterior = (prior x likelihood) / evidence

P(A C) = ( P(C|A) P(A) ) / P(C)



8

What is Laplace smoothing?

A way of ensuring that a bayes classifier doesn't return zero due to a divide by 0.



9

What is a single-linkage algorithm?

A method of clustering that produces a dendrogram.



10

What is an SVM?

Support Vector Machine



11

Draw an FP-Tree




12


COMP682