IEEE Transactions on Cybernetics · 2019 · 86 citations · 33 references
ComputingComputer ScienceComputational GeometryMachine LearningRepresentation TheoryDimension ReductionDimensionality ReductionMatrix FactorizationMulti-view GeometryRepresentation LearningBenchmark DatasetsJoint Representation LearningLocal StructureLow-rank ApproximationManifold LearningMulti-view ClusteringMulti-view Representation LearningSubspace Learning
Subspace learning-based multiview clustering has achieved impressive experimental results. However, the similarity matrix, which is learned by most existing methods, cannot well characterize both the intrinsic geometric structure of data and the neighbor relationship between data. To consider the fact that original data space does not well characterize the intrinsic geometric structure, we learn the latent representation of data, which is shared by different views, from the latent subspace rather than the original data space by linear transformation. Thus, the learned latent representation has a low-rank structure without solving the nuclear-norm. This reduces the computational complexity. Then, the similarity matrix is adaptively learned from the learned latent representation by manifold learning which well characterizes the local intrinsic geometric structure and neighbor relationship between data. Finally, we integrate clustering, manifold learning, and latent representation into a unified framework and develop a novel subspace learning-based multiview clustering method. Extensive experiments on benchmark datasets demonstrate the superiority of our method.
33
Laurens van der Maaten, Geoffrey E. Hinton · Journal of Machine Learning Research · 2008 · 35.7K citations
UCI Machine Learning Repository
Arthur Asuncion · Medical Entomology and Zoology · 2007 · 24.4K citations
On Spectral Clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, Yair Weiss · 2001 · 7.8K citations
Tat‐Seng Chua, Jinhui Tang, Richang Hong et al. · 2009 · 3K citations