A. Rahman, Anindya Chowdhury, D.M.J. Rahman, A.R.M. Kamal
{"title":"基于密度的高效数据挖掘聚类技术","authors":"A. Rahman, Anindya Chowdhury, D.M.J. Rahman, A.R.M. Kamal","doi":"10.1109/ICCITECHN.2008.4803050","DOIUrl":null,"url":null,"abstract":"Clustering analysis is an important function of data mining. There are various clustering methods in data mining. Based on these methods various clustering algorithms are developed. A recent approach for clustering analysis is based on ldquoswarm intelligencerdquo. Based on this ldquoswarm intelligencerdquo an algorithm was proposed named ldquoant-cluster algorithmrdquo. However, existing ldquoant clusteringrdquo algorithm has a limitation in finding the value of two constant K1 and K2, which is user defined., for computing the value of the picking up probability Pp and dropping probability Pd. In this paper our approach is to gain the value of Pp and Pd without giving the user defined value of K1 and K2. We also intend to retain the Pp and Pd in between 0 to 1 in order to get optimized result.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Density based clustering technique for efficient data mining\",\"authors\":\"A. Rahman, Anindya Chowdhury, D.M.J. Rahman, A.R.M. Kamal\",\"doi\":\"10.1109/ICCITECHN.2008.4803050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering analysis is an important function of data mining. There are various clustering methods in data mining. Based on these methods various clustering algorithms are developed. A recent approach for clustering analysis is based on ldquoswarm intelligencerdquo. Based on this ldquoswarm intelligencerdquo an algorithm was proposed named ldquoant-cluster algorithmrdquo. However, existing ldquoant clusteringrdquo algorithm has a limitation in finding the value of two constant K1 and K2, which is user defined., for computing the value of the picking up probability Pp and dropping probability Pd. In this paper our approach is to gain the value of Pp and Pd without giving the user defined value of K1 and K2. We also intend to retain the Pp and Pd in between 0 to 1 in order to get optimized result.\",\"PeriodicalId\":335795,\"journal\":{\"name\":\"2008 11th International Conference on Computer and Information Technology\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th International Conference on Computer and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2008.4803050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th International Conference on Computer and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2008.4803050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Density based clustering technique for efficient data mining
Clustering analysis is an important function of data mining. There are various clustering methods in data mining. Based on these methods various clustering algorithms are developed. A recent approach for clustering analysis is based on ldquoswarm intelligencerdquo. Based on this ldquoswarm intelligencerdquo an algorithm was proposed named ldquoant-cluster algorithmrdquo. However, existing ldquoant clusteringrdquo algorithm has a limitation in finding the value of two constant K1 and K2, which is user defined., for computing the value of the picking up probability Pp and dropping probability Pd. In this paper our approach is to gain the value of Pp and Pd without giving the user defined value of K1 and K2. We also intend to retain the Pp and Pd in between 0 to 1 in order to get optimized result.