Home / Engineering / Data Mining and Business Intelligence MCQs / Page 19

Data Mining and Business Intelligence MCQs | Page - 19

Dear candidates you will find MCQ questions of Data Mining and Business Intelligence here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

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

(A) CLARA.
(B) CACTUS.
(C) STIRR.
(D) MUSHROOM
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) K-medoid
(B) K-means
(C) Stirr
(D) Rock
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 183) In each cluster is represented by one of the objects of the cluster located near the center

(A) K-medoid
(B) K-means
(C) Stirr
(D) Rock
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 184) Pick out a k-medoid algorithm

(A) DBSCAN
(B) BIRCH
(C) PAM
(D) CURE
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 185) Pick out a hierarchical clustering algorithm

(A) DBSCAN
(B) CURE
(C) PAM
(D) BIRCH
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 186) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 187) BIRCH is a________

(A) Agglomerative clustering algorithm
(B) Hierarchical algorithm
(C) Hierarchical-agglomerative algorithm
(D) Divisive
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 188) The cluster features of different subclusters are maintained in a tree called_________

(A) CF tree
(B) FP tree
(C) FP growth tree
(D) B tree
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 189) The_______algorithm is based on the observation that the frequent sets are normally very few in number compared to the set of all itemsets

(A) A priori
(B) Clustering
(C) Association rule
(D) Partition
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 190) The partition algorithm uses scans of the databases to discover all frequent sets

(A) Two
(B) Four
(C) Six
(D) Eight
View Answer Discuss Share