{"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}
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.