Species Associations and Conditional Clustering: Clustering With or Without Pairwise Resemblances

Traditional procedures for clustering objects consist of two steps: measuring pairwise resemblance based on the attributes, and a clustering algorithm. The use of pairwise resemblances can be avoided; a set of objects can be represented as a set of lists of attribute states; an application of the Laplace indifference principle then allows an estimate to be made of the probability of each list as representative of an association of objects. By use of set-covering procedures, the object associations having maximum joint probability are found. The procedure is generalized to multistate unordered and ordered attributes, to frequencies, and to directly obtained relational data.

[1]  J. Gower.  A General Coefficient of Similarity and Some of Its Properties , 1971 .

[2]  L. P. Lefkovitch.  Entropy and set covering , 1985, Inf. Sci..

[3]  Rodney W. Johnson,et al.  Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy , 1980, IEEE Trans. Inf. Theory.

[4]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[5]  G. Nemhauser,et al.  Integer Programming , 2020 .

[6]  Tue Tjur,et al.  A Connection between Rasch's Item Analysis Model and a Multiplicative Poisson Model , 1982 .

[7]  M. Lundy.  Applications of the annealing algorithm to combinatorial problems in statistics , 1985 .

[8]  Erling B. Andersen,et al.  Discrete Statistical Models with Social Science Applications. , 1980 .

[9]  L. Lefkovitch,et al.  A Nonparametric Method for Comparing Dissimilarity Matrices, a General Measure of Biogeographical Distance, and Their Application , 1984, The American Naturalist.

[10]  J. Gower,et al.  Metric and Euclidean properties of dissimilarity coefficients , 1986 .

[11]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[12]  L. Lefkovitch.  Hierarchical clustering from principal coordinates: an efficient method for small to very large numbers of objects , 1976 .

[13]  Georg Rasch,et al.  Probabilistic Models for Some Intelligence and Attainment Tests , 1981, The SAGE Encyclopedia of Research Design.

[14]  L. Lefkovitch,et al.  Conditional clusters, musters, and probability , 1982 .