scientific article; zbMATH DE number 2089226

MaRDI QIDQ3046495zbMATH OpenFDO

Authors Ron Shamir, Dekel Tsur

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2368/23680230.htm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Improved algorithms for the random cluster graph model
• A simple spectral algorithm for recovering planted partitions
• scientific article; zbMATH DE number 6381736
• Correlation clustering with noisy input
• Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters

Cited in

(13)

• Clustering with \(r\)-regular graphs
• Population recovery and partial identification
• Generation of random clusters with specified degree of separation
• Optimal Fuzzy Aggregation of Networks
• Guaranteed clustering and biclustering via semidefinite programming
• An efficient generator for clustered dynamic random networks
• Compressive sensing for cut improvement and local clustering
• Batch edge-removal clustering based on random kNN graph
• Improved algorithms for the random cluster graph model
• Iterative and active graph clustering using trace norm minimization without cluster size constraints
• Clustering probabilistic graphs using neighbourhood paths
• Explainable graph clustering via expanders in the massively parallel computation model
• Fast online graph clustering via Erdős-Rényi mixture

This page was built for publication:

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