{"title":"利用粒子群算法通过无监督学习增强K均值","authors":"Aishwarya Gupta, Vishwajeet Pattanaik, Mayank Singh","doi":"10.1109/CCAA.2017.8229805","DOIUrl":null,"url":null,"abstract":"Data Clustering in Data Mining is a domain which never gets out of focus. Clustering a data was always an easy task but achieving the required accuracy, precision and performance was never so easy. K means being an archaic clustering algorithm got tested and experimented thousands of times with variety of datasets and other combination of algorithm due to its robustness and simplicity but what this algorithm proposed was not suggested before. It used K means algorithm for the evaluation and validation purposes whereas optimization of the data is done with the help of Particle Swarm Optimization Algorithm. The drawbacks of K means mainly its local convergence property and initializing number of clusters at an early stage has aroused the process of working on this algorithm. So, for attaining the global convergence the Swarm Intelligence is preferred over Genetic Algorithm and many other techniques and for the latter one we combined two functions one of them helps in knowing the number of clusters which are optimal for the particular dataset and the other one validates the results using another function and compares the various metrics which will define the goodness and fitness of an algorithm. In one line the complete overview of the proposed algorithm can be described as ‘Evaluating the data using an Evalcluster Function, performing Validation with the help of an Evaluate Function of the K means and giving the final touch of Optimizing the data by K means PSO Algorithm’. The algorithm is tested for over 4 datasets available in UCI Repository and the results were unexpectedly great.","PeriodicalId":6627,"journal":{"name":"2017 International Conference on Computing, Communication and Automation (ICCCA)","volume":"17 6 Pt 1 1","pages":"228-233"},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Enhancing K means by unsupervised learning using PSO algorithm\",\"authors\":\"Aishwarya Gupta, Vishwajeet Pattanaik, Mayank Singh\",\"doi\":\"10.1109/CCAA.2017.8229805\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data Clustering in Data Mining is a domain which never gets out of focus. Clustering a data was always an easy task but achieving the required accuracy, precision and performance was never so easy. K means being an archaic clustering algorithm got tested and experimented thousands of times with variety of datasets and other combination of algorithm due to its robustness and simplicity but what this algorithm proposed was not suggested before. It used K means algorithm for the evaluation and validation purposes whereas optimization of the data is done with the help of Particle Swarm Optimization Algorithm. The drawbacks of K means mainly its local convergence property and initializing number of clusters at an early stage has aroused the process of working on this algorithm. So, for attaining the global convergence the Swarm Intelligence is preferred over Genetic Algorithm and many other techniques and for the latter one we combined two functions one of them helps in knowing the number of clusters which are optimal for the particular dataset and the other one validates the results using another function and compares the various metrics which will define the goodness and fitness of an algorithm. In one line the complete overview of the proposed algorithm can be described as ‘Evaluating the data using an Evalcluster Function, performing Validation with the help of an Evaluate Function of the K means and giving the final touch of Optimizing the data by K means PSO Algorithm’. The algorithm is tested for over 4 datasets available in UCI Repository and the results were unexpectedly great.\",\"PeriodicalId\":6627,\"journal\":{\"name\":\"2017 International Conference on Computing, Communication and Automation (ICCCA)\",\"volume\":\"17 6 Pt 1 1\",\"pages\":\"228-233\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Computing, Communication and Automation (ICCCA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCAA.2017.8229805\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Computing, Communication and Automation (ICCCA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCAA.2017.8229805","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhancing K means by unsupervised learning using PSO algorithm
Data Clustering in Data Mining is a domain which never gets out of focus. Clustering a data was always an easy task but achieving the required accuracy, precision and performance was never so easy. K means being an archaic clustering algorithm got tested and experimented thousands of times with variety of datasets and other combination of algorithm due to its robustness and simplicity but what this algorithm proposed was not suggested before. It used K means algorithm for the evaluation and validation purposes whereas optimization of the data is done with the help of Particle Swarm Optimization Algorithm. The drawbacks of K means mainly its local convergence property and initializing number of clusters at an early stage has aroused the process of working on this algorithm. So, for attaining the global convergence the Swarm Intelligence is preferred over Genetic Algorithm and many other techniques and for the latter one we combined two functions one of them helps in knowing the number of clusters which are optimal for the particular dataset and the other one validates the results using another function and compares the various metrics which will define the goodness and fitness of an algorithm. In one line the complete overview of the proposed algorithm can be described as ‘Evaluating the data using an Evalcluster Function, performing Validation with the help of an Evaluate Function of the K means and giving the final touch of Optimizing the data by K means PSO Algorithm’. The algorithm is tested for over 4 datasets available in UCI Repository and the results were unexpectedly great.