Pages that link to "Item:Q4287141"
From MaRDI portal
The following pages link to A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm (Q4287141):
Displayed 15 items.
- Fast global \(k\)-means clustering based on local geometrical information (Q497555) (← links)
- A hybrid ACO-GRASP algorithm for clustering analysis (Q646719) (← links)
- Evolution of the population of a genetic algorithm using particle swarm optimization: application to clustering analysis (Q840098) (← links)
- A hybrid stochastic genetic-GRASP algorithm for clustering analysis (Q949381) (← links)
- Design of hybrids for the minimum sum-of-squares clustering problem (Q951921) (← links)
- A Monte Carlo evaluation of the moving method, \(k\)-means and two self-organising neural networks (Q1271314) (← links)
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) (Q1433467) (← links)
- Clustering in non-stationary environments using a clan-based evolutionary approach (Q1899919) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A scatter search approach for the minimum sum-of-squares clustering problem (Q2485180) (← links)
- A mixed-integer programming approach to the clustering problem with an application in customer segmentation (Q2497271) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- A selection process for genetic algorithm using clustering analysis (Q2633197) (← links)
- VNSOptClust: A Variable Neighborhood Search Based Approach for Unsupervised Anomaly Detection (Q3627769) (← links)
- J-MEANS: A new local search heuristic for minimum sum of squares clustering (Q5957595) (← links)
