wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Data Mining

Total questions: 15

Worksheet time: 8mins

Name
Class
Date
1.

In a transactional database, EVERY transaction includes a transaction identity number.

a)

True

b)

False

2.

Which of these are types of advanced databases?

a)

Time-series databases

b)

Text databases

c)

Object-relational databases

d)

All of the above

3.

_________ stores sequences of values or events obtained over repeated measurements of time.

a)

temporal database

b)

sequence database

c)

time series database

d)

all of the above

4.

Text database can be ___________

a)

A. unstructured

b)

B. semi-structured

c)

C. well-structured

d)

Both A and B

e)

A, B, C

5.

Cluster analysis is ...................

a)

Unsupervised Learning

b)

Supervised learning

c)

Semi supervised learning

d)

None of these

6.

Of the following what are the distance based clustering algorithms?

a)

K-Means

b)

K-Medoids

c)

Hierarchical

d)

DBSCAN

7.

K-Means clustering is ........................ type clustering algorithm?

a)

Distance based

b)

Partition based

c)

Density based

d)

Hierarchical

8.

Weblog data is __________________

a)

Time series data

b)

Sequence data

c)

Streaming data

d)

Categorical data

9.

Which of the following statements are true?

a)

Time series data can be sequence data but sequence data need not be Time series data

b)

A Good clustering method will have high intra-class similarity and low inter-class similarity

c)

Similarity measure is critical for cluster analysis

d)

Biological sequence is a Time series data

10.

Choice of a split in a decision tree is based on this algorithm

a)

Greedy

b)

Divide and Conquer

c)

Dynamic Programming

11.

CART are also known as these trees

a)

Decision

b)

Binary

c)

Binary Search

12.

The terminal nodes of a tree are also known as these types of nodes

a)

root

b)

leaf

c)

Median

13.

This coefficient can measure the purity of a node in a classification tree

a)

Z Score

b)

Gini

c)

K- index

14.

The process of cutting a decision tree is called as tree____

a)

pruning

b)

Growing

c)

Traversal

15.

______ is an estimate of the conditional probability that one item (for example, {A} is in the basket given that another {B} is already present.

a)

support

b)

Confidence

c)

Data discriminization