Probabilistic Nearest-Neighbor Query on Uncertain Objects
Source: University of Munich
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or face recognition systems, distances between objects have to be computed based on vague and uncertain data. A successful approach is to express the distance between two uncertain objects by probability density functions which assign a probability value to each possible distance value. By integrating the complete probabilistic distance function as a whole directly into the query algorithm, the full information provided by these functions is exploited.
| Format: | Size: | 328.60 | |
| Date: | Jun 2007 |



