Fast Clustering by Directly Solving Bipartite Graph Clustering Problem.
Sign Up to like & getrecommendations! Published in 2022 at "IEEE transactions on neural networks and learning systems"
DOI: 10.1109/tnnls.2022.3219131
Abstract: Spectral clustering (SC) has been widely used in many applications and shows excellent performance. Its high computational cost limits its applications; many strategies including the anchor technique can partly alleviate the high computational cost problem.… read more here.
Keywords: problem; directly solving; fast clustering; bipartite graph ... See more keywords