Conditional clusters, musters, and probability (Q1169778): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MAPCLUS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0025-5564(82)90130-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965784238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAPCLUS: A mathematical programming approach to fitting the ADCLUS model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy in linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible clustering procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Length of a Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Packing and Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong consistency of k-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern recognition as a quest for minimum entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank

Latest revision as of 16:59, 13 June 2024

scientific article
Language Label Description Also known as
English
Conditional clusters, musters, and probability
scientific article

    Statements

    Conditional clusters, musters, and probability (English)
    0 references
    0 references
    1982
    0 references
    0 references
    connectedness of neighbourhoods
    0 references
    modifications
    0 references
    extensions
    0 references
    conditional clustering procedure
    0 references
    derivation of subset generating phase from extrem- value theory
    0 references
    musters
    0 references
    probability of membership
    0 references
    optimal covering
    0 references
    maximum-entropy principle
    0 references
    numerical examples
    0 references
    partitioning
    0 references
    weak musters
    0 references
    0 references