Experiments in projection and clustering by simulated annealing
From MaRDI portal
Publication:921811
DOI10.1016/0031-3203(89)90067-8zbMath0709.62613OpenAlexW2080847832MaRDI QIDQ921811
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
Related Items (26)
Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem ⋮ Clustering in non-stationary environments using a clan-based evolutionary approach ⋮ Metaheuristics: A bibliography ⋮ Global optimization in clustering using hyperbolic cross points ⋮ Constrained clustering and Kohonen self-organizing maps ⋮ A biased random-key genetic algorithm for data clustering ⋮ A New Composite Algorithm for Clustering Problems ⋮ Graph clustering ⋮ Experiments in projection and clustering by simulated annealing ⋮ Model-based feature selection and clustering of RNA-seq data for unsupervised subtype discovery ⋮ Design of hybrids for the minimum sum-of-squares clustering problem ⋮ A scatter search approach for the minimum sum-of-squares clustering problem ⋮ The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule ⋮ A network flow model for biclustering via optimal re-ordering of data matrices ⋮ J-MEANS: A new local search heuristic for minimum sum of squares clustering ⋮ A genetic approach to the automatic 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 latent class multidimensional scaling model for two-way one-mode continuous rating dissimilarity data ⋮ On the distance function approach to color image enhancement ⋮ In memoriam: Richard C. Dubes ⋮ Improving a centroid-based clustering by using suitable centroids from another clustering ⋮ A classification EM algorithm for clustering and two stochastic versions ⋮ A global optimization RLT-based approach for solving the hard clustering problem ⋮ Annealed chaotic neural network with nonlinear self-feedback and its application to clustering problem ⋮ Simulated annealing: Practice versus theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- Experiments in projection and clustering by simulated annealing
- Generalized Simulated Annealing for Function Optimization
- An Algorithm for Euclidean Sum of Squares Classification
- A Projection Pursuit Algorithm for Exploratory Data Analysis
- Equation of State Calculations by Fast Computing Machines
- A Heuristic Relaxation Method for Nonlinear Mapping in Cluster Analysis
This page was built for publication: Experiments in projection and clustering by simulated annealing
