U-DBSCAN:针对不确定对象的基于密度的聚类算法

Apinya Tepwankul, S. Maneewongvatana
{"title":"U-DBSCAN:针对不确定对象的基于密度的聚类算法","authors":"Apinya Tepwankul, S. Maneewongvatana","doi":"10.1109/ICDEW.2010.5452734","DOIUrl":null,"url":null,"abstract":"In recent years, uncertain data have gained increasing research interests due to its natural presence in many applications such as location based services and sensor services. In this paper, we study the problem of clustering uncertain objects. We propose a new deviation function that approximates the underlying uncertain model of objects and a new density-based clustering algorithm, U-DBSCAN, that utilizes the proposed deviation. Since, there is no cluster quality measurement of density-based clustering at present. Thus, we also propose a metric which specifically measures the density quality of clustering solution. Finally, we perform a set of experiments to evaluate the quality effectiveness of our algorithm using our metric. The results reveal that U-DBSCAN gives better clustering quality while having comparable running time compared to a traditional approach of using representative points of objects with DBSCAN.","PeriodicalId":442345,"journal":{"name":"2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"U-DBSCAN : A density-based clustering algorithm for uncertain objects\",\"authors\":\"Apinya Tepwankul, S. Maneewongvatana\",\"doi\":\"10.1109/ICDEW.2010.5452734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, uncertain data have gained increasing research interests due to its natural presence in many applications such as location based services and sensor services. In this paper, we study the problem of clustering uncertain objects. We propose a new deviation function that approximates the underlying uncertain model of objects and a new density-based clustering algorithm, U-DBSCAN, that utilizes the proposed deviation. Since, there is no cluster quality measurement of density-based clustering at present. Thus, we also propose a metric which specifically measures the density quality of clustering solution. Finally, we perform a set of experiments to evaluate the quality effectiveness of our algorithm using our metric. The results reveal that U-DBSCAN gives better clustering quality while having comparable running time compared to a traditional approach of using representative points of objects with DBSCAN.\",\"PeriodicalId\":442345,\"journal\":{\"name\":\"2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDEW.2010.5452734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDEW.2010.5452734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

近年来,不确定数据由于其自然存在于许多应用中,如基于位置的服务和传感器服务,引起了越来越多的研究兴趣。本文主要研究不确定目标的聚类问题。我们提出了一个新的偏差函数来近似对象的潜在不确定性模型,并提出了一个新的基于密度的聚类算法U-DBSCAN,该算法利用了所提出的偏差。因此,目前还没有基于密度的聚类的聚类质量度量。因此,我们还提出了一个度量,专门度量聚类解决方案的密度质量。最后,我们执行了一组实验,使用我们的度量来评估我们的算法的质量有效性。结果表明,与使用DBSCAN对象的代表性点的传统方法相比,U-DBSCAN提供了更好的聚类质量,同时具有相当的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
U-DBSCAN : A density-based clustering algorithm for uncertain objects
In recent years, uncertain data have gained increasing research interests due to its natural presence in many applications such as location based services and sensor services. In this paper, we study the problem of clustering uncertain objects. We propose a new deviation function that approximates the underlying uncertain model of objects and a new density-based clustering algorithm, U-DBSCAN, that utilizes the proposed deviation. Since, there is no cluster quality measurement of density-based clustering at present. Thus, we also propose a metric which specifically measures the density quality of clustering solution. Finally, we perform a set of experiments to evaluate the quality effectiveness of our algorithm using our metric. The results reveal that U-DBSCAN gives better clustering quality while having comparable running time compared to a traditional approach of using representative points of objects with DBSCAN.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信