{"title":"Research on a new clustering algorithm in data mining","authors":"Tan Zhongbing","doi":"10.1109/ANTHOLOGY.2013.6784990","DOIUrl":null,"url":null,"abstract":"Data mining is one of the leading fields in the combination area of database and decision supporting, and clustering is a significant task for data mining, in which clustering algorithm is the core technology. The new clustering method based on genetic algorithm and gradient descent method (G-G clustering algorithm) is proposed in this paper. Genetic algorithm has the advantages of global searching and strong robustness, and will not getting stuck at local optimal values. Unfortunately, it can only reach the near-optimal value after many generations of selection, crossover and mutation. Therefore, gradient descent method is utilized at the end of genetic algorithm based clustering method to get global optimal values. Clustering results of two groups of experimental data show that the new clustering method is one with global optimal, and the results is evidently better than k-means clustering method.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference Anthology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ANTHOLOGY.2013.6784990","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Data mining is one of the leading fields in the combination area of database and decision supporting, and clustering is a significant task for data mining, in which clustering algorithm is the core technology. The new clustering method based on genetic algorithm and gradient descent method (G-G clustering algorithm) is proposed in this paper. Genetic algorithm has the advantages of global searching and strong robustness, and will not getting stuck at local optimal values. Unfortunately, it can only reach the near-optimal value after many generations of selection, crossover and mutation. Therefore, gradient descent method is utilized at the end of genetic algorithm based clustering method to get global optimal values. Clustering results of two groups of experimental data show that the new clustering method is one with global optimal, and the results is evidently better than k-means clustering method.