__________ clustering techniques starts with all records in one cluster and then try to split that cluster into small pieces.

Home / Engineering / Data Mining and Data Warehouse / Question

M

Mr. Dubey • 51.32K Points
Coach

Q.) __________ clustering techniques starts with all records in one cluster and then try to split that cluster into small pieces.

(A) agglomerative.

(B) divisive.

(C) partition.

(D) numeric.

Correct answer : Option (B) - divisive.

Share

Discusssion

Login to discuss.

Related MCQs on Data Mining and Data Warehouse

Q. If the attribute phone number is included in the relation all the values need not be entered into the phone number column. This type of entry is given as

Q. If there are 32 segments, each of size 1Kb, then the logical address should have

Q. In given image, P(H|E) is probability.

Q. The kernel itself is a program that usually lives in the root partition of the UNIX filesystem. Most Linux distributions call it and it often a symbolic link to the real kernel file which lives in “/boot”.

Q. Scatter is ____________.

Q. What is the worst-case time for heap sort to sort an array of n elements?

Q. Dynamic networks of networks, is a dynamic connection that grows is called?

Q. What should be done to unused inputs on TTL gates?

Q. Services provided by kernel are………

Q. Which of the following storage devices can store maximum amount of data?