{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:24:03Z","timestamp":1767612243275,"version":"build-2065373602"},"reference-count":55,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,4,21]],"date-time":"2018-04-21T00:00:00Z","timestamp":1524268800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>K-means clustering is an important and popular technique in data mining. Unfortunately, for any given dataset (not knowledge-base), it is very difficult for a user to estimate the proper number of clusters in advance, and it also has the tendency of trapping in local optimum when the initial seeds are randomly chosen. The genetic algorithms (GAs) are usually used to determine the number of clusters automatically and to capture an optimal solution as the initial seeds of K-means clustering or K-means clustering results. However, they typically choose the genes of chromosomes randomly, which results in poor clustering results, whereas a generally selected initial population can improve the final clustering results. Hence, some GA-based techniques carefully select a high-quality initial population with a high complexity. This paper proposed an adaptive GA (AGA) with an improved initial population for K-means clustering (SeedClust). In SeedClust, which is an improved density estimation method and the improved K-means++ are presented to capture higher quality initial seeds and generate the initial population with low complexity, and the adaptive crossover and mutation probability is designed and is then used for premature convergence and to maintain the population diversity, respectively, which can automatically determine the proper number of clusters and capture an improved initial solution. Finally, the best chromosomes (centers) are obtained and are then fed into the K-means as initial seeds to generate even higher quality clustering results by allowing the initial seeds to readjust as needed. Experimental results based on low-dimensional taxi GPS (Global Position System) data sets demonstrate that SeedClust has a higher performance and effectiveness.<\/jats:p>","DOI":"10.3390\/info9040101","type":"journal-article","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T04:44:48Z","timestamp":1524545088000},"page":"101","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Genetic Algorithm with an Improved Initial Population Technique for Automatic Clustering of Low-Dimensional Data"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9349-7487","authenticated-orcid":false,"given":"Xiangbing","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Information and Engineering, Sichuan Tourism University, Chengdu 610100, China"},{"name":"Key Lab of Earth Exploration & Information Techniques of Ministry Education, Chengdu University of Technology, Chengdu 610059, China"},{"name":"School of Mathematics and Computer Science, Aba Teachers University, Wenchuan 623002, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Miao","sequence":"additional","affiliation":[{"name":"School of Information and Engineering, Sichuan Tourism University, Chengdu 610100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongjiang","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,21]]},"reference":[{"key":"ref_1","unstructured":"Han, J., Pei, J., and Kamber, M. (2011). Data Mining: Concepts and Techniques, Elsevier."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond k-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recog. Lett."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.ins.2017.07.036","article-title":"An efficient k-means clustering filtering algorithm using density based initial cluster centers","volume":"418","author":"Kumar","year":"2017","journal-title":"Inf. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.patcog.2017.06.023","article-title":"Fast density clustering strategies based on the k-means algorithm","volume":"71","author":"Bai","year":"2017","journal-title":"Pattern Recognit."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1016\/j.engappai.2013.03.002","article-title":"A powerful hybrid clustering method based on modified stem cells and fuzzy c-means algorithms","volume":"26","author":"Taherdangkoo","year":"2013","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Wishart, D. (2003). K-Means Clustering with Outlier Detection, Mixed Variables and Missing Values, Springer.","DOI":"10.1007\/978-3-642-55721-7_23"},{"key":"ref_7","unstructured":"Jianjun, C., Xiaoyun, C., Haijuan, Y., and Mingwei, L. (2012, January 3\u20135). An enhanced k-means algorithm using agglomerative hierarchical clustering strategy. Proceedings of the International Conference on Automatic Control and Artificial Intelligence (ACAI 2012), Xiamen, China."},{"key":"ref_8","unstructured":"Akodj\u00e8nou-Jeannin, M.-I., Salamatian, K., and Gallinari, P. (2007, January 17\u201321). Flexible grid-based clustering. Proceedings of the 11th European Conference on Principles of Data Mining and Knowledge Discovery, Warsaw, Poland."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.patrec.2014.09.017","article-title":"A grid-growing clustering algorithm for geo-spatial data","volume":"53","author":"Zhao","year":"2015","journal-title":"Pattern Recognit. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.knosys.2014.08.011","article-title":"A hybrid clustering technique combining a novel genetic algorithm with k-means","volume":"71","author":"Rahman","year":"2014","journal-title":"Knowl. Based. Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","article-title":"A comparative study of efficient initialization methods for the k-means clustering algorithm","volume":"40","author":"Celebi","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_12","first-page":"211","article-title":"Seed-detective: A novel clustering technique using high quality seed for k-means on categorical and numerical attributes","volume":"Volume 121","author":"Rahman","year":"2011","journal-title":"Proceedings of the Ninth Australasian Data Mining Conference"},{"key":"ref_13","first-page":"27","article-title":"Crudaw: A novel fuzzy technique for clustering records following user defined attribute weights","volume":"Volume 134","author":"Rahman","year":"2012","journal-title":"Proceedings of the Tenth Australasian Data Mining Conference"},{"key":"ref_14","unstructured":"Arthur, D., and Vassilvitskii, S. (2007, January 7\u20139). K-means++: The advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.knosys.2016.09.030","article-title":"Genetic algorithm with healthy population and multiple streams sharing information for clustering","volume":"114","author":"Beg","year":"2016","journal-title":"Knowl. Based Syst."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0020-0255(02)00208-6","article-title":"An evolutionary technique based on k-means algorithm for optimal clustering in RN","volume":"146","author":"Bandyopadhyay","year":"2002","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1455","DOI":"10.1016\/S0031-3203(99)00137-5","article-title":"Genetic algorithm-based clustering technique","volume":"33","author":"Maulik","year":"2000","journal-title":"Pattern Recognit."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1016\/j.patcog.2008.11.006","article-title":"A genetic algorithm with gene rearrangement for k-means clustering","volume":"42","author":"Chang","year":"2009","journal-title":"Pattern Recognit."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"9695","DOI":"10.1016\/j.eswa.2012.02.149","article-title":"A new grouping genetic algorithm for clustering problems","volume":"39","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.amc.2011.06.007","article-title":"Automatic clustering using genetic algorithms","volume":"218","author":"Liu","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TSMCC.2008.2007252","article-title":"A survey of evolutionary algorithms for clustering","volume":"39","author":"Hruschka","year":"2009","journal-title":"IEEE Trans. Syst. Man Cybern. Part C (Appl. Rev.)"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.neucom.2011.11.001","article-title":"A two-stage genetic algorithm for automatic clustering","volume":"81","author":"He","year":"2012","journal-title":"Neurocomputing"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.amc.2003.11.023","article-title":"A niche hybrid genetic algorithm for global optimization of continuous multimodal functions","volume":"160","author":"Wei","year":"2005","journal-title":"Appl. Math. Comput."},{"key":"ref_24","first-page":"208","article-title":"Nicgar: A niching genetic algorithm to mine a diverse set of interesting quantitative association rules","volume":"355","author":"Rosete","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4387","DOI":"10.1007\/s00500-016-2071-8","article-title":"A novel collaborative optimization algorithm in solving complex optimization problems","volume":"21","author":"Deng","year":"2017","journal-title":"Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3046","DOI":"10.1016\/j.cor.2012.03.008","article-title":"Clustering of high throughput gene expression data","volume":"39","author":"Pirim","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.swevo.2011.11.001","article-title":"Automatic shape independent clustering inspired by ant dynamics","volume":"3","author":"Chowdhury","year":"2012","journal-title":"Swarm Evolut. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/3477.764879","article-title":"Genetic k-means algorithm","volume":"29","author":"Krishna","year":"1999","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cyber.)"},{"key":"ref_29","unstructured":"GitHub (2018, April 20). Real-World Taxi-GPS Data Sets. Available online: https:\/\/github.com\/bigdata002\/Location-data-sets."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","article-title":"A cluster separation measure","volume":"PAMI-1","author":"Davies","year":"1979","journal-title":"IEEE Trans. Pattern Anal."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.patcog.2003.06.005","article-title":"Validity index for crisp and fuzzy clusters","volume":"37","author":"Pakhira","year":"2004","journal-title":"Pattern Recognit."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zhou, X., Gu, J., Shen, S., Ma, H., Miao, F., Zhang, H., and Gong, H. (2017). An automatic k-means clustering algorithm of GPS data combining a novel niche genetic algorithm with noise and density. ISPRS Int. J. Geo-Inf., 6.","DOI":"10.3390\/ijgi6120392"},{"key":"ref_33","unstructured":"Lotufo, R.A., and Zampirolli, F.A. (2001, January 15\u201318). Fast multidimensional parallel Euclidean distance transform based on mathematical morphology. Proceedings of the XIV Brazilian Symposium on Computer Graphics and Image Processing, Florianopolis, Brazil."},{"key":"ref_34","unstructured":"Juan, A., and Vidal, E. (September, January 30). In Comparison of four initialization techniques for the k-medians clustering algorithm. Proceedings of the Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR), Alicante, Spain."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.imavis.2010.10.002","article-title":"Improving the performance of k-means for color quantization","volume":"29","author":"Celebi","year":"2011","journal-title":"Image Vis. Comput."},{"key":"ref_36","unstructured":"Spaeth, H. (1985). Cluster Dissection and Analysis, Theory, FORTRAN Programs, Examples, Ellis Horwood."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"10223","DOI":"10.1016\/j.eswa.2009.01.060","article-title":"A new initialization method for categorical data clustering","volume":"36","author":"Cao","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_38","unstructured":"Silverman, B.W. (1986). Density Estimation for Statistics and Data Analysis, CRC Press."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Patwary, M.M.A., Palsetia, D., Agrawal, A., Liao, W.-K., Manne, F., and Choudhary, A. (2013, January 17\u201322). Scalable parallel optics data clustering using graph algorithmic techniques. Proceedings of the 2013 International Conference for High Performance Computing, Networking, Storage and Analysis (SC), Denver, CO, USA.","DOI":"10.1145\/2503210.2503255"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.knosys.2011.02.015","article-title":"An initialization method to simultaneously find initial cluster centers and the number of clusters for clustering categorical data","volume":"24","author":"Bai","year":"2011","journal-title":"Knowl. Based Syst."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"622","DOI":"10.14778\/2180912.2180915","article-title":"Scalable k-means++","volume":"5","author":"Bahmani","year":"2012","journal-title":"Proc. VLDB Endow."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"4966","DOI":"10.1016\/j.eswa.2009.12.017","article-title":"A quantum-inspired genetic algorithm for k-means clustering","volume":"37","author":"Xiao","year":"2010","journal-title":"Expert Syst. Appl."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.physa.2015.06.032","article-title":"Uncovering urban human mobility from large scale taxi GPS data","volume":"438","author":"Tang","year":"2015","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.neucom.2008.11.032","article-title":"Extracting road information from recorded GPS data using snap-drift neural network","volume":"73","author":"Ekpenyong","year":"2009","journal-title":"Neurocomputing"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s12650-016-0357-7","article-title":"Exploring OD patterns of interested region based on taxi trajectories","volume":"19","author":"Lu","year":"2016","journal-title":"J. Vis."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.eswa.2015.08.048","article-title":"Time-evolving OD matrix estimation using high-speed GPS data streams","volume":"44","author":"Gama","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1109\/TVCG.2013.226","article-title":"Visual exploration of big spatio-temporal urban data: A study of new york city taxi trips","volume":"19","author":"Ferreira","year":"2013","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Cruz, M.O., Macedo, H., and Guimaraes, A. (2015, January 4\u20137). Grouping similar trajectories for carpooling purposes. Proceedings of the 2015 Brazilian Conference on Intelligent Systems (BRACIS), Natal, Brazil.","DOI":"10.1109\/BRACIS.2015.36"},{"key":"ref_49","unstructured":"Dua, D., and Karra, T.E. (2018, April 20). Machine Learning Repository (UCI). Available online: https:\/\/archive.ics.uci.edu\/ml\/datasets.html."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Liu, Y., Yuan, J., and Xie, X. (2011, January 17\u201321). Urban computing with taxicabs. Proceedings of the 13th International Conference on Ubiquitous Computing, Beijing, China.","DOI":"10.1145\/2030112.2030126"},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Yuan, J., Zheng, Y., Xie, X., and Sun, G. (2011, January 21\u201324). Driving with knowledge from the physical world. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA.","DOI":"10.1145\/2020408.2020462"},{"key":"ref_52","unstructured":"Piorkowski, M., and Natasa, S.D. (2018, April 20). Matthias Grossglauser. Crawdad Dataset Epfl\/Mobility (v. 2009-02-24). Available online: http:\/\/crawdad.org\/epfl\/mobility\/20090224."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1012801612483","article-title":"On clustering validation techniques","volume":"17","author":"Halkidi","year":"2001","journal-title":"J. Intell. Inf. Syst."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: A graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.eswa.2017.09.005","article-title":"Combining k-means and a genetic algorithm through a novel arrangement of genetic operators for high quality clustering","volume":"91","author":"Islam","year":"2018","journal-title":"Expert Syst. Appl."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/4\/101\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:01:37Z","timestamp":1760194897000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/9\/4\/101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,21]]},"references-count":55,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["info9040101"],"URL":"https:\/\/doi.org\/10.3390\/info9040101","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2018,4,21]]}}}