{"title":"基于Mapreduce的大数据增强k - means++聚类","authors":"B. Natarajan, P. Chellammal","doi":"10.51976/ijari.311509","DOIUrl":null,"url":null,"abstract":"Clustering big data using data mining algorithms is a modern approach, used in various science and medical fields. k-means clustering algorithm is a good approach for clustering, but choosing initial centers and provides less accuracy guarantees. The enhanced k-means approach called 𝑘-means++ chooses one center uniformly at random provides better functionality, but fails to handle data of larger volume in distributed environment. The mapreduce 𝑘-means++ method handles k-means++ algorithm by enhancing it in mapper and reducer phases, also reduces the no of iterations required to obtain 𝑘 centers. in which the 𝑘-means++ initialization algorithm is executed in the mapper phase and the weighted 𝑘-means++ initialization algorithm is run in the reducer phase. it reduces huge amount of communication and i/o costs. the proposed mapreduce 𝑘-means++ method obtains (𝛼2) approximation to the optimal solution of 𝑘-means.","PeriodicalId":330303,"journal":{"name":"International Journal of Advance Research and Innovation","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced K-Means++ Clustering For Big Data with Mapreduce\",\"authors\":\"B. Natarajan, P. Chellammal\",\"doi\":\"10.51976/ijari.311509\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering big data using data mining algorithms is a modern approach, used in various science and medical fields. k-means clustering algorithm is a good approach for clustering, but choosing initial centers and provides less accuracy guarantees. The enhanced k-means approach called 𝑘-means++ chooses one center uniformly at random provides better functionality, but fails to handle data of larger volume in distributed environment. The mapreduce 𝑘-means++ method handles k-means++ algorithm by enhancing it in mapper and reducer phases, also reduces the no of iterations required to obtain 𝑘 centers. in which the 𝑘-means++ initialization algorithm is executed in the mapper phase and the weighted 𝑘-means++ initialization algorithm is run in the reducer phase. it reduces huge amount of communication and i/o costs. the proposed mapreduce 𝑘-means++ method obtains (𝛼2) approximation to the optimal solution of 𝑘-means.\",\"PeriodicalId\":330303,\"journal\":{\"name\":\"International Journal of Advance Research and Innovation\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Advance Research and Innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.51976/ijari.311509\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Advance Research and Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.51976/ijari.311509","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhanced K-Means++ Clustering For Big Data with Mapreduce
Clustering big data using data mining algorithms is a modern approach, used in various science and medical fields. k-means clustering algorithm is a good approach for clustering, but choosing initial centers and provides less accuracy guarantees. The enhanced k-means approach called 𝑘-means++ chooses one center uniformly at random provides better functionality, but fails to handle data of larger volume in distributed environment. The mapreduce 𝑘-means++ method handles k-means++ algorithm by enhancing it in mapper and reducer phases, also reduces the no of iterations required to obtain 𝑘 centers. in which the 𝑘-means++ initialization algorithm is executed in the mapper phase and the weighted 𝑘-means++ initialization algorithm is run in the reducer phase. it reduces huge amount of communication and i/o costs. the proposed mapreduce 𝑘-means++ method obtains (𝛼2) approximation to the optimal solution of 𝑘-means.