Tractable Clustering of Data on the Curve Manifold
원문 초록
In machine learning it is common to interpret each data point as a vector in Euclidean space. However the data may actually be functional i.e.\ each data point is a function of some variable such as time and the function is discretely sampled. The naive treatment of functional data as traditional multivariate data can lead to poor performance since the algorithms are ignoring the correlation in the curvature of each function. In this paper we propose a tractable method to cluster functional data or curves by adapting the Euclidean Low-Rank Representation (LRR) to the curve manifold. Experimental evaluation on synthetic and real data reveals that this method massively outperforms prior clustering methods in both speed and accuracy when clustering functional data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
HERCULES: Hierarchical Embedding-based Recursive Clustering Using LLMs for Efficient Summarization
MiCo: Multiple Instance Learning with Context-Aware Clustering for Whole Slide Image Analysis
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.