Fast clustering based on bipartite graph

DOI10.3724/SP.J.1249.2019.01018zbMATH Open1438.68109OpenAlexW4246483466WikidataQ128176614 ScholiaQ128176614MaRDI QIDQ5196829FDOQ5196829

Authors: Feiping Nie, Chenglong Wang, Rong Wang 

Publication date: 20 September 2019

Published in: Journal of Shenzhen University Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3724/sp.j.1249.2019.01018

Recommendations

• Fast spectral clustering via the Nyström method
• An ensemble algorithm of spectral clustering based on sampling
• A spectral clustering algorithm based on adaptive Nyström sampling for big data analysis
• Cluster ensemble based on spectral clustering
• Fast density-weighted low-rank approximation spectral clustering

zbMATH Keywords

clusteringspectral graph theorybipartite graphrank constraintlarge-scale data

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Cited In (3)

• Fast density-weighted low-rank approximation spectral clustering
• An ensemble algorithm of spectral clustering based on sampling
• GraphLSHC: towards large scale spectral hypergraph clustering

This page was built for publication: Fast clustering based on bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5196829)