Issue No. 09 - September (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.78
Thomas Bernecker , Ludwig-Maximilians-Universität München, Germany
Hans-Peter Kriegel , Ludwig-Maximilians-Universität München, Germany
Nikos Mamoulis , University of Hong Kong, Hong Kong
Matthias Renz , Ludwig-Maximilians-Universität München, Germany
Andreas Zuefle , Ludwig-Maximilians-Universität München, Germany
This paper introduces a scalable approach for probabilistic top-k similarity ranking on uncertain vector data. Each uncertain object is represented by a set of vector instances that is assumed to be mutually exclusive. The objective is to rank the uncertain data according to their distance to a reference object. We propose a framework that incrementally computes for each object instance and ranking position, the probability of the object falling at that ranking position. The resulting rank probability distribution can serve as input for several state-of-the-art probabilistic ranking models. Existing approaches compute this probability distribution by applying the Poisson binomial recurrence technique of quadratic complexity. In this paper, we theoretically as well as experimentally show that our framework reduces this to a linear-time complexity while having the same memory requirements, facilitated by incremental accessing of the uncertain vector instances in increasing order of their distance to the reference object. Furthermore, we show how the output of our method can be used to apply probabilistic top-k ranking for the objects, according to different state-of-the-art definitions. We conduct an experimental evaluation on synthetic and real data, which demonstrates the efficiency of our approach.
Uncertain databases, probabilistic ranking, similarity search.
T. Bernecker, A. Zuefle, H. Kriegel, M. Renz and N. Mamoulis, "Scalable Probabilistic Similarity Ranking in Uncertain Databases," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 1234-1246, 2010.