Exact Clustering of Weighted Graphs via Semidefinite Programming (Q4633040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact Recovery in the Stochastic Block Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed clustering and biclustering via semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex optimization for the planted \(k\)-disjoint-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite relaxations for the block model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp nonasymptotic bounds on the norm of random matrices with independent entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4907706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust and computationally feasible community detection in the presence of arbitrary outlier nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral clustering in stochastic block models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovery guarantees for exemplar-based clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating K‐means‐type Clustering via Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral clustering and the high-dimensional stochastic blockmodel / rank
 
Normal rank
Property / cites work
 
Property / cites work: The highest dimensional stochastic blockmodel with a regularized estimator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank

Latest revision as of 03:34, 19 July 2024

scientific article; zbMATH DE number 7049749
Language Label Description Also known as
English
Exact Clustering of Weighted Graphs via Semidefinite Programming
scientific article; zbMATH DE number 7049749

    Statements

    0 references
    0 references
    2 May 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    clustering
    0 references
    densest subgraph
    0 references
    stochastic block models
    0 references
    semidefinite programming
    0 references
    sparse graphs
    0 references
    math.OC
    0 references
    stat.ML
    0 references
    0 references