Nearest neighbor searching under uncertainty II

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach.

    Original languageEnglish (US)
    Title of host publicationPODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems
    Pages115-126
    Number of pages12
    DOIs
    StatePublished - 2013
    Event32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013 - New York, NY, United States
    Duration: Jun 22 2013Jun 27 2013

    Other

    Other32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013
    CountryUnited States
    CityNew York, NY
    Period6/22/136/27/13

    Fingerprint

    Location based services
    Face recognition
    Probability distributions
    Distribution functions
    Uncertainty
    Sensors
    Nearest neighbor search

    Keywords

    • Approximate nearest neighbor
    • Indexing uncertain data
    • Probabilistic nearest neighbor
    • Threshold queries

    ASJC Scopus subject areas

    • Software
    • Information Systems
    • Hardware and Architecture

    Cite this

    Agarwal, P. K., Aronov, B., Har-Peled, S., Phillips, J. M., Yi, K., & Zhang, W. (2013). Nearest neighbor searching under uncertainty II. In PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems (pp. 115-126) https://doi.org/10.1145/2463664.2465219

    Nearest neighbor searching under uncertainty II. / Agarwal, Pankaj K.; Aronov, Boris; Har-Peled, Sariel; Phillips, Jeff M.; Yi, Ke; Zhang, Wuzhou.

    PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems. 2013. p. 115-126.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Agarwal, PK, Aronov, B, Har-Peled, S, Phillips, JM, Yi, K & Zhang, W 2013, Nearest neighbor searching under uncertainty II. in PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems. pp. 115-126, 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, United States, 6/22/13. https://doi.org/10.1145/2463664.2465219
    Agarwal PK, Aronov B, Har-Peled S, Phillips JM, Yi K, Zhang W. Nearest neighbor searching under uncertainty II. In PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems. 2013. p. 115-126 https://doi.org/10.1145/2463664.2465219
    Agarwal, Pankaj K. ; Aronov, Boris ; Har-Peled, Sariel ; Phillips, Jeff M. ; Yi, Ke ; Zhang, Wuzhou. / Nearest neighbor searching under uncertainty II. PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems. 2013. pp. 115-126
    @inproceedings{4e561c0613214154a20c1c23c7193670,
    title = "Nearest neighbor searching under uncertainty II",
    abstract = "Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach.",
    keywords = "Approximate nearest neighbor, Indexing uncertain data, Probabilistic nearest neighbor, Threshold queries",
    author = "Agarwal, {Pankaj K.} and Boris Aronov and Sariel Har-Peled and Phillips, {Jeff M.} and Ke Yi and Wuzhou Zhang",
    year = "2013",
    doi = "10.1145/2463664.2465219",
    language = "English (US)",
    isbn = "9781450320665",
    pages = "115--126",
    booktitle = "PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems",

    }

    TY - GEN

    T1 - Nearest neighbor searching under uncertainty II

    AU - Agarwal, Pankaj K.

    AU - Aronov, Boris

    AU - Har-Peled, Sariel

    AU - Phillips, Jeff M.

    AU - Yi, Ke

    AU - Zhang, Wuzhou

    PY - 2013

    Y1 - 2013

    N2 - Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach.

    AB - Nearest-neighbor (NN) search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise. We therefore study nearest neighbor queries in a probabilistic framework in which the location of each input point is specified as a probability distribution function. We present efficient algorithms for (i) computing all points that are nearest neighbors of a query point with nonzero probability; (ii) estimating, within a specified additive error, the probability of a point being the nearest neighbor of a query point; (iii) using it to return the point that maximizes the probability being the nearest neighbor, or all the points with probabilities greater than some threshold to be the NN. We also present some experimental results to demonstrate the effectiveness of our approach.

    KW - Approximate nearest neighbor

    KW - Indexing uncertain data

    KW - Probabilistic nearest neighbor

    KW - Threshold queries

    UR - http://www.scopus.com/inward/record.url?scp=84880555742&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84880555742&partnerID=8YFLogxK

    U2 - 10.1145/2463664.2465219

    DO - 10.1145/2463664.2465219

    M3 - Conference contribution

    AN - SCOPUS:84880555742

    SN - 9781450320665

    SP - 115

    EP - 126

    BT - PODS 2013 - Proceedings of the 32nd Symposium on Principles of Database Systems

    ER -