Mechanisms to improve clustering uncertain data with UKmeans

Abstract Uncertain data in Kmeans clustering, namely UKmeans, have been discussed in decade years. UKmeans clustering, however, has some difficulties of time performance and effectiveness because of the uncertainty of objects. In this study, we propose some modified UKmeans clustering mechanisms to improve the time performance and effectiveness, and to enable the clustering to be more complete. The main issues include (1) reducing the consideration of time performance in clustering, (2) increasing the effectiveness of clustering, and (3) considering the determination of the number of clusters. In time performance, we use simplified object expressions to reduce the time spent in comparing similarities. Regarding the effectiveness of clustering, we propose compounded factors including the distance, the overlapping of clusters and objects, and the cluster density as the clustering standard to determine similarity. In addition, to increase the effectiveness of clustering, we also propose the concept of a cluster boundary, which affects the belongingness of an object by the overlapping factor. Finally, we use the evaluating approach of the number of uncertain clusters to determine the appropriate the number of clusters. In the experiment, clustering results generated using strategies commonly used in processing uncertain data clustering in UKmeans clusters are compared. Our proposed model shows more favorable performance, higher effectiveness of clustering, and a more appropriate number of clusters compared to other models.

[1]  Yu Peng,et al.  UCK-means :A customized K-means for clustering uncertain measurement data , 2011, 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).

[2]  Bin Jiang,et al.  Clustering Uncertain Data Based on Probability Distribution Similarity , 2013, IEEE Transactions on Knowledge and Data Engineering.

[3]  Hans-Peter Kriegel,et al.  Hierarchical density-based clustering of uncertain data , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[4]  S Sathappan,et al.  A Literature Study on Traditional Clustering Algorithms for Uncertain Data , 2017 .

[5]  Eréndira Rendón,et al.  Internal versus External cluster validation indexes , 2011 .

[6]  Arthur Zimek,et al.  Representative clustering of uncertain data , 2014, KDD.

[7]  I. Burhan Türksen,et al.  MiniMax ε-stable cluster validity index for type-2 fuzziness , 2010, 2010 Annual Meeting of the North American Fuzzy Information Processing Society.

[8]  Reynold Cheng,et al.  Efficient Clustering of Uncertain Data , 2006, Sixth International Conference on Data Mining (ICDM'06).

[9]  David Wai-Lok Cheung,et al.  Clustering Uncertain Data Using Voronoi Diagrams , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[10]  Reynold Cheng,et al.  Uncertain Data Mining: An Example in Clustering Location Data , 2006, PAKDD.

[11]  Vivek S Ware,et al.  Study of Density based Algorithms , 2013 .

[12]  Charu C. Aggarwal,et al.  On Density Based Transforms for Uncertain Data Mining , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[13]  Reynold Cheng,et al.  Reducing UK-Means to K-Means , 2007 .

[14]  Philip S. Yu,et al.  A Framework for Clustering Uncertain Data Streams , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[15]  Hans-Peter Kriegel,et al.  Density‐based clustering , 2011, WIREs Data Mining Knowl. Discov..

[16]  Hans-Peter Kriegel,et al.  Density-based clustering of uncertain data , 2005, KDD '05.

[17]  Michalis Vazirgiannis,et al.  Clustering validity checking methods: part II , 2002, SGMD.

[18]  Ninoslav Slavek,et al.  Improved Bisector pruning for uncertain data mining , 2012, Proceedings of the ITI 2012 34th International Conference on Information Technology Interfaces.

[19]  J. A. Hartigan,et al.  A k-means clustering algorithm , 1979 .