Uncertain Data Clustering Algorithm Based on Voronoi Diagram in Obstacle Space

被引：0

作者：

Wan J. ^{[1
]}

Cui M. ^{[1
]}

He Y. ^{[1
]}

Li S. ^{[1
]}

机构：

[1] College of Computer Science and Technology, Harbin University of Science and Technology, Harbin

来源：

Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2019年 / 56卷 / 05期

基金：

中国国家自然科学基金;

关键词：

Dynamic obstacles; Kullback-Leibler divergence; Static obstacles; Uncertain data; Voronoi diagram;

D O I：

10.7544/issn1000-1239.2019.20170979

中图分类号：

学科分类号：

摘要：

In order to solve the problem of the uncertain data clustering in obstacle space, the Voronoi diagram in computational geometry is introduced to divide the data space, and an uncertain data clustering algorithm based on Voronoi diagram in obstacle space is proposed. According to the properties of Voronoi diagram, four clustering rules are proposed. In order to consider the probability distribution between data, the KL distance is used as the similarity measure between data objects. Because obstacles can not always remain static in real life, and space obstacles often change dynamically. Then, according to whether the set of obstacles is changed, an uncertain data clustering algorithm in static obstacle environment and dynamic obstacle environment is proposed. Theoretical studies and experiments show that the uncertain refining clustering algorithm in the static obstacles environment(STAO_RVUBSCAN), the uncertain clustering algorithm of the dynamic increase of obstacles(DYNOC_VUBSCAN), the uncertain clustering algorithm of the dynamic reduction of obstacles(DYNOR_VUBSCAN) and the uncertain clustering algorithm of the dynamic movement of obstacles (DYNOM_VUBSCAN) have extremely high efficiency. © 2019, Science Press. All right reserved.

引用

页码：977 / 991

页数：14

共 26 条

[1]

Zhang X., Liu H., Zhang X., Novel density-based and hierarchical density-based clustering algorithms for uncertain data, Neural Networks, 93, 9, pp. 240-255, (2017)

[2]

Zhou A., Jin C., Wang G., Et al., A survey on the management of uncertain data, Chinese Journal of Computers, 32, 1, pp. 1-16, (2009)

[3]

Ngai W.K., Kao B., Chui C.K., Et al., Efficient clustering of uncertain data, Proc of the 6th Int Conf on Data Mining, pp. 436-445, (2006)

[4]

Wang J., Su X., An improved k-means clustering algorithm, Proc of the 3rd Int Symp on Intelligent Information Technology and Security Informatics, pp. 63-67, (2011)

[5]

Wang W., Yang J., Muntz R., STING: A statistical information grid approach to spatital data mining, Proc of the 23rd Int Conf on very Large Data Bases, pp. 186-195, (1997)

[6]

Xu L., Hu Q., Zhang X., Et al., AdaUK-Means: An ensemble boosting clustering algorithm on uncertain objects, Proc of the 7th Chinese Conf on Pattern Recognition, pp. 27-41, (2016)

[7]

Liao K., Liu C., An effective clustering mechanism for uncertain data mining using centroid boundary in UKmeans, Proc of Int Computer Symp., pp. 300-305, (2017)

[8]

Hao S., Zhou X., Hong S., A new method for noise data detection based on DBSCAN and SVDD, Proc of the 5th IEEE Int Conf on Cyber Technology in Automation, Control, and Intelligent Systems, pp. 784-789, (2015)

[9]

Kriegel H.P., Pfeifle M., Hierarchical density-based clustering of uncertain data, Proc of the 5th IEEE Int Conf on Data Mining, pp. 689-692, (2005)

[10]

Han L., Zhang X., Zhang X., Et al., Self-adapted mixture distance measure for clustering uncertain data, Knowledge-Based Systems, 126, 12, pp. 33-47, (2017)

← 1 2 3 →