Exemplar-based clustering via simulated annealing
From MaRDI portal
Recommendations
- Optimal partitioning of a data set based on the \(p\)-median model
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- Heuristic methods for large centroid clustering problems
- A statistical analysis of simulated annealing applied to the p-median problem
- A hybrid heuristic for the \(p\)-median problem
Cites work
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 4048925 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 1138446 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- A Dual-Bounded Algorithm for the p-Median Problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A comparison of two dual-based procedures for solving the p-median problem
- A hybrid heuristic for the \(p\)-median problem
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- A statistical analysis of simulated annealing applied to the p-median problem
- A tree search algorithm for the p-median problem
- Algorithm AS 136: A K-Means Clustering Algorithm
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An efficient genetic algorithm for the \(p\)-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- CLASSI: A classification model for the study of sequential processes and individual differences therein
- Cluster Analysis and Mathematical Programming
- Cluster Analysis: An Application of Lagrangian Relaxation
- Clustering by passing messages between data points
- Computational study of large-scale \(p\)-median problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Finding Groups in Data
- Global optimization in any Minkowski metric: A permutation-translation simulated annealing algorithm for multidimensional scaling
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Heuristic concentration and tabu search: A head to head comparison
- Heuristic concentration: Two stage solution construction
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
- Heuristic methods for large centroid clustering problems
- Integer Programming and the Theory of Grouping
- Optimal partitioning of a data set based on the \(p\)-median model
- Optimization by simulated annealing
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Technical Note—An Algorithm for the p-Median Problem
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- The \(p\)-median problem: a survey of metaheuristic approaches
- The local minima problem in hierarchical classes analysis: an evaluation of a simulated annealing algorithm and various multistart procedures
- Variable neighborhood decomposition search
- Variable neighborhood search for the p-median
Cited in
(10)- A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysis
- A heterogeneous Bayesian regression model for cross-sectional data involving a single observation per response unit
- Optimal partitioning of a data set based on the \(p\)-median model
- Affinity propagation: An exemplar‐based tool for clustering in psychological research
- K-medoids inverse regression
- The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
- Affinity propagation and uncapacitated facility location problems
- An exemplar-based clustering using efficient variational message passing
- The heterogeneous \(p\)-median problem for categorization based clustering
- \(K\)-medoids and other criteria for crisp clustering
Describes a project that uses
Uses Software
This page was built for publication: Exemplar-based clustering via simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1036142)
