TL;DR
PHIDA introduces a novel persistence-guided node-to-cluster mapping method for online clustering, enhancing stability and performance by leveraging Persistent Homology within an ART-based framework.
Contribution
It combines Inverse-Distance ART with PH constraints to improve online clustering stability and accuracy, especially in nonstationary data environments.
Findings
PHIDA outperforms recent stationary-only clustering methods on 24 benchmark datasets.
It improves aggregate performance in nonstationary online clustering scenarios.
PHIDA's gains are linked to PH-constrained mapping preserving raw PH components.
Abstract
Online clustering methods that adaptively create and update nodes as data arrive often make node learning explicit, whereas the mapping from the learned node state to output clusters often remains implicit or simplified. Implicit mappings make output clusters sensitive to weak graph bridges or local relations based on distance in the graph over learned nodes, leaving no explicit constraint on which node groups remain intact during mapping. This paper addresses this gap by proposing PHIDA, a persistence-guided node-to-cluster mapping method for online clustering with learned nodes. PHIDA implements this mapping within Adaptive Resonance Theory (ART)-based online clustering by combining Inverse-Distance ART (IDA) node learning with node-to-cluster mapping constrained by Persistent Homology (PH). Experiments on 24 benchmark datasets show that PHIDA achieves the best average ranks in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
