A modification of the SINDCLUS algorithm for finding the ADCLUS and INCLUS models

DOI10.1007/S003579900014MaRDI QIDQ1378871zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20)

Cites work

• An alternating combinatorial optimization approach to fitting the INDCLUS and generalized INDCLUS models
• 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
• Computational solutions for the problem of negative saliences and nonsymmetry in INDSCAL
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• Some clarifications of the CANDECOMP algorithm applied to INDSCAL

Cited in

(5)

• ROOTCLUS: searching for ``ROOT clusters in three-way proximity data
• ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions
• FINDCLUS: fuzzy individual differences clustering
• Block-relaxation approaches for fitting the INDCLUS model
• A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering

Describes a project that uses

Uses Software

• Matlab
• MAPCLUS

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)