Clustering through Feature Space Sequence Discovery and Analysis
Not on the map. Why?
Abstract (arXiv)
Identifying high-dimensional data patterns without a priori knowledge is an important task of data science. This paper proposes a simple and efficient noparametric algorithm: Data Convert to Sequence Analysis, DCSA, which dynamically explore each point in the feature space without repetition, and a Directed Hamilton Path will be found. Based on the change point analysis theory, The sequence corresponding to the path is cut into several fragments to achieve clustering. The experiments on real-world datasets from different fields with dimensions ranging from 4 to 20531 confirm that the method in this work is robust and has visual interpretability in result analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 0 of its 33 references that are in the map. First posted on arXiv 2 Dec 2022.
Builds on
0 of 33 references.
No references here yet.
Built on by
Not cited yet.