A hybrid ACO-GRASP algorithm for clustering analysis
From MaRDI portal
Publication:646719
DOI10.1007/s10479-009-0519-2zbMath1228.90159OpenAlexW2073652965MaRDI QIDQ646719
Constantin Zopounidis, Yannis Marinakis, Michael Doumpos, Magdalene Marinaki, Nikolaos F. Matsatsinis
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0519-2
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis ⋮ Validity indices for clusters of uncertain data objects
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchical ant based clustering algorithm and its use in three real-world applications
- Differential evolution and particle swarm optimisation in partitional clustering
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
- A computational study of several relocation methods for \(k\)-means algorithms.
- Greedy randomized adaptive search procedures
- A genetic algorithm approach to cluster analysis.
- Expanding neighborhood GRASP for the traveling salesman problem
- An aggregated clustering approach using multi-ant colonies algorithms
- A classification EM algorithm for clustering and two stochastic versions
- Mathematical classification and clustering
- Determination of cluster number in clustering microarray data
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Tabu Search—Part I
- Tabu Search—Part II
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- A genetic approach to the automatic clustering problem
This page was built for publication: A hybrid ACO-GRASP algorithm for clustering analysis
