Name
Abstract | ||
|---|---|---|
The Reverse k Nearest Neighbor (RkNN) query is valuable for finding objects influenced by a specific object and is widely used in both scientific and commercial systems. However, the influence level of each object is unknown, information that is critical for some applications (e.g. target marketing). In this paper, we propose a new query type, Ordered Reverse k Nearest Neighbor (ORkNN), and make efforts to adapt it in an on-demand scenario. An Order-k Voronoi diagram based approach is used to answer ORkNN queries. In particular, for different values of k, we pre-construct only one Voronoi diagram. Algorithms on both the server and the clients are presented. We also present experimental results that suggest our proposed algorithms may have practical applications. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.3837/tiis.2014.11.013 | KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS |
Keywords | Field | DocType |
on-demand broadcast,ordered reverse k nearest neighbor query,ordered order-k Voronoi diagram | k-nearest neighbors algorithm,Broadcasting,Data mining,On demand,Computer science,Voronoi diagram,Nearest neighbor search | Journal |
Volume | Issue | ISSN |
8 | SP11 | 1976-7277 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Li | 1 | 76 | 24.03 |
| Li Guohui | 2 | 447 | 76.53 |
| Quan Zhou | 3 | 10 | 3.53 |
| Yanhong Li | 4 | 0 | 0.34 |