Corpus ID: 10080736

Finding Dense Clusters via "Low Rank + Sparse" Decomposition

@article{Oymak2011FindingDC,
  title={Finding Dense Clusters via "Low Rank + Sparse" Decomposition},
  author={Samet Oymak and Babak Hassibi},
  journal={ArXiv},
  year={2011},
  volume={abs/1104.5186}
}
  • Samet Oymak, Babak Hassibi
  • Published in ArXiv 2011
  • Mathematics, Computer Science
  • Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature. It has various applications in pattern recognition, social networking and data mining. Recently, Ames and Vavasis have suggested a novel method for finding cliques in a graph by using convex optimization over the adjacency matrix of the graph. Also, there has been recent advances in decomposing a given matrix into its "low rank" and "sparse" components. In this paper, inspired… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 45 CITATIONS

    Sharp performance bounds for graph clustering via convex optimization

    VIEW 4 EXCERPTS
    CITES BACKGROUND

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

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Clustering Partially Observed Graphs via Convex Optimization

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Exact Clustering of Weighted Graphs via Semidefinite Programming

    VIEW 4 EXCERPTS
    CITES RESULTS, METHODS & BACKGROUND
    HIGHLY INFLUENCED

    A Divide and Conquer Framework for Distributed Graph Clustering

    VIEW 4 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    A simple spectral algorithm for recovering planted partitions

    VIEW 4 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Clustering from Labels and Time-Varying Graphs

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Guaranteed clustering and biclustering via semidefinite programming

    VIEW 3 EXCERPTS
    CITES METHODS & RESULTS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES

    Exact Matrix Completion via Convex Optimization

    I

    • N. Mishra, R. Schreiber
    • Stanton and R.E. Tarjan, “Clustering Social Networks.” in Proc. WAW
    • 2007
    VIEW 1 EXCERPT

    Spectral norm of random matrices

    • Van H. Vu
    • Mathematics, Computer Science
    • Combinatorica
    • 2007
    VIEW 1 EXCERPT

    M

    • N. Alon
    • Krivelevichy and V. H. Vu, “On the concentration of eigenvalues of random symmetric matrices.” Israel J. Math. 131
    • 2002
    VIEW 1 EXCERPT

    Graph Clustering

    VIEW 1 EXCERPT