IEEE Transactions on Cybernetics · 2021 · 364 citations · 59 references
ComputingComputer ScienceComputational GeometryData MiningData StructuresDimensionality ReductionGraph AnalyticsGraph MiningGraph-based LearningUnsupervised LearningBipartite Graph RepresentationGraph Representation LearningScalable ClusteringScalable Graph AlgorithmsSubspace ClusteringSubspace Learning
Graph-based subspace clustering methods have exhibited promising performance. However, they still suffer some of these drawbacks: they encounter the expensive time overhead, they fail to explore 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 an n×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 multiview data is also proposed, which is linearly 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.
59
Data clustering: 50 years beyond K-means
Anil K. Jain · Pattern Recognition Letters · 2009 · 9.2K citations
Hierarchical Clustering Schemes
S. C. Johnson · Psychometrika · 1967 · 4.9K citations
RCV1: A New Benchmark Collection for Text Categorization Research
David Lewis, Yiming Yang, Tony Rose et al. · Goldsmiths (University of London) · 2004 · 2.6K citations · Full text