A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
From MaRDI portal
Publication:1378871
DOI10.1007/s003579900014zbMath0900.92187MaRDI QIDQ1378871
Publication date: 1 November 1998
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003579900014
91C20: Clustering in the social and behavioral sciences
Related Items
A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering, FINDCLUS: fuzzy individual differences clustering, Block-relaxation approaches for fitting the INDCLUS model, ROOTCLUS: searching for ``ROOT clusters in three-way proximity data, ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions
Uses Software
Cites Work
- Unnamed Item
- Some clarifications of the CANDECOMP algorithm applied to INDSCAL
- An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
- Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming