Top 350+ Solved Data Mining and Data Warehouse MCQ Questions Answer
Q. Reducing the number of attributes to solve the high dimensionality problem is called as ________.
a. dimensionality curse.
b. dimensionality reduction.
c. cleaning.
d. overfitting.
Q. Data that are not of interest to the data mining task is called as ______.
a. missing dat
b. changing data.
c. irrelevant data.
d. noisy data.
Q. ______ are effective tools to attack the scalability problem.
a. sampling.
b. parallelization
c. both a & b.
d. none of the above.
Q. Market-basket problem was formulated by __________.
a. agrawal et al.
b. steve et al.
c. toda et al.
d. simon et al.
Q. Data mining helps in __________.
a. inventory management.
b. sales promotion strategies.
c. marketing strategies.
d. all of the above.
Q. The proportion of transaction supporting X in T is called _________.
a. confidence.
b. support.
c. support count.
d. all of the above.
Q. The absolute number of transactions supporting X in T is called ___________.
a. confidence.
b. support.
c. support count.
d. none of the above.
Q. The value that says that transactions in D that support X also support Y is called ______________.
a. confidence.
b. support.
c. support count.
d. none of the above.
Q. The left hand side of an association rule is called __________.
a. consequent.
b. onset.
c. antecedent.
d. precedent.
Q. The right hand side of an association rule is called _____.
a. consequent.
b. onset.
c. antecedent.
d. precedent.
Q. Which of the following is not a desirable feature of any efficient algorithm?
a. to reduce number of input operations.
b. to reduce number of output operations.
c. to be efficient in computing.
d. to have maximal code length.
Q. All set of items whose support is greater than the user-specified minimum support are called as_____________.
a. border set.
b. frequent set.
c. maximal frequent set.
d. lattice.
Q. If a set is a frequent set and no superset of this set is a frequent set, then it is called ________.
a. maximal frequent set.
b. border set.
c. lattice.
d. infrequent sets.