基于密度的高效数据挖掘聚类技术

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}
引用次数: 2

摘要

聚类分析是数据挖掘的一项重要功能。在数据挖掘中有各种各样的聚类方法。基于这些方法,开发了各种聚类算法。最近的一种聚类分析方法是基于群体智能的。在此基础上,提出了一种ldquoant-cluster算法。然而,现有的ldquoant聚类算法在寻找用户自定义的两个常数K1和K2的值时存在局限性。,用于计算拾取概率Pp和掉落概率Pd的值。在本文中,我们的方法是在不给出用户定义的K1和K2值的情况下获得Pp和Pd的值。我们还打算将Pp和Pd保持在0到1之间,以获得优化的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信