Efficient Clustering of Uncertain Data
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Efficient Mining of Frequent Patterns from Uncertain Data
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Efficient search for the top-k probable nearest neighbors in uncertain databases
Proceedings of the VLDB Endowment
Clustering Uncertain Data Using Voronoi Diagrams
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
A Survey of Uncertain Data Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
A Rule-Based Classification Algorithm for Uncertain Data
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
An order-clique-based approach for mining maximal co-locations
Information Sciences: an International Journal
Hi-index | 0.00 |
Evaluating distances between uncertain objects is needed for some uncertain data mining techniques based on distance. An uncertain object can be described by uncertain numerical or categorical attributes. However, many uncertain data mining algorithms mainly discuss methods of evaluating distances between uncertain numerical objects. In this paper, an efficient method of evaluating distances between uncertain categorical objects is presented. The method is used in nearest-neighbor classifying. Experiments with datasets based on UCI datasets and the plant dataset of "Three Parallel Rivers of Yunnan Protected Areas" verify the method is efficient.