Cluster analysis and Q-analysis

https://doi.org/10.1016/S0020-7373(84)80031-0Get rights and content

Abstract

In this article the correspondence between a characteristic algorithm of Q-analysis and the single link method of cluster analysis is noted. Implications of the correspondence are discussed and more important differences between the approaches of Q-analysis and of cluster analysis are brought out.

References (26)

  • G.P. Chapman

    Q-analysis

  • B.S. Duran et al.
  • C.F. Earl et al.

    Graph theory and Q-analysis

    Environment and Planning B

    (1981)
  • Cited by (11)

    • Identifying the underlying structure and dynamic interactions in a voting network

      2007, Physica A: Statistical Mechanics and its Applications
      Citation Excerpt :

      Therefore, we have studied the formation of clusters or voting groups according to their dynamic structures. Macgill [29] suggests Q-Analysis as a technique that can be used to find the different groups which are formed on a network. However, his approach is focused just on a static structure.

    • Q-analysis for modeling and decision making

      1997, European Journal of Operational Research
    • Exploring the anchor-point hypothesis of spatial cognition

      1987, Journal of Environmental Psychology
    • Stars, maximal rectangles, lattices: a new perspective on Q-analysis

      1986, International Journal of Man-Machine Studies
    • For Geographical Network Analysis

      2021, Tijdschrift voor Economische en Sociale Geografie
    View all citing articles on Scopus
    View full text