Rate the Article: A Novel Approach for Improving Efficiency of Agglomerative Hierarchical Clustering For Numerical Data Set, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 120 | Views: 356

Research Paper | Computer Science & Engineering | India | Volume 4 Issue 7, July 2015 | Rating: 6.7 / 10


A Novel Approach for Improving Efficiency of Agglomerative Hierarchical Clustering For Numerical Data Set

Amar S. Chandgude, Vijay Kumar Verma


Abstract: Hierarchical clustering methods construct the clusters by recursively partitioning the instances in either a top-down or bottom-up fashion. These methods can be subdivided into Agglomerative hierarchical clustering and Divisive hierarchical clustering. The result of the hierarchical methods is a dendrogram, representing the nested grouping of objects and similarity levels at which groupings change. A clustering of the data objects is obtained by cutting the dendrogram at the desired similarity level. Single linkage method is based on similarity of two clusters that are most similar (closest) points in the different clusters. Complete linkage method based on similarity of two clusters that are least similar (most distant) points in the different clusters. Average linkage method based on average of pairwise proximity between points in the two clusters. In this paper we proposed an ensemble based technique to decide which methods is most suitable for a given dataset.


Keywords: Data Mining, Diagnosis, Heart Attack, Symptoms, Classification, Prediction


Edition: Volume 4 Issue 7, July 2015,


Pages: 1897 - 1900



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top