Metric unfolding: Data requirement for unique solution P clarification of Schönemann's algorithm
From MaRDI portal
Publication:1846834
DOI10.1007/BF02291494zbMath0288.92023OpenAlexW2118846863MaRDI QIDQ1846834
Publication date: 1973
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02291494
Related Items (5)
Matrices with special reference to applications in psychometrics ⋮ An efficient alternating least-squares algorithm to perform multidimensional unfolding ⋮ Distance‐based logistic model for cross‐classified categorical data ⋮ Gleaning in the field of dual scaling ⋮ Unfolding a symmetric matrix
Cites Work
This page was built for publication: Metric unfolding: Data requirement for unique solution P clarification of Schönemann's algorithm
