Classification by ordering a (sparse) matrix: A ``simulated annealing approach

DOI10.1016/0307-904X(88)90027-3MaRDI QIDQ1098521zbMATH OpenOpenAlexFDO

Authors B. George

Publication date 1988

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904x(88)90027-3

zbMATH Keywords

simulated annealingclassificationsparse matrixtravelling salesmansubsystemscircularly connected matricesidentifying subsystem structurereordering algorithmsimilarity/interaction data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Operations research and management science (90B99)

Cites work

• scientific article; zbMATH DE number 4054827 (Why is no real title available?)
• scientific article; zbMATH DE number 3637090 (Why is no real title available?)
• An algorithm for reducing the moment of inertia of a system interaction matrix
• Identification and analysis of the subsystem structure of models
• Multidimensional scaling, tree-fitting, and clustering
• Optimization by simulated annealing

Cited in

(1)

• Methods for the one-dimensional space allocation problem

This page was built for publication: Classification by ordering a (sparse) matrix: A ``simulated annealing approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1098521)