Consensus of Star Tree Hypergraphs.

Authors :: Bock, H. -H.
Gaul, W.
Vichi, M.
Arabie, Ph.
Baier, D.
Critchley, F.
Decker, R.
Diday, E.
Greenacre, M.
Lauro, C.
Meulman, J.
Monari, P.
Nishisato, S.
Ohsumi, N.
Opitz, O.
Ritter, G.
Schader, M.
Weihs, C.
Brito, Paula
Cucumel, Guy
Source :: Selected Contributions in Data Analysis & Classification; 2007, p325-329, 5p
Publication Year :: 2007
Abstract: Popular methods for forming the consensus of several hypergraphs of a given type (e.g., hierarchies, weak hierarchies) place a cluster in the output if it appears sufficiently often among the input hypergraphs. The simplest type of tree hypergraph is one whose clusters are subtrees of a star. This paper considers the possibility of forming consensus by simply counting the frequency of occurances of clusters for star hypergraphs. [ABSTRACT FROM AUTHOR]