Top 350+ Solved Data Mining and Data Warehouse MCQ Questions Answer
Q. Certain itemsets in the dashed circle whose support count reach support value during an iterationmove into the ______.
a. dashed box.
b. solid circle.
c. solid box.
d. none of the above.
Q. Certain itemsets enter afresh into the system and get into the _______, which are essentially thesupersets of the itemsets that move from the dashed circle to the dashed box.
a. dashed box.
b. solid circle.
c. solid box.
d. dashed circle.
Q. The itemsets that have completed on full pass move from dashed circle to ________.
a. dashed box.
b. solid circle.
c. solid box.
d. none of the above.
Q. 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.
Q. The non-root node of item-prefix-tree consists of ________ fields.
a. two.
b. three.
c. four.
d. five.
Q. The frequent-item-header-table consists of __________ fields.
a. only one.
b. two.
c. three.
d. four.
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.
Q. The transformed prefix paths of a node 'a' form a truncated database of pattern which co-occur with ais called _______.
a. suffix path.
b. fp-tree.
c. conditional pattern base.
d. prefix path.
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.
Q. Which of the following is a clustering algorithm?
a. a priori.
b. clara.
c. pincer-search.
d. fp-growth.
Q. _______ clustering technique start with as many clusters as there are records, with each cluster havingonly one record.
a. agglomerative.
b. divisive.
c. partition.
d. numeric.
Q. __________ clustering techniques starts with all records in one cluster and then try to split that clusterinto small pieces.
a. agglomerative.
b. divisive.
c. partition.
d. numeric.
Q. Which of the following is a data set in the popular UCI machine-learning repository?
a. clar
b. cactus.
c. stirr.
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.