Swarm intelligence for self-organized clustering

被引:57
作者
Thrun, Michael C. [1 ]
Ultsch, Alfred [1 ]
机构
[1] Philipps Univ Marburg, Databion Res Grp, Hans Meerwein Str 6, D-35032 Marburg, Germany
关键词
Cluster analysis; Swarm intelligence; Self-organization; Nonlinear dimensionality reduction; Visualization; Emergence; Game theory; DIMENSIONALITY REDUCTION; CLASSIFICATION; ALGORITHMS;
D O I
10.1016/j.artint.2020.103237
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Algorithms implementing populations of agents which interact with one another and sense their environment may exhibit emergent behavior such as self-organization and swarm intelligence. Here a swarm system, called Databionic swarm (DBS), is introduced which is able to adapt itself to structures of high-dimensional data characterized by distance and/or density-based structures in the data space. By exploiting the interrelations of swarm intelligence, self-organization and emergence, DBS serves as an alternative approach to the optimization of a global objective function in the task of clustering. The swarm omits the usage of a global objective function and is parameter-free because it searches for the Nash equilibrium during its annealing process. To our knowledge, DBS is the first swarm combining these approaches. Its clustering can outperform common clustering methods such as K-means, PAM, single linkage, spectral clustering, model-based clustering, and Ward, if no prior knowledge about the data is available. A central problem in clustering is the correct estimation of the number of clusters. This is addressed by a DBS visualization called topographic map which allows assessing the number of clusters. It is known that all clustering algorithms construct clusters, irrespective of the data set contains clusters or not. In contrast to most other clustering algorithms, the topographic map identifies, that clustering of the data is meaningless if the data contains no (natural) clusters. The performance of DBS is demonstrated on a set of benchmark data, which are constructed to pose difficult clustering problems and in two real-world applications. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:23
相关论文
共 145 条
[1]  
[Anonymous], 1935, Bulletin of American Iris Society, DOI DOI 10.1130/SPE117-P1
[2]  
[Anonymous], 1999, Emergence, DOI [10.1207/s15327000-m0101_423, DOI 10.1207/S15327000EM0101_4, 10.1207/s15327000em01014]
[3]  
[Anonymous], 1992, TECH REP
[4]  
Aparna K., 2014, 2014 International Conference on Electronics and Communication Systems (ICECS), P1
[5]  
Arabie P., 1996, CLUSTERING CLASSIFIC
[6]  
Arumugam MS, 2005, ICCIMA 2005: SIXTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND MULTIMEDIA APPLICATIONS, PROCEEDINGS, P225
[7]   Knowledge discovery from high-frequency stream nitrate concentrations: hydrology and biology contributions [J].
Aubert, Alice H. ;
Thrun, Michael C. ;
Breuer, Lutz ;
Ultsch, Alfred .
SCIENTIFIC REPORTS, 2016, 6
[8]  
Beckers R., 1994, Artificial Life IV. Proceedings of the Fourth International Workshop on the Synthesis and Simulation of Living Systems, P181
[9]   DYNAMIC PROGRAMMING [J].
BELLMAN, R .
SCIENCE, 1966, 153 (3731) :34-&
[10]  
Beni G, 2005, LECT NOTES COMPUT SC, V3342, P1