arXiv (Cornell University) · 2021 · 10 citations · 61 references
ComputingComputer ScienceData ScienceData MiningData StructuresMachine LearningDimensionality ReductionGraph AnalyticsGraph-based LearningUnsupervised LearningBipartite Graph RepresentationClusteringGraph Structure LearningK-means ClusteringScalable ClusteringScalable Graph AlgorithmsSubspace ClusteringSubspace Learning
Graph-based subspace clustering methods have exhibited promising performance. However, they still suffer some of these drawbacks: encounter the expensive time overhead, fail in exploring the explicit clusters, and cannot generalize to unseen data points. In this work, we propose a scalable graph learning framework, seeking to address the above three challenges simultaneously. Specifically, it is based on the ideas of anchor points and bipartite graph. Rather than building a $n\times n$ graph, where $n$ is the number of samples, we construct a bipartite graph to depict the relationship between samples and anchor points. Meanwhile, a connectivity constraint is employed to ensure that the connected components indicate clusters directly. We further establish the connection between our method and the K-means clustering. Moreover, a model to process multi-view data is also proposed, which is linear scaled with respect to $n$. Extensive experiments demonstrate the efficiency and effectiveness of our approach with respect to many state-of-the-art clustering methods.
61
A density-based algorithm for discovering clusters in large spatial Databases with Noise
Martin Ester, Hans‐Peter Kriegel, Jörg Sander et al. · 1996 · 19.1K citations
Data clustering: 50 years beyond K-means
Anil K. Jain · Pattern Recognition Letters · 2009 · 9.2K citations
On Spectral Clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, Yair Weiss · 2001 · 7.8K citations
Hierarchical Clustering Schemes
S. C. Johnson · Psychometrika · 1967 · 4.9K citations