Abstract
Although there is no exact definition for the term cluster, in the 2D case, it is fairly easy for human beings to decide which objects belong together. For machines on the other hand, it is hard to determine which objects form a cluster. Depending on the problem, the success of a clustering algorithm depends on the idea of their creators about what a cluster should be. Likewise, each clustering algorithm comprises a characteristic idea of the term cluster. For example the fuzzy c-means algorithm (Kruse et al., Advances in Fuzzy Clustering and Its Applications, Wiley, New York, 2007, pp. 3–30; Höppner et al., Fuzzy Clustering, Wiley, Chichester, 1999) tends to find spherical clusters with equal numbers of objects. Noise clustering (Rehm et al., Soft Computing – A Fusion of Foundations, Methodologies and Applications 11(5):489–494) focuses on finding spherical clusters of user-defined diameter. In this paper, we present an extension to noise clustering that tries to maximize the distances between prototypes. For that purpose, the prototypes behave like repulsive magnets that have an inertia depending on their sum of membership values. Using this repulsive extension, it is possible to prevent that groups of objects are divided into more than one cluster. Due to the repulsion and inertia, we show that it is possible to determine the number and approximate position of clusters in a data set.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bezdek, J. C. (1981). Pattern recognition with fuzzy objective function algorithms. New York: Plenum.
Dave, R. N., & Krishnapuram, R. (1997). Robust clustering methods: a unified view. IEEE Transactions on Fuzzy Systems, 5, 270–293.
Gath I., & Geva, A. B. (1989). Unsupervised optimal fuzzy clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11, 773–781.
Gustafson, D. E., & Kessel, W. C. (1979). Fuzzy clustering with a fuzzy covariance matrix. In Proceedings of the IEEE Conference on Decision and Control, San Diego, 761–766.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winkler, R., Rehm, F., Kruse, R. (2009). Clustering with Repulsive Prototypes. In: Fink, A., Lausen, B., Seidel, W., Ultsch, A. (eds) Advances in Data Analysis, Data Handling and Business Intelligence. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01044-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-01044-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01043-9
Online ISBN: 978-3-642-01044-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)