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.
KeywordsIntersection Rule Consensus Function Consensus Method Unanimity Rule Counting Rule
Unable to display preview. Download preview PDF.
- Bertrand, P. (1995): Structural Properties of Pyramidal Clustering, In: Partitioning Data Sets. Cox, 1. et al. (eds.), DIMACS Series in Discrete Mathematics and Theoretical Cornputer Science, 19, 35–53, AMS, Providence, RI.Google Scholar
- Bertrand, P. and Diday, E. (1991): Les pyramides classifiantes: une extension de la structure hiérarchique, C. R. Acad. Sci. Paris, Série I, 693–696.Google Scholar
- Duchet, P. (1995): Hypergraphs, In: Handbook of Combinatorics, Graham, R. et al. (eds.), VOL. 1, 381–432, MIT Press, Cambridge, MA.Google Scholar
- Lehel, J. (1983): Helly-hypergraphs and abstract interval structures, ARS Combinatoria, 16-A, 239–253.Google Scholar