On lattice consensus methods (Q1822176): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The median procedure in cluster analysis and social choice theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Metrics on spaces of finite trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4085109 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consensus n-trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Faithful consensus methods for n-trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4773020 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: s-consensus trees and indices / rank | |||
Normal rank | |||
Latest revision as of 19:40, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On lattice consensus methods |
scientific article |
Statements
On lattice consensus methods (English)
0 references
1986
0 references
Three types of classifications: partitions, dendrograms and n-trees are considered in this paper, which is dedicated to the study of the consensus problem. For a given type of classification, the consensus problem consists in aggregating different classifications into a single one of the same type. Lattice polynomials are the natural consensus functions for partitions and dendrograms. The authors extend lattice methods to n-trees introducing a new class of consensus functions.
0 references
Pareto axiom
0 references
betweenness axiom
0 references
partitions
0 references
dendrograms
0 references
n-trees
0 references
consensus problem
0 references
classifications
0 references
Lattice polynomials
0 references
