Guaranteed clustering and biclustering via semidefinite programming (Q463740): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 10 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-013-0729-x / rank
Normal rank
 
Property / author
 
Property / author: Brendan P. W. Ames / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SPGL1 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965656937 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1202.3663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Approach to Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / 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: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis / 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: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclustering in data mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalues of random symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the norm of random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the Notion of Order of Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / 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: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Null space conditions and thresholds for rank minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / 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: Q3046495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensemble clustering using semidefinite programming with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probing the Pareto Frontier for Basis Pursuit Solutions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-013-0729-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Guaranteed clustering and biclustering via semidefinite programming
scientific article

    Statements

    Guaranteed clustering and biclustering via semidefinite programming (English)
    0 references
    0 references
    17 October 2014
    0 references
    semidefinite programming
    0 references
    clustering
    0 references
    planted clique
    0 references
    biclustering
    0 references
    co-clustering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references