REVIEW OF CLUSTERING UNCERTAIN DATA

Apply

 REVIEW OF CLUSTERING UNCERTAIN DATA

Journal Title: International Journal of Engineering Sciences & Research Technology - Year 30, Vol 5, Issue 9

Abstract

 Clustering on uncertain data, one of the essential tasks in mining uncertain data, posts significant challenges on both modeling similarity between uncertain objects and developing efficient computational methods. The previous methods extend traditional partitioning clustering methods like k-means and density-based clustering methods like DBSCAN to uncertain data, thus rely on geometric distances between objects. Such methods cannot handle uncertain objects that are geometrically indistinguishable, such as products with the same mean but very different variances in customer ratings. Surprisingly, probability distributions, which are essential characteristics of uncertain objects, have not been considered in measuring similarity between uncertain objects. In this project, we systematically model uncertain objects in both continuous and discrete domains, where an uncertain object is modeled as a continuous and discrete random variable, respectively. We use the well-known Kullback-Leibler divergence to measure similarity between uncertain objects in both the continuous and discrete cases, and integrate it into partitioning and density-based clustering methods to cluster uncertain objects.

Authors and Affiliations

Ms. Nikhatparvin Ahamad*

Keywords

cluster Uncertain Data

EP ID EP90900
DOI 10.5281/zenodo.61474
Views 110
Downloads 0