A Parameter-free Adaptive Resonance Theory-based Topological Clustering Algorithm Capable of Continual Learning

Naoki Masuyama, Takanori Takebayashi, Yusuke Nojima, Chu Kiong Loo, Hisao Ishibuchi +1 more
5/1/2023
cs.NEcs.LG

No official code found. Best implementation: Masuyama-lab/CAE (0 stars, MIT, last commit 2026-03-25).

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 a new parameter-free ART-based topological clustering algorithm capable of continual learning by introducing parameter estimation methods. Experimental results with synthetic and real-world datasets show that the proposed algorithm has superior clustering performance to the state-of-the-art clustering algorithms without any parameter pre-specifications.

View on arXivView PDF

Code Implementations(1)

Masuyama-lab/CAECommunity100%
MIT
00MATLAB, PythonMar 6, 20237 months agoMIT

Similar Papers

Cite this paper

@article{masuyama2023parameterfree,
  title  = {A Parameter-free Adaptive Resonance Theory-based Topological Clustering Algorithm Capable of Continual Learning},
  author = {Naoki Masuyama and Takanori Takebayashi and Yusuke Nojima and Chu Kiong Loo and Hisao Ishibuchi and Stefan Wermter},
  year   = {2023},
  eprint = {2305.01507},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.01507v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.01507.svg)](https://codeofpaper.com/paper/2305.01507)

Discussion