Some applications of graph theory to clustering

This paper attempts to review and expand upon the relationship between graph theory and the clustering of a set of objects. Several graphtheoretic criteria are proposed for use within a general clustering paradigm as a means of developing procedures “in between” the extremes of complete-link and single-link hierarchical partitioning; these same ideas are then extended to include the more general problem of constructing subsets of objects with overlap. Finally, a number of related topics are surveyed within the general context of reinterpreting and justifying methods of clustering either through standard concepts in graph theory or their simple extensions.

[1]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[2]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[3]  L. Festinger.  The Analysis of Sociograms using Matrix Algebra , 1949 .

[4]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[5]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.

[6]  James Chabot.  A Simplified Example of the Use of Matrix Multiplication for the Analysis of Sociometric Data , 1950 .

[7]  F. Harary,et al.  On the determination of redundancies in sociometric chains , 1952 .

[8]  R. Luce.  Two Decomposition Theorems for a Class of Finite Oriented Graphs , 1952 .

[9]  R. Luce.  Networks Satisfying Minimality Conditions , 1953 .

[10]  F. Harary,et al.  Identification of the Liaison Persons of an Organization Using the Structure Matrix , 1955 .

[11]  R. Weiss,et al.  A Method for the Analysis of the Structure of Complex Organizations , 1955 .

[12]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[13]  L. Mcquitty.  Elementary Linkage Analysis for Isolating Orthogonal and Oblique Types and Typal Relevancies , 1957 .

[14]  Frank Harary,et al.  A Procedure for Clique Detection Using the Group Matrix , 1957 .

[15]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[16]  F. Harary,et al.  A Description of Strengthening and Weakening Members of a Group , 1959 .

[17]  F. Restle.  A metric and an ordering on sets , 1959 .

[18]  Louis L. Mc Quitty.  ELEMENTARY FACTOR ANALYSIS , 1961 .

[19]  O. Ore.  Theory of Graphs , 1962 .

[20]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[21]  O. Ore,et al.  Graphs and Their Uses , 1964 .

[22]  L. Mcquitty.  Rank Order Typal Analysis , 1963 .

[23]  Raymond E. Bonner,et al.  On Some Clustering Techniques , 1964, IBM J. Res. Dev..

[24]  Louis L. McQuitty,et al.  Capabilities and Improvements of Linkage Analysis as a Clustering Method , 1964 .

[25]  Frank Harary,et al.  A graph theoretic approach to similarity relations , 1964 .

[26]  M. J. Rose,et al.  Classification of a set of elements , 1964, Comput. J..

[27]  Manfred. Kochen.  Some problems in information science , 1965 .

[28]  Norman,et al.  Structural Models: An Introduction to the Theory of Directed Graphs. , 1966 .

[29]  G. Estabrook.  A mathematical model in graph theory for biological classification. , 1966, Journal of theoretical biology.

[30]  D. Rogers,et al.  A Graph Theory Model for Systematic Biology, with an Example for the Oncidiinae (Orchidaceae) , 1966 .

[31]  Paul Constantinescu,et al.  The Classification of a Set of Elements with Respect to a Set of Properties , 1966, Computer/law journal.

[32]  Daniel E. Bailey,et al.  The BC Try Computer System of Cluster And Factor Analysis , 1966 .

[33]  R B Cattell,et al.  Principles of behavioural taxonomy and the mathematical basis of the taxonome computer program. , 1966, The British journal of mathematical and statistical psychology.

[34]  G. N. Lance,et al.  A general theory of classificatory sorting strategies: II. Clustering systems , 1967, Comput. J..

[35]  A METHOD OF CLUSTER ANALYSIS , 1967 .

[36]  G. N. Lance,et al.  A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems , 1967, Comput. J..

[37]  J. Hartigan.  REPRESENTATION OF SIMILARITY MATRICES BY TREES , 1967 .

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

[39]  J. Gower.  A comparison of some methods of cluster analysis. , 1967, Biometrics.

[40]  Louis L. McQuitty,et al.  A Mutual Development of Some Typological Theories and Pattern-Analytic Methods , 1967 .

[41]  Louis L. McQuitty,et al.  Clusters from Iterative, Intercolumnar Correlational Analysis , 1968 .

[42]  Calvin C. Gotlieb,et al.  Semantic Clustering of Index Terms , 1968, J. ACM.

[43]  R. Sibson,et al.  A model for taxonomy , 1968 .

[44]  Robin Sibson,et al.  The Construction of Hierarchic and Non-Hierarchic Classifications , 1968, Comput. J..

[45]  A. J. Willmott,et al.  Cluster analysis on the Atlas computer , 1968, Comput. J..

[46]  Peter K. T. Vaswani.  A technique for cluster emphasis and its application to automatic indexing , 1968, IFIP Congress.

[47]  John C. Ogilvie.  The distribution of number and size of connected components in random graphs of medium size , 1968, IFIP Congress.

[48]  Patrick Doreman,et al.  A Note on the Detection of Cliques in Valued Graphs , 1969 .

[49]  Frank Harary,et al.  Graph Theory , 2016 .

[50]  J. Gower,et al.  Minimum Spanning Trees and Single Linkage Cluster Analysis , 1969 .

[51]  Louis L. McQuitty,et al.  Some Problems and Elaborations of Iterative, Intercolumnar Correlational Analysis , 1970 .

[52]  Jack Minker,et al.  Deriving term relations for a corpus by graph theoretical clusters , 1970 .

[53]  Jack Minker,et al.  An Analysis of Some Graph Theoretical Cluster Techniques , 1970, JACM.

[54]  S. S. Anderson.  Graph theory and finite combinatorics , 1970 .

[55]  N. Jardine.  Discussion and Correspondence Algorithms, methods and models in the simplification of complex data , 1970 .

[56]  A. J. Cole,et al.  An Improved Algorithm for the Jardine-Sibson Method of Generating Overlapping Clusters , 1970, Computer/law journal.

[57]  Amnon Rapoport,et al.  Structures in the subjective lexicon , 1971 .

[58]  R. M. Cormack,et al.  A Review of Classification , 1971 .

[59]  Karen Sparck Jones.  Automatic keyword classification for information retrieval , 1971 .

[60]  M. Levandowsky,et al.  Distance between Sets , 1971, Nature.

[61]  N. JARDINE,et al.  A New Approach to Pattern Recognition , 1971, Nature.

[62]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.

[63]  Robin Sibson,et al.  Some Observations on a Paper by Lance and Williams , 1971, Comput. J..

[64]  I. C. Lerman,et al.  Les bases de la classification automatique , 1971 .

[65]  G. N. Lance,et al.  Controversy Concerning the Criteria for Taxonometric Strategies , 1971, Computer/law journal.

[66]  Derek G. Corneil,et al.  Corrections to Bierstone's Algorithm for Generating Cliques , 1972, J. ACM.

[67]  L. Hubert.  Some extensions of Johnson's hierarchical clustering algorithms , 1972 .

[68]  D. Matula,et al.  GRAPH COLORING ALGORITHMS , 1972 .

[69]  B. Roy.  AN ALGORITHM FOR A GENERAL CONSTRAINED SET COVERING PROBLEM , 1972 .

[70]  Pierre Legendre,et al.  CHARACTERS AND CLUSTERING IN TAXONOMY: A SYNTHESIS OF TWO TAXIMETRIC PROCEDURES1 , 1972 .

[71]  L. Bobisud,et al.  A METRIC FOR CLASSIFICATIONS , 1972 .

[72]  Robert F. Ling,et al.  On the theory and construction of k-clusters , 1972, Comput. J..

[73]  D. Matula.  k-Components, Clusters and Slicings in Graphs , 1972 .

[74]  R. F. Ling.  A Probability Theory of Cluster Analysis , 1973 .

[75]  L. Hubert.  Monotone invariant clustering procedures , 1973 .

[76]  T. B. Boffey,et al.  Applied Graph Theory , 1973 .

[77]  S. Boorman,et al.  Metrics on spaces of finite trees , 1973 .

[78]  L. Hubert,et al.  Data analysis and the connectivity of random graphs , 1973 .

[79]  L. Hubert.  Min and max hierarchical clustering using asymmetric similarity measures , 1973 .

[80]  L. Hubert.  Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures , 1974 .

[81]  L. Hubert.  SPANNING TREES AND ASPECTS OF CLUSTERING , 1974 .

[82]  Brian Everitt,et al.  Cluster analysis , 1974 .

[83]  E. R. Peay.  Nonmetric grouping: Clusters and cliques , 1975 .

[84]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .