A Parameter-free Adaptive Resonance Theory-based Topological Clustering Algorithm Capable of Continual Learning
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Separating the Early Universe from the Late Universe: cosmological parameter estimation beyond the black box
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Analytic estimation of parameters of stochastic volatility diffusion models with exponential-affine characteristic function for currency option pricing
LifelongPR: Lifelong knowledge fusion for point cloud place recognition based on replay and prompt learning
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.