Large-scale spectral clustering using diffusion coordinates on landmark-based bipartite graphs

Résumé

Spectral clustering has received a lot of attention due to its ability to separate nonconvex, non-intersecting manifolds, but its high computational complexity has significantly limited its applicability. Motivated by the document-term co-clustering framework by Dhillon ( We show that our proposed algorithm can be implemented based on very efficient operations on the affinity matrix between the given data and selected landmarks, thus capable of handling large data. Finally, we demonstrate the excellent performance of our method by comparing with the state-of-the-art scalable algorithms on several benchmark data sets.

Citer ce document

Accès au document

Ce lien n'est plus accessible actuellement. Contactez l'institution d'origine.

Auteur(s)

Statistiques

Consultations : 1

Téléchargements : 0