Downloads: 105 | Views: 285

Research Paper | Computer Science & Engineering | India | Volume 4 Issue 4, April 2015 | Popularity: 6.8 / 10

Rate This Article!      

An Effective Approach to Compute Distance of Uncertain Data by Using K-Nearest Neighbor

A. Jayasri, Dr. M. B. Mukesh Krishnan

Abstract: Generally, an object of uncertain data could be presented through a probability distribution. Now days the Clustering uncertain data have been determined as a very important issue. In existing system, technique of Kullback-Leibler Divergence is mostly used by information theory in order to calculate the similarity between certain data. This research work based over calculation of Probability mass function, whereas uncertain data values of discrete and continuous are calculated. With use of the probability mass function, the cases of continuous and discrete distance value are individually measured. The probabilistic ratio of continuous and discrete distance is used to determine the similarity between certain data. For clustering the uncertain data by performing the techniques of Density based clustering. Therefore, the main drawback in the existing system is to selecting the nearest neighbor. To overcome from this type of problem, we introduced algorithm of K-nearest-neighbor in our proposed work to determine the nearest neighbor. The algorithm of K-nearest-neighbor use to calculate the distance among scenarios set and a query scenario in the data set. Here, distance is measure for both the cases of discrete and continuous through the use of using Probability mass function. After that the algorithm of KNN is used to measure the nearest neighbor. Hence, our proposed works produce an effective result and overcomes the drawback of existing technique.

Keywords: KNN, K-L Divergence, Uncertain Data

Edition: Volume 4 Issue 4, April 2015

Pages: 1916 - 1920

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles