Abstract
Hard/fuzzy c-means and agglomerative hierarchical method are famous and useful clustering algorithms. The former are algorithms using “global information of data”, the latter is one using “local information of data”. One of main results in this paper is proposal for new clustering algorithm (Dynamic Clustering; DC), which has the advantage of them.
In DC, clusters are updated by some model introduced in advance. That is, the clusters are moved according to the model, and merged. Here, merging two clusters means that two clusters contact each other. The model is called option of DC. In this paper, two options of DC are proposed, i.e., interaction power model(IP) and unit weight model(UW). Moreover, the way to determine sampling time, which is one of the parameters in DC, is discussed for precise merging of data and shortening of calculation time. Furthermore, through numerical examples, it is shown that DC gives good classification for the data which is difficult to be classified by the former clustering algorithms.
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
Bezdec, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum, New York (1978)
Miyamoto, S.: Introduction of Cluster Analysis, Morikita Shuppan (1999) (in Japanese)
Iwata, H., Endo, Y.: Dynamic Clustering Using Interaction Power between Data. In: Proc. of Second Rough Set Workshop, pp. 59–62 (2003) (in Japanese)
Saito, M.: Molecular Dynamic Simulations of Proteins in Water without the Truncation of Longrange Coulomb Interactions. Trans. of Molecular Simulation 8, 321–333 (1992)
Ide, Y., Endo, Y.: High-speed Computation of Dynamic Clustering Algorithm. Institute of Electronics. In: Information and Communication Engineers, pp. 248 (2004) (in Japanese)
Watanabe, K.: Recognition and Pattern, Iwanami Shinsho (1978) (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Endo, Y., Iwata, H. (2005). Dynamic Clustering Based on Universal Gravitation Model. In: Torra, V., Narukawa, Y., Miyamoto, S. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2005. Lecture Notes in Computer Science(), vol 3558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11526018_19
Download citation
DOI: https://doi.org/10.1007/11526018_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27871-9
Online ISBN: 978-3-540-31883-5
eBook Packages: Computer ScienceComputer Science (R0)