{"title":"不确定运动物体的基于密度的概率聚类","authors":"Huajie Xu, Xiaoming Hu, Bing Yang, Juan Xu","doi":"10.1109/ICICISYS.2009.5358040","DOIUrl":null,"url":null,"abstract":"In the environment with objects moving randomly, the positions of moving objects can be modeled as a range of possible values, associated with a probability density function. Data mining of such positions of uncertain moving objects attracts more and more research interest recently. The definitions of probabilistic core object and probabilistic density-reachability are presented and a density-based probabilistic clustering algorithm for uncertain moving objects is proposed, based on DBSCAN algorithm and probabilistic index on uncertain moving objects. Simulation results show that the proposed algorithm outperforms other density-based clustering algorithm for uncertain moving objects in accuracy and update rate needed for clustering.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Density-based probabilistic clustering of uncertain moving objects\",\"authors\":\"Huajie Xu, Xiaoming Hu, Bing Yang, Juan Xu\",\"doi\":\"10.1109/ICICISYS.2009.5358040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the environment with objects moving randomly, the positions of moving objects can be modeled as a range of possible values, associated with a probability density function. Data mining of such positions of uncertain moving objects attracts more and more research interest recently. The definitions of probabilistic core object and probabilistic density-reachability are presented and a density-based probabilistic clustering algorithm for uncertain moving objects is proposed, based on DBSCAN algorithm and probabilistic index on uncertain moving objects. Simulation results show that the proposed algorithm outperforms other density-based clustering algorithm for uncertain moving objects in accuracy and update rate needed for clustering.\",\"PeriodicalId\":206575,\"journal\":{\"name\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICISYS.2009.5358040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICISYS.2009.5358040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Density-based probabilistic clustering of uncertain moving objects
In the environment with objects moving randomly, the positions of moving objects can be modeled as a range of possible values, associated with a probability density function. Data mining of such positions of uncertain moving objects attracts more and more research interest recently. The definitions of probabilistic core object and probabilistic density-reachability are presented and a density-based probabilistic clustering algorithm for uncertain moving objects is proposed, based on DBSCAN algorithm and probabilistic index on uncertain moving objects. Simulation results show that the proposed algorithm outperforms other density-based clustering algorithm for uncertain moving objects in accuracy and update rate needed for clustering.