Experiments in projection and clustering by simulated annealing

DOI10.1016/0031-3203(89)90067-8MaRDI QIDQ921811zbMATH OpenOpenAlexFDO

Authors Raymond W. Klein, Richard C. Dubes

Publication date 1989

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0031-3203(89)90067-8

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• A Projection Pursuit Algorithm for Exploratory Data Analysis
• An Algorithm for Euclidean Sum of Squares Classification
• Equation of state calculations by fast computing machines
• Experiments in projection and clustering by simulated annealing
• Generalized Simulated Annealing for Function Optimization
• scientific article; zbMATH DE number 3970026 (Why is no real title available?)
• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3800808 (Why is no real title available?)
• scientific article; zbMATH DE number 3413658 (Why is no real title available?)
• Optimization by simulated annealing

Cited in

(26)

• A latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data
• Constrained clustering and Kohonen self-organizing maps
• Simulated annealing: Practice versus theory
• On the distance function approach to color image enhancement
• Annealed chaotic neural network with nonlinear self-feedback and its application to clustering problem
• Clustering in non-stationary environments using a clan-based evolutionary approach
• Metaheuristics: A bibliography
• In memoriam: Richard C. Dubes
• Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery
• A biased random-key genetic algorithm for data clustering
• A scatter search approach for the minimum sum-of-squares clustering problem
• The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• A classification EM algorithm for clustering and two stochastic versions
• A global optimization RLT-based approach for solving the hard clustering problem
• A New Composite Algorithm for Clustering Problems
• Graph clustering
• The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule
• J-MEANS: A new local search heuristic for minimum sum of squares clustering
• A genetic approach to the automatic clustering problem
• Improving a centroid-based clustering by using suitable centroids from another clustering
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
• Global optimization in clustering using hyperbolic cross points
• Experiments in projection and clustering by simulated annealing
• Design of hybrids for the minimum sum-of-squares clustering problem
• A network flow model for biclustering via optimal re-ordering of data matrices

This page was built for publication: Experiments in projection and clustering by simulated annealing

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