Influence sets based on reverse nearest neighbor queries

By Flip Korn, S. Muthu Muthukrishnan. ACM SIGMOD Conference, 2000

592 citations recorded by the source corpus.

Inherent in the operation of many decision support and continuous referral systems is the notion of the “influence” of a data point on the database. This notion arises in examples such as finding the set of customers affected by the opening of a new store outlet location, notifying the subset of subscribers to a digital library who will find a newly added document most relevant, etc. Standard approaches to determining the influence set of a data point involve range searching and nearest neighbor queries. In this paper, we formalize a novel notion of influence based on reverse neighbor queries and its variants. Since the nearest neighbor relation is not symmetric, the set of points that are closest to a query point (i.e., the nearest neighbors) differs from the set of points that have the query point as their nearest neighbor (called the reverse nearest neighbors). Influence sets based on reverse nearest neighbor (RNN) queries seem to capture the intuitive notion of influence from our motivating examples. We present a general approach for solving RNN queries and an efficient R-tree based method for large data sets, based on this approach. Although the RNN query appears to be natural, it has not been studied previously. RNN queries are of independent interest, and as such should be part of the suite of available queries for processing spatial and multimedia data. In our experiments with real geographical data, the proposed method appears to scale logarithmically, whereas straightforward sequential scan scales linearly. Our experimental study also shows that approaches based on range searching or nearest neighbors are ineffective at finding influence sets of our interest.

Subfields: Computer Vision and Pattern Recognition, Signal Processing

View Paper: https://www.semanticscholar.org/paper/e09b02bd8a479e4184141b6504a35db61e2cb057

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Bernhard Seeger
  2. Evangelos Dellis
  3. Dimitris Papadias
  4. Federico Pernici
  5. A. del Bimbo
  6. Wen Jin
  7. Shang-Hua Teng
  8. Yufei Tao

In Signal Processing

  1. Dimitris Papadias
  2. Bernhard Seeger
  3. Yufei Tao
  4. Evangelos Dellis
  5. Jiawei Han
  6. Yu Zheng
  7. Francisco Herrera
  8. Wei Wang

Citations in the corpus