Top 250+ Solved Data Mining and Business Intelligence MCQ Questions Answer

From 196 to 210 of 248

Q. The non-root node of item-prefix-tree consists of fields

a. Two

b. Three

c. Four

d. Five

  • b. Three

Q. The frequent-item-header-table consists of fields

a. Only one.

b. Two.

c. Three.

d. Four

  • b. Two.

Q. The paths from root node to the nodes labelled 'a' are called_________

a. Transformed prefix path

b. Suffix subpath

c. Transformed suffix path

d. Prefix subpath

  • d. Prefix subpath

Q. The transformed prefix paths of a node 'a' form a truncated database of pattern which cooccur with a is called________

a. Suffix path

b. FP-tree

c. Conditional pattern base

d. Prefix path

  • c. Conditional pattern base

Q. The goal of________is to discover both the dense and sparse regions of a data set

a. Association rule

b. Classification

c. Clustering

d. Genetic Algorithm

  • c. Clustering

Q. Which of the following is a clustering algorithm?

a. A priori

b. CLARA

c. Pincer-Search

d. FP-growth

  • b. CLARA

Q. clustering technique start with as many clusters as there are records, with eachcluster having only one record

a. Agglomerative

b. Divisive

c. Partition

d. Numeric

  • a. Agglomerative

Q. clustering techniques starts with all records in one cluster and then try to split that

a. Agglomerative.

b. Divisive.

c. Partition.

d. Numeric

  • b. Divisive.

Q. Which of the following is a data set in the popular UCI machine-learning repository?

a. CLARA.

b. CACTUS.

c. STIRR.

d. MUSHROOM

  • d. MUSHROOM

Q. In algorithm each cluster is represented by the center of gravity of the cluster

a. K-medoid

b. K-means

c. Stirr

d. Rock

  • b. K-means

Q. Pick out a k-medoid algorithm

a. DBSCAN

b. BIRCH

c. PAM

d. CURE

  • c. PAM

Q. Pick out a hierarchical clustering algorithm

a. DBSCAN

b. CURE

c. PAM

d. BIRCH

  • d. BIRCH

Q. CLARANS stands for

a. CLARA Net Server

b. Clustering Large Application Range Network Search

c. Clustering Large Applications based on Randomized Search

d. Clustering Application Randomized Search

  • c. Clustering Large Applications based on Randomized Search

Q. BIRCH is a________

a. Agglomerative clustering algorithm

b. Hierarchical algorithm

c. Hierarchical-agglomerative algorithm

d. Divisive

  • c. Hierarchical-agglomerative algorithm
Subscribe Now

Get All Updates & News