A parameter-free adaptive resonance theory-based topological clustering algorithm capable of continual learning
Document Type
Article
Publication Date
4-1-2026
Abstract
In general, a similarity threshold (i.e., a vigilance parameter) for a node learning process in Adaptive Resonance Theory (ART)-based algorithms has a significant impact on clustering performance. In addition, an edge deletion threshold in a topological clustering algorithm plays an important role in adaptively generating well-separated clusters during a self-organizing process. In this paper, we propose an ART-based topological clustering algorithm that integrates parameter estimation methods for both the similarity threshold and the edge deletion threshold. The similarity threshold is estimated using a determinantal point process-based criterion, while the edge deletion threshold is defined based on the age of edges. Experimental results with synthetic and real-world datasets show that the proposed algorithm has superior clustering performance to state-of-the-art clustering algorithms without requiring parameter specifications specific to the datasets. Source code is available at https://github.com/Masuyama-lab/CAE.
Keywords
Adaptive resonance theory, Clustering, Continual learning, Correntropy
Publication Title
Neural Computing and Applications
ISSN
0941-0643
DOI
10.1007/s00521-026-11907-5
Recommended Citation
Masuyama, Naoki; Takebayashi, Takanori; Nojima, Yusuke; Loo, Chu Kiong; Ishibuchi, Hisao; and Wermter, Stefan, "A parameter-free adaptive resonance theory-based topological clustering algorithm capable of continual learning" (2026). Research Publications (2026 to 2030). 865.
https://knova.um.edu.my/research_publications_2026_2030/865
Funders
National Natural Science Foundation of China
Volume
38
Issue
7
Publisher
Springer Science and Business Media Deutschland GmbH