Clustering and isolation in the consensus problem for partitions (Q578812): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling of measures of distance between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics on spaces of finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing metric distances between partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and binary consensus functions on transitively valued relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657424 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:59, 18 June 2024

scientific article
Language Label Description Also known as
English
Clustering and isolation in the consensus problem for partitions
scientific article

    Statements

    Clustering and isolation in the consensus problem for partitions (English)
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    We examine the problem of aggregating several partitions of a finite set into a single consensus partition. We note that the dual concepts of clustering and isolation are especially significant in this connection. The hypothesis that a consensus partition should respect unanimity with respect to either concept leads us to stress a consensus interval rather than a single partition. The extremes of this inverval are characterized axiomatically. If a sufficient totality of traits has been measured, and if measurement errors are independent, then a ``true'' classifying partition can be expected to lie in the consensus interval. The structure of the partitions in the interval lends itself to partial solutions of the consensus problem. Conditional entropy may be used to quantify the uncertainty inherent in the interval as a whole.
    0 references
    0 references
    lattice of partitions
    0 references
    consensus function
    0 references
    consensus partition
    0 references
    clustering
    0 references
    isolation
    0 references
    measurement errors
    0 references
    consensus interval
    0 references
    Conditional entropy
    0 references