Genetic Algorithms (GAs) are generally portrayed as a search procedure which can optimize functions based on a limited sample of function values. In this paper, an objective function based on minimal spanning tree (MST) of data points is proposed for clustering and GAs have been used in an attempt to optimize the specified objective function in order to detect the natural grouping in a given data set. Several experiments on synthetic data set in SR2 show the utility of the proposed method. The method is also applicable to any higher dimensional data. © Springer-Verlag 2004.
CITATION STYLE
Chowdhury, N., & Jana, P. (2004). Finding the natural groupings in a data set using genetic algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3285, 26–33. https://doi.org/10.1007/978-3-540-30176-9_4
Mendeley helps you to discover research relevant for your work.