Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures
From MaRDI portal
Publication:1362283
DOI10.1007/BF02294782zbMATH Open0912.62125OpenAlexW1987047807MaRDI QIDQ1362283FDOQ1362283
J. Wesley Hutchinson, Amitabh Mungale
Publication date: 26 April 1999
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02294782
Applications of statistics to psychology (62P15) Clustering in the social and behavioral sciences (91C20)
Cites Work
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Title not available (Why is that?)
- Free trees and bidirectional trees as representations of psychological distance
- MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
- Hierarchical clustering schemes
- Spatial versus tree representations of proximity data
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Title not available (Why is that?)
- Monotone invariant clustering procedures
- Correspondence analysis and optimal structural representations
- A metric and an ordering on sets
- Extended similarity trees
- A nonmetric variety of linear factor analysis
Cited In (3)
Uses Software
Recommendations
This page was built for publication: Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362283)