IDEAS home Printed from https://ideas.repec.org/a/spr/psycho/v39y1974i3p283-309.html
   My bibliography  Save this article

Some applications of graph theory to clustering

Author

Listed:
  • Lawrence Hubert

Abstract

No abstract is available for this item.

Suggested Citation

  • Lawrence Hubert, 1974. "Some applications of graph theory to clustering," Psychometrika, Springer;The Psychometric Society, vol. 39(3), pages 283-309, September.
    • Handle: RePEc:spr:psycho:v:39:y:1974:i:3:p:283-309
    DOI: 10.1007/BF02291704
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF02291704
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF02291704?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. C. Gower & G. J. S. Ross, 1969. "Minimum Spanning Trees and Single Linkage Cluster Analysis," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 18(1), pages 54-64, March.
    2. Lawrence Hubert, 1972. "Some extensions of Johnson's hierarchical clustering algorithms," Psychometrika, Springer;The Psychometric Society, vol. 37(3), pages 261-274, September.
    3. Ian Ross & Frank Harary, 1952. "On the determination of redundancies in sociometric chains," Psychometrika, Springer;The Psychometric Society, vol. 17(2), pages 195-208, June.
    4. R. Luce & Albert Perry, 1949. "A method of matrix analysis of group structure," Psychometrika, Springer;The Psychometric Society, vol. 14(2), pages 95-116, June.
    5. Lawrence Hubert, 1973. "Min and max hierarchical clustering using asymmetric similarity measures," Psychometrika, Springer;The Psychometric Society, vol. 38(1), pages 63-72, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. W. Krzanowski & Gregory Cermak & Jan Leeuw & Fionn Murtagh & Peter Bryant & Bernard Monjardet & Chikio Hayashi, 1985. "Book reviews," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 277-299, December.
    2. Joachim Harloff, 2011. "Extracting cover sets from free fuzzy sorting data," Quality & Quantity: International Journal of Methodology, Springer, vol. 45(6), pages 1445-1457, October.
    3. Herden, Gerhard & Pallack, Andreas, 2002. "Consistency in ordinal data analysis I," Mathematical Social Sciences, Elsevier, vol. 43(1), pages 79-113, January.
    4. Edmund Peay, 1975. "Nonmetric grouping: Clusters and cliques," Psychometrika, Springer;The Psychometric Society, vol. 40(3), pages 297-313, September.
    5. N. Sriram, 1990. "Clique optimization: A method to construct parsimonious ultrametric trees from similarity data," Journal of Classification, Springer;The Classification Society, vol. 7(1), pages 33-52, March.
    6. William Day & Herbert Edelsbrunner, 1985. "Investigation of proportional link linkage clustering methods," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 239-254, December.
    7. G. Damiana Costanzo, 2001. "A constrainedk-means clustering algorithm for classifying spatial units," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 10(1), pages 237-256, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Noah E. Friedkin, 1984. "Structural Cohesion and Equivalence Explanations of Social Homogeneity," Sociological Methods & Research, , vol. 12(3), pages 235-261, February.
    2. Zhu, Yongjun & Yan, Erjia, 2017. "Examining academic ranking and inequality in library and information science through faculty hiring networks," Journal of Informetrics, Elsevier, vol. 11(2), pages 641-654.
    3. Beibei Zhang & Rong Chen, 2018. "Nonlinear Time Series Clustering Based on Kolmogorov-Smirnov 2D Statistic," Journal of Classification, Springer;The Classification Society, vol. 35(3), pages 394-421, October.
    4. Etienne Farvaque & Frédéric Gannon, 2018. "Profiling giants: the networks and influence of Buchanan and Tullock," Public Choice, Springer, vol. 175(3), pages 277-302, June.
    5. Sung-Soo Kim & W. Krzanowski, 2007. "Detecting multiple outliers in linear regression using a cluster method combined with graphical visualization," Computational Statistics, Springer, vol. 22(1), pages 109-119, April.
    6. Vanhaverbeke, W.P.M. & Beerkens, B.E. & Duysters, G.M., 2003. "Explorative and exploitative learning strategies in technology-based alliance networks," Working Papers 03.22, Eindhoven Center for Innovation Studies.
    7. Kirschstein, Thomas & Liebscher, Steffen & Becker, Claudia, 2013. "Robust estimation of location and scatter by pruning the minimum spanning tree," Journal of Multivariate Analysis, Elsevier, vol. 120(C), pages 173-184.
    8. William Day & Herbert Edelsbrunner, 1985. "Investigation of proportional link linkage clustering methods," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 239-254, December.
    9. K. Parthasarathy, 1964. "Enumeration of paths in digraphs," Psychometrika, Springer;The Psychometric Society, vol. 29(2), pages 153-165, June.
    10. Nasirian, Farzaneh & Mahdavi Pajouh, Foad & Balasundaram, Balabhaskar, 2020. "Detecting a most closeness-central clique in complex networks," European Journal of Operational Research, Elsevier, vol. 283(2), pages 461-475.
    11. Jean-Pierre Barthélemy & Bruno Leclerc & Bernard Monjardet, 1986. "On the use of ordered sets in problems of comparison and consensus of classifications," Journal of Classification, Springer;The Classification Society, vol. 3(2), pages 187-224, September.
    12. Giuseppe Bove & Akinori Okada, 2018. "Methods for the analysis of asymmetric pairwise relationships," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(1), pages 5-31, March.
    13. Sergio Scippacercola, 2011. "The Factorial Minimum Spanning Tree as a Reference for a Synthetic Index of Complex Phenomena," Journal of Classification, Springer;The Classification Society, vol. 28(1), pages 21-37, April.
    14. William Ray Arney, 1973. "A Refined Status Index for Sociometric Data," Sociological Methods & Research, , vol. 1(3), pages 329-346, February.
    15. Bruno Leclerc, 1995. "Minimum spanning trees for tree metrics: abridgements and adjustments," Journal of Classification, Springer;The Classification Society, vol. 12(2), pages 207-241, September.
    16. Zhimei Lei & Kuo-Jui Wu & Li Cui & Ming K Lim, 2018. "A Hybrid Approach to Explore the Risk Dependency Structure among Agribusiness Firms," Sustainability, MDPI, vol. 10(2), pages 1-17, February.
    17. P B Slater & Referee C Wymer, 1987. "Algorithm 13: Strong Component Hierarchical Clustering," Environment and Planning A, , vol. 19(1), pages 117-125, January.
    18. Raymond, Ben & Hosie, Graham, 2009. "Network-based exploration and visualisation of ecological data," Ecological Modelling, Elsevier, vol. 220(5), pages 673-683.
    19. Chitra Balasubramaniam & Sergiy Butenko, 2017. "On robust clusters of minimum cardinality in networks," Annals of Operations Research, Springer, vol. 249(1), pages 17-37, February.
    20. Gouvêa, Alessandra M.M.M. & Rubido, Nicolás & Macau, Elbert E.N. & Quiles, Marcos G., 2022. "Importance of Numerical Implementation and Clustering Analysis in Force-Directed Algorithms for Accurate Community Detection," Applied Mathematics and Computation, Elsevier, vol. 431(C).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:psycho:v:39:y:1974:i:3:p:283-309. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.