Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10851-016-0659-3 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2294754899 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.02088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of functional depending on jumps by elliptic functional via t-convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-based reparameterization framework for analysis of sum-product and related algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Statistical Network Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Graph Clusterings with Maximum Modularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convex Approach to Minimal Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering in general weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5828365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3295536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor graphs and the sum-product algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Multiclass Labeling Approaches and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonparametric Bayesian image segmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambrosio-Tortorelli segmentation of stochastic images: model extensions, theoretical investigations and numerical methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4445977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical Models, Exponential Families, and Variational Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10851-016-0659-3 / rank
 
Normal rank

Latest revision as of 14:40, 9 December 2024

scientific article
Language Label Description Also known as
English
Multicuts and perturb \& MAP for probabilistic graph clustering
scientific article

    Statements

    Multicuts and perturb \& MAP for probabilistic graph clustering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 November 2016
    0 references
    correlation clustering
    0 references
    multicut
    0 references
    graphical models
    0 references
    perturb and MAP
    0 references
    0 references
    0 references
    0 references

    Identifiers

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