Learning an Optimal Bipartite Graph for Subspace Clustering via Constrained Laplacian Rank.
Sign Up to like & getrecommendations! Published in 2021 at "IEEE transactions on cybernetics"
DOI: 10.1109/tcyb.2021.3113520
Abstract: In this article, we focus on utilizing the idea of co-clustering algorithms to address the subspace clustering problem. In recent years, co-clustering methods have been developed greatly with many important applications, such as document clustering… read more here.
Keywords: laplacian rank; bipartite graph; graph; subspace clustering ... See more keywords
Deep Spectral Clustering With Constrained Laplacian Rank.
Sign Up to like & getrecommendations! Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3213756
Abstract: Spectral clustering (SC) is a well-performed and prevalent technique for data processing and analysis, which has attracted significant attention in the field of clustering. While the scalability and generalization ability of this method make it… read more here.
Keywords: deep spectral; laplacian rank; constrained laplacian; spectral clustering ... See more keywords