Iterative and active graph clustering using trace norm minimization without cluster size constraints

MaRDI QIDQ5502120zbMATH OpenFDO

Authors Nir Ailon, Yudong Chen, Huan Xu

Publication date 17 August 2015

Full work available at URL http://jmlr.csail.mit.edu/papers/v16/ailon15a.html

zbMATH Keywords

active clusteringcommunity detectionconvex optimizationgraph clusteringplanted partition modelstochastic block model

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Clustering partially observed graphs via convex optimization
• A simple spectral algorithm for recovering planted partitions
• Recovering nonuniform planted partitions via iterated projection
• scientific article; zbMATH DE number 6781370
• scientific article; zbMATH DE number 2089226

Cited in

(2)

• Clustering partially observed graphs via convex optimization
• Approximate Clustering with Same-Cluster Queries

This page was built for publication: Iterative and active graph clustering using trace norm minimization without cluster size constraints

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