论文信息 - Consensus Methods for Pyramids and Other Hypergraphs

Consensus Methods for Pyramids and Other Hypergraphs

A classification can most generally be viewed as a hypergraph, which is simply a set of subsets (clusters) of the finite set S of objects being studied. In this paper, we are primarily concerned with consensus functions on tree hypergraphs such as pyramids and totally balanced hypergraphs.

Fred R. McMorris | Jenö Lehel | R. C. Powers

[1] Patrice Bertrand. Structural Properties of Pyramidal Clustering , 1993, Partitioning Data Sets.

[2] P. Bertrand,et al. Les pyramides classifiantes : une extension de la structure hiérarchique , 1991 .

[3] D. A. Neumann. Faithful consensus methods for n-trees , 1983 .

[4] R. C. Powers,et al. Consensus weak hierarchies. , 1991, Bulletin of mathematical biology.

[5] E. N. Adams,et al. N-trees as nestings: Complexity, similarity, and consensus , 1986 .

[6] Pierre Hansen,et al. Partitioning Data Sets , 1995 .

[7] Fred R. McMorris,et al. Consensusn-trees , 1981 .

[8] Martin Schader,et al. Pyramidal classification based on incomplete dissimilarity data , 1994 .

[9] Bernard Van Cutsem,et al. Classification And Dissimilarity Analysis , 1994 .

[10] Robert C. Powers. Intersection rules for consensus n-trees , 1995 .

[11] W. Vach,et al. Preserving consensus hierarchies , 1994 .

[12] A. Dress,et al. Weak hierarchies associated with similarity measures--an additive clustering technique. , 1989, Bulletin of mathematical biology.

[13] D. A. Neumann,et al. Consensus functions defined on trees , 1983 .

[14] F. R. McMorris,et al. Intersection Rules for Consensus Hierarchies and Pyramids , 1996 .

[15] Jenö Lehel. A characterization of totally balanced hypergraphs , 1985, Discret. Math..