Exemplar-based clustering via simulated annealing
From MaRDI portal
Publication:1036142
DOI10.1007/s11336-009-9115-2zbMath1272.62112OpenAlexW2095530301MaRDI QIDQ1036142
Hans-Friedrich Köhn, Michael J. Brusco
Publication date: 5 November 2009
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-009-9115-2
Related Items
A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis ⋮ K-medoids inverse regression ⋮ A heterogeneous Bayesian regression model for cross-sectional data involving a single observation per response unit ⋮ Affinity propagation: An exemplar‐based tool for clustering in psychological research ⋮ The heterogeneous \(p\)-median problem for categorization based clustering ⋮ Affinity propagation and uncapacitated facility location problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Optimization by Simulated Annealing
- Algorithm AS 136: A K-Means Clustering Algorithm
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- Optimal partitioning of a data set based on the \(p\)-median model
- CLASSI: A classification model for the study of sequential processes and individual differences therein
- Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
- A comparison of two dual-based procedures for solving the p-median problem
- A tree search algorithm for the p-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- Heuristic concentration: Two stage solution construction
- Heuristic concentration and tabu search: A head to head comparison
- Heuristic methods for large centroid clustering problems
- An efficient genetic algorithm for the \(p\)-median problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood decomposition search
- Algorithms of ant system and simulated annealing for the \(p\)-median 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 Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Cluster Analysis: An Application of Lagrangian Relaxation
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- A Dual-Bounded Algorithm for the p-Median Problem
- Finding Groups in Data
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- Variable neighborhood search for the p-median
- Integer Programming and the Theory of Grouping
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Cluster Analysis and Mathematical Programming
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
