A hybrid stochastic genetic-GRASP algorithm for clustering analysis
DOI10.1007/S12351-008-0004-8zbMATH Open1183.90463OpenAlexW1970188500MaRDI QIDQ949381FDOQ949381
Authors: Yannis Marinakis, Magdalene Marinaki, Michael Doumpos, Constantin Zopounidis, Nikolaos F. Matsatsinis 
Publication date: 21 October 2008
Published in: Operational Research. An International Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12351-008-0004-8
Recommendations
- A hybrid ACO-GRASP algorithm for clustering analysis
- scientific article; zbMATH DE number 1974027
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
- Design of hybrids for the minimum sum-of-squares clustering problem
- An enhanced genetic algorithm with new mutation for cluster analysis
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Clustering in the social and behavioral sciences (91C20)
Cites Work
- Title not available (Why is that?)
- A classification EM algorithm for clustering and two stochastic versions
- Expanding neighborhood GRASP for the traveling salesman problem
- Tabu Search—Part I
- Mathematical classification and clustering
- Determination of cluster number in clustering microarray data
- Title not available (Why is that?)
- Data Mining and Knowledge Discovery Handbook
- Greedy randomized adaptive search procedures
- Tabu Search—Part II
- Differential evolution and particle swarm optimisation in partitional clustering
- Genetic Algorithms
- A hierarchical ant based clustering algorithm and its use in three real-world applications
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
- A genetic algorithm approach to cluster analysis.
- A computational study of several relocation methods for \(k\)-means algorithms.
- An aggregated clustering approach using multi-ant colonies algorithms
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A genetic approach to the automatic clustering problem
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
Cited In (15)
- Title not available (Why is that?)
- Investigation of a new GRASP-based clustering algorithm applied to biological data
- A biased random-key genetic algorithm for data clustering
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis
- Parallel Processing and Applied Mathematics
- CLUSTERING PANEL DATA VIA PERTURBED ADAPTIVE SIMULATED ANNEALING AND GENETIC ALGORITHMS
- Evolutionary Computation in Combinatorial Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- New genetic algorithm with greedy heuristic for clustering problems with unknown number of groups
- Genetic clustering algorithms.
- A hybrid ACO-GRASP algorithm for clustering analysis
- Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs
- Design of hybrids for the minimum sum-of-squares clustering problem
- Title not available (Why is that?)
This page was built for publication: A hybrid stochastic genetic-GRASP algorithm for clustering analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949381)
