{"title":"基于时空数据挖掘概念的聚类质心查找算法","authors":"S. Baboo, K. Tajudin","doi":"10.1109/ICPRIME.2013.6496443","DOIUrl":null,"url":null,"abstract":"The main aim of the research focuses the clustering centroid value for spatio-temporal data mining. Using k-means, advanced k-means algorithm and Avg Centroid (AC) clustering. The real time data of the hurricane Indian Ocean 2001 to 2010 maximum wind details are focused in this paper. The clustering is taking as selection window method, the first window form the basis of the pixel coordinate value of the screen, the second clustering window one half of the centre point value. The data mining retrieves clustering data form basis of the selection window. Here to discuss k-means algorithmic steps are very few and same iteration is continuing till the same to get the centroid point. The enhanced k-means algorithm taken more steps but result is accurate algorithmic finishing stage; iteration also repeated very minimum times. The final discussion of this paper collects average centroid clustering for all previously selected values and current selected clustering data. The result of this paper gave the comparative study of the k-means, enhanced k-means algorithms and AC clustering values.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Clustering centroid finding algorithm (CCFA) using spatial temporal data mining concept\",\"authors\":\"S. Baboo, K. Tajudin\",\"doi\":\"10.1109/ICPRIME.2013.6496443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main aim of the research focuses the clustering centroid value for spatio-temporal data mining. Using k-means, advanced k-means algorithm and Avg Centroid (AC) clustering. The real time data of the hurricane Indian Ocean 2001 to 2010 maximum wind details are focused in this paper. The clustering is taking as selection window method, the first window form the basis of the pixel coordinate value of the screen, the second clustering window one half of the centre point value. The data mining retrieves clustering data form basis of the selection window. Here to discuss k-means algorithmic steps are very few and same iteration is continuing till the same to get the centroid point. The enhanced k-means algorithm taken more steps but result is accurate algorithmic finishing stage; iteration also repeated very minimum times. The final discussion of this paper collects average centroid clustering for all previously selected values and current selected clustering data. The result of this paper gave the comparative study of the k-means, enhanced k-means algorithms and AC clustering values.\",\"PeriodicalId\":123210,\"journal\":{\"name\":\"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPRIME.2013.6496443\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPRIME.2013.6496443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Clustering centroid finding algorithm (CCFA) using spatial temporal data mining concept
The main aim of the research focuses the clustering centroid value for spatio-temporal data mining. Using k-means, advanced k-means algorithm and Avg Centroid (AC) clustering. The real time data of the hurricane Indian Ocean 2001 to 2010 maximum wind details are focused in this paper. The clustering is taking as selection window method, the first window form the basis of the pixel coordinate value of the screen, the second clustering window one half of the centre point value. The data mining retrieves clustering data form basis of the selection window. Here to discuss k-means algorithmic steps are very few and same iteration is continuing till the same to get the centroid point. The enhanced k-means algorithm taken more steps but result is accurate algorithmic finishing stage; iteration also repeated very minimum times. The final discussion of this paper collects average centroid clustering for all previously selected values and current selected clustering data. The result of this paper gave the comparative study of the k-means, enhanced k-means algorithms and AC clustering values.