On lattice consensus methods (Q1822176)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4001235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On lattice consensus methods |
scientific article; zbMATH DE number 4001235 |
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
0.8063977360725403
0 references
0.8045101761817932
0 references
0.8006061315536499
0 references
0.7954517602920532
0 references
