1983
DOI: 10.1016/0165-4896(83)90099-9
|View full text |Cite
|
Sign up to set email alerts
|

Consensus functions defined on trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

1986
1986
2007
2007

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 57 publications
(12 citation statements)
references
References 8 publications
0
12
0
Order By: Relevance
“…Since being introduced in the 1970s and extensively studied in the 1980s, consensus methods for trees have proved to be useful tools in systematics. Consensus methods, such as majority rule, are used in analyses of rooted trees with labelled leaves by Margush & McMorris (1981), McMorris & Neumann (1983), and Barthelemy & McMorris (1986). An entire issue of the Journal of Class(fication featured papers about consensus classifications (Day 1986), notable among them the review by of how ordered set theory provides both framework and tools for investigating problems on the consensus and comparison of classifications.…”
Section: Discussionmentioning
confidence: 99%
“…Since being introduced in the 1970s and extensively studied in the 1980s, consensus methods for trees have proved to be useful tools in systematics. Consensus methods, such as majority rule, are used in analyses of rooted trees with labelled leaves by Margush & McMorris (1981), McMorris & Neumann (1983), and Barthelemy & McMorris (1986). An entire issue of the Journal of Class(fication featured papers about consensus classifications (Day 1986), notable among them the review by of how ordered set theory provides both framework and tools for investigating problems on the consensus and comparison of classifications.…”
Section: Discussionmentioning
confidence: 99%
“…In the following sections, we recall or establish properties of polynomial rules One has to observe that, sometimes, these rules do not give interesting consensus classifications For instance, when the n-trees of a profile 7r E T~ are too different, the majority rule n-tree is the bush T~ with only trivial clusters Several nonpolynomial consensus methods on n-trees have been proposed (Adams 1972, Neumann 1983, Stinebrickner 1984, Finden and Gordon 1985, Neumann and Norton 1985. Though the properties of these methods are not always clear, they may give nontrivial consensus ntrees in situations where polynomial rules do not work satisfactorily One may use a consensus index (see Section 3 4) in order to avoid using a consensus n-tree when the elements of the profile are irreconcilable The situation is quite the same in the cases of ordered trees or Buneman trees…”
Section: Consensus Rules and Lattice Polynomial Functionsmentioning
confidence: 99%
“…In the last thirty years many consensus clustering methods have been proposed (e.g., Regnier, 1965;Adams, 1972;McMorris and Neuman, 1983;Day, 1983). In 1986, a special issue of the Journal of Classification was devoted to consensus classifications.…”
Section: Consensus Clusteringmentioning
confidence: 99%