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

Data Mining and Business Intelligence MCQs | Page - 18

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. 171) The FP-growth algorithm has phases

(A) One
(B) Two
(C) Three
(D) Four
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 172) A frequent pattern tree is a tree structure consisting of ________

(A) An item-prefix-tree
(B) A frequent-item-header table
(C) A frequent-item-node
(D) Both A & B
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) Two
(B) Three
(C) Four
(D) Five
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) Only one.
(B) Two.
(C) Three.
(D) Four
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

M

Mr. Dubey • 51.17K Points
Coach

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

M

Mr. Dubey • 51.17K Points
Coach

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

M

Mr. Dubey • 51.17K Points
Coach

Q. 178) Which of the following is a clustering algorithm?

(A) A priori
(B) CLARA
(C) Pincer-Search
(D) FP-growth
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 179) clustering technique start with as many clusters as there are records, with each cluster having only one record

(A) Agglomerative
(B) Divisive
(C) Partition
(D) Numeric
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

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

(A) Agglomerative.
(B) Divisive.
(C) Partition.
(D) Numeric
View Answer Discuss Share