1. k-means is one of the simplest _______________ learning algorithms.
A . Supervised
B . Unsupervised
C . Both
D . None
2. Clustering is a_________________________________
A . Group of similar objects that differ significantly from other objects
B . Operations on a data to transform data in order to prepare it for a data mining algorithm
C . Symbolic representation of facts from which information can potentially be extracted
D . None
3. ____________________ method is used for partitioning the clusters based on the medoid objects.
A . k-means
B . k-medoid
C . Divisive
D . DBSCAN
4. ______________ hierarchical clustering algorithm initiates with clusters and integrates the two closest clusters until only one cluster remains.
A . DBSCAN
B . Agglomerative
C . k-means
D . Divisive
5. In ___________________ algorithm, each cluster is represented by the mean value of the objects in the cluster.
A . k-means
B . k-medoid
C . DBSCAN
D . Hierarchal
6. Which of the following is not a requirement of clustering?
A . Scaling of data
B . Large dimensionality
C . Divisive clustering
D . Arbitrary shaped cluster detection
7. _________method works by grouping data objects into a tree of clusters
A . Partition based clustering
B . Grid based clustering
C . Density based clustering
D . Hierarchical based clustering
8. A distance between different cluster is measured through___________
A . Linkage metric
B . Relation metric
C . Weight metric
D . None of the above
9. ____________ is a technique of combining a group of physical objects into classes of homogeneous objects.
A . Clustering
B . Grapping
C . Bisecting
D . Optimizing
10.) K-medoids clustering methods uses one representative________ per cluster to represent the clusters.
A . Mean
B . Median
C . Object
D . Space
11.) The occurrences of_________ is inevitable when Euclidean distance criterion is employed.
A . Outlier
B . Empty cluster
C . Centroids
D . DBSCAN
12. Cluster contains a set of_______ data objects.
13. Huge datasets are partitioned into groups based on___________.
14. _____________________________methods can find arbitrary shaped clusters.
15. DBSCAN stands for_____________________________________________________.
16. Outliers are different from noisy data (True/False)
17. _______________________________ is a "bottom-up" approach: each observation starts in its own cluster, and pairs of clusters are merged as one moves up the hie
18. ________________________ distance measure is used to find similarity among data points in k-means algorithm.
19. _________________ algorithm is efficient for clustering even if the dataset contains outliers.
20. _______________________________ is a "top-down" approach in hierarchical clustering m
☞ Data Mining MCQs - Unit-1 - [ DM ]
☞ Data Mining MCQs - Unit-2 - [ DM ]
☞ Data Mining MCQs - Unit-3 - [ DM ]
☞ Data Mining MCQs - Unit-4 - [ DM ]
☞ Data Mining MCQs - Unit-5 - [ DM ]
☞ R - Programming MCQs - Unit-1 - [ R-Programming ]
☞ R - Programming MCQs - Unit-2 - [ R-Programming ]
☞ R - Programming MCQs - Unit-3 - [ R-Programming ]
☞ R - Programming MCQs - Unit-4 - [ R-Programming ]
☞ R - Programming MCQs - Unit-5 - [ R-Programming ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-1 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-2 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-3 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-4 - [ FLAT ]
☞ Formal Languages and Automata Theory (FLAT) MCQs - Unit-5 - [ FLAT ]
☞ PPS MCQs - Unit-1 - [ PPS ]
☞ PPS MCQs - Unit-2 - [ PPS ]
☞ PPS MCQs - Unit-3 - [ PPS ]
☞ PPS MCQs - Unit-4 - [ PPS ]
☞ PPS MCQs - Unit-5 - [ PPS ]
☞ Object Oriented Programming through Java MCQs - Unit-1 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-2 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-3 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-4 - [ OOP_JAVA ]
☞ Object Oriented Programming through Java MCQs - Unit-5 - [ OOP_JAVA ]
☞ Design and Analysis of Algorithms MCQs - Unit-1 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-2 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-3 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-4 - [ DAA ]
☞ Design and Analysis of Algorithms MCQs - Unit-5 - [ DAA ]
☞ Software Engineering MCQs - Unit-1 - [ SE ]
☞ Software Engineering MCQs - Unit-2 - [ SE ]
☞ Software Engineering MCQs - Unit-3 - [ SE ]
☞ Software Engineering MCQs - Unit-4 - [ SE ]
☞ Software Engineering MCQs - Unit-5 - [ SE ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-1 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-2 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-3 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-4 - [ COA ]
☞ Computer Organization and Architecture (COA) Objective Question Bank-Unit-5 - [ COA ]
☞ Data Structures Objective Type Question Bank-Unit-1 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-2 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-3 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-4 - [ DS ]
☞ Data Structures Objective Type Question Bank-Unit-5 - [ DS ]
☞ Database Management System Objective Type Question Bank-Unit-1 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-2 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-3 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-4 - [ DBMS ]
☞ Database Management System Objective Type Question Bank-Unit-5 - [ DBMS ]
☞ Cyber Forensics Objective Type Question Bank-Part-2 - [ Cyber Forensics ]
☞ Cyber Forensics Objective Type Question Bank-Part-1 - [ Cyber Forensics ]
☞ Java Programming Objective Type Question Bank - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-1 - [ Java Programming ]
☞ Java Programming Objective Type Questions-Part-2 - [ Java Programming ]