2007 · 11 citations · 28 references
ComputingData ScienceData MiningSpatial Data AnalysisStatistical ComputingCluster DetectionData PartitioningGenetic AlgorithmsPopulation-based SearchSpatial Data MiningSpatial PartitioningClusteringClustering AlgorithmsClustering AnalysisHigh-dimensional Data ClusteringMutationRecursive PartitioningTermination CriteriaTest Cases
This paper presents a recursive clustering scheme that uses a genetic algorithm-based search in a dichotomous partition space. The proposed algorithm makes no assumption on the number of clusters present in the dataset; instead it recursively uncovers subsets in the data until all isolated and separated regions have been classified as clusters. A test of spatial randomness serves as a termination criteria for the recursive process. Within each recursive step, a genetic algorithm searches the partition space for an optimal dichotomy of the dataset. A simple binary representation is used for the genetic algorithm, along with classical selection, crossover and mutation operators. Results of clustering on test cases, ranging from simple datasets in 2-D to large multidimensional datasets compare favorably with state of the art approaches in genetic algorithm-driven clustering.
28
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
Ronald Aylmer Fisher · Annals of Eugenics · 1936 · 14.7K citations · Full text
Algorithms for clustering data
Bernhard Flury · Journal of Statistical Planning and Inference · 1989 · 6.5K citations
UCI Repository of Machine Learning Databases
Patrick M. Murphy · Medical Entomology and Zoology · 1994 · 1.8K citations