Improved Clustering using Hierarchical Approach

International Journal of Computer Trends and Technology (IJCTT)          
© - June Issue 2013 by IJCTT Journal
Volume-4 Issue-6                           
Year of Publication : 2013
Authors :Megha Gupta, Vishal Shrivastava


Megha Gupta, Vishal Shrivastava "Improved Clustering using Hierarchical Approach"International Journal of Computer Trends and Technology (IJCTT),V4(6):1564-1566 June Issue 2013 .ISSN Published by Seventh Sense Research Group.

Abstract: - This paper presents the methods for finding better and improved clusters using partitioning methods along with hierarchical methods. In this paper, k-means algorithm has been used for finding clusters and the resultant clusters are further divided using CFNG (Colored Farthest Neighbor Graph). The final clusters formed would be better and closed as compared to the clusters formed using k-means algorithm.


[1] Carl Endorf, Gene Schultz & Jim Mellander, Intrusion Detection & Prevention. McGraw-Hill Osborme Media, first edition, 2003
[2] M.Chrikar, C. Chakuri, T.Fedar & R.Motwani. Incremental Clustering & Dynamic Information Retrieval. Proceeding of the 29th ACM Symposium on the Theory of Computation, 1997.
[3] S.Rovetta, F.Masulli, Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data, Pattern Recognition 39 (12) (2006) 2415-2425.
[4] Jiawei Han, Micheline Kamber, Jian Pei. “Data Mining Concepts and Techniques”.

Keywords —Data mining, K-means algorithm, CFNG