Cluster Analysis Based on Posets

When dissimilarities are measured in a space other than the reals, it is argued that previous models for cluster analysis are not adequate. Possible new models will be explored. It is also shown that formal concept analysis may be viewed as a special case of a Boolean dissimilarity coefficient. A persistent underlying theme involves generalized notions of adjoints of order preserving mappings between posets.

[1]  J. William Ahwood,et al.  CLASSIFICATION , 1931, Foundations of Familiar Language.

[2]  R. P. Dilworth.  Review: G. Birkhoff, Lattice theory , 1950 .

[3]  P. Sneath,et al.  Numerical Taxonomy , 1962, Nature.

[4]  B. Balkay,et al.  Introduction to lattice theory , 1965 .

[5]  O. H. Lowry.  Academic press. , 1972, Analytical chemistry.

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

[7]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[8]  Melvin F. Janowitz,et al.  Ordinal and percentile clustering , 1989 .

[9]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

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

[11]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[12]  B. Ganter.  Formal Concept Analysis , 2009, Lecture Notes in Computer Science.