ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Pattern Recognition
Volume 30, Issue 7, July 1997, Pages 1109-1119
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (951 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0031-3203(96)00140-9    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1997 Published by Elsevier B.V.

Clustering by competitive agglomeration

Hichem Friguia and Raghu KrishnapuramCorresponding Author Contact Information, a, E-mail The Corresponding Author

aDepartment of Computer Engineering and Computer Science, University of Missouri-Columbia, Columbia, MO 65211, U.S.A.

Received 8 September 1995; 
revised 18 April 1996. 
Available online 12 May 1998.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We present a new clustering algorithm called Competitive Agglomeration (CA), which minimizes an objective function that incorporates the advantages of both hierarchical and partitional clustering. The CA algorithm produces a sequence of partitions with a decreasing number of clusters. The initial partition has an over specified number of clusters, and the final one has the “optimal” number of clusters. The update equation in the CA algorithm creates an environment in which clusters compete for feature points and only clusters with large cardinalities survive. The algorithm can incorporate different distance measures in the objective function to f find an unknown number of clusters of various shapes.

Keywords: Unsupervised clustering; Fuzzy clustering; Competitive agglomeration; Cluster validity; Line detection; Curve detection; Plane fitting


Pattern Recognition
Volume 30, Issue 7, July 1997, Pages 1109-1119
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.