Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 2 out of 6 pages
Exam (elaborations)

COMP682 Data Mining Exam with Verified Answers 2026

Document preview thumbnail
Preview 2 out of 6 pages

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. 6 What is OLAP, ROLAP, and MOLAP? Online analytical processing, Relational OLAP Multidimensional Analytical Processing

Content preview

COMP682



COMP682 Data Mining Exam with
Verified Answers 2026
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.


COMP682

, COMP682




5
What is an iceberg cube?
An Iceberg-Cube contains only those cells of the data cube that meet an
aggregate condition.


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?


COMP682

Document information

Study
Uploaded on
January 1, 2026
Number of pages
6
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
$12.49

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
PossibleA
3.9
(149)
Sold
1063
Followers
651
Items
13904
Last sold
5 days ago


Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions