On lattice consensus methods
From MaRDI portal
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.
Recommendations
Cites work
- Consensus n-trees
- Faithful consensus methods for n-trees
- scientific article; zbMATH DE number 3504320 (Why is no real title available?)
- scientific article; zbMATH DE number 3448387 (Why is no real title available?)
- Metrics on spaces of finite trees
- s-consensus trees and indices
- The median procedure in cluster analysis and social choice theory
Cited in
(9)- On the use of ordered sets in problems of comparison and consensus of classifications
- Preserving consensus hierarchies
- On a dependence relation in finite lattices
- Arrowian characterizations of latticial federation consensus functions
- scientific article; zbMATH DE number 3903773 (Why is no real title available?)
- scientific article; zbMATH DE number 4034892 (Why is no real title available?)
- scientific article; zbMATH DE number 1140607 (Why is no real title available?)
- Ensemble clustering in the belief functions framework
- Faithful consensus methods for n-trees
This page was built for publication: On lattice consensus methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822176)