A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
From MaRDI portal
Publication:1378871
DOI10.1007/S003579900014zbMATH Open0900.92187OpenAlexW1993668358MaRDI QIDQ1378871FDOQ1378871
Authors: Henk A. L. Kiers 
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
Cites Work
- Title not available (Why is that?)
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
- Some clarifications of the CANDECOMP algorithm applied to INDSCAL
Cited In (5)
- ROOTCLUS: searching for ``ROOT clusters in three-way proximity data
- Block-relaxation approaches for fitting the INDCLUS model
- FINDCLUS: fuzzy individual differences clustering
- ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
Uses Software
This page was built for publication: A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1378871)
