The k-weak Hierarchical Representations: An Extension of the Indexed Closed Weak Hierarchies

Several approaches have been proposed for the purpose of proving that different classes of dissimilarities (e.g. ultrametrics) can be represented by certain types of stratified clusterings which are easily visualized (e.g. indexed hierarchies). These approaches differ in the choice of the clusters that are used to represent a dissimilarity coefficient. More precisely, the clusters may be defined as the maximal linked subsets, also called ML-sets; equally they may be defined as a particular type of 2-ball. In this paper, we first introduce the notion of a k-ball, thereby extending the notion of a 2-ball. For an arbitrary dissimilarity coefficient, we establish some properties of the k-balls that pinpoint the connection between them and the ML-sets. We also introduce the (2,k)-point condition (k ≥ 1) which is an extension of the Bandelt four-point condition.For k ≥ 2, we prove that the dissimilarities satisfying the (2, k)-point condition are in one-one correspondence with a class of stratified clusterings, called k-weak hierarchical representations, whose main characteristic is that the intersection of (k + 1) arbitrary clusters may be reduced to the intersection of some k of these clusters.

[1]  S. C. Johnson Hierarchical clustering schemes , 1967, Psychometrika.

[2]  Jean Diatta,et al.  From Apresjan Hierarchies and Bandelt-Dress Weak hierarchies to Quasi-hierarchies , 1994 .

[3]  M. Schader,et al.  New Approaches in Classification and Data Analysis , 1994 .

[4]  Melvin F. Janowitz,et al.  Pyramids and weak hierarchies in the ordinal model for clustering , 2002, Discret. Appl. Math..

[5]  Frank Critchley,et al.  An order-theoretic unification and generalisation of certain fundamental bijections in mathematical classification. I , 1994 .

[6]  J. Leeuw,et al.  Multidimensional Data Analysis , 1989 .

[7]  Lawrence Hubert,et al.  Advances in Cluster Analysis Relevant to Marketing Research , 1996 .

[8]  Edwin Diday,et al.  Orders and overlapping clusters by pyramids , 1987 .

[9]  Hans-Hermann Bock,et al.  Classification and Related Methods of Data Analysis , 1988 .

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

[11]  Hans-Jürgen Bandelt,et al.  An order theoretic framework for overlapping clustering , 1994, Discret. Math..

[12]  Phipps Arabie,et al.  AN OVERVIEW OF COMBINATORIAL DATA ANALYSIS , 1996 .

[13]  G. De Soete,et al.  Clustering and Classification , 2019, Data-Driven Science and Engineering.

[14]  M. F. Janowitz,et al.  An Order Theoretic Model for Cluster Analysis , 1978 .

[15]  Boris Mirkin,et al.  Mathematical Classification and Clustering , 1996 .

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

[17]  E. Diday Une représentation visuelle des classes empiétantes: les pyramides , 1986 .

[18]  Jean Diatta Dissimilarités multivoies et généralisations d'hypergraphes sans triangles , 1997 .

[19]  Patrice Bertrand Set Systems and Dissimilarities , 2000, Eur. J. Comb..

[20]  Jean Diatta,et al.  Quasi-ultrametrics and their 2-ball hypergraphs , 1998, Discret. Math..