Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases

By Mohammad R. Kolahdouzan, Cyrus Shahabi. Very Large Data Bases Conference, 2004

540 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Geography, Planning and Development, Signal Processing

View Paper: https://www.semanticscholar.org/paper/92ab211782260e4d2e6b572e3d072400ce99acfd

How researchers see this paper

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

In Computer Networks and Communications

In Geography, Planning and Development

In Signal Processing

Citations in the corpus

HeteSim: A General Framework for Relevance Measure in Heterogeneous Networks (2013, methodology): “nearest neighbor is also widely used in similarity measure [12], which aims at finding top-k nearest neighbors according to similarities defined on numerical features.”
PathSim (2011, background): “Also widely studied are k nearest neighbor search in spatial data [11] and other high dimensional data [2], which aims at finding top-k nearest neighbors according to similarities defined on numerical features.”
Scalable network distance browsing in spatial databases (2008, background): “This differentiates our approach from other approaches such as those proposed by Papadias et al. [21], as well as those of Cho and Chung [2], and Kolahdouzan and Shahabi [15], which must compute the shortest paths anew each time there are changes in q or S, which, unfortunately, may be quite fre”
On Trip Planning Queries in Spatial Databases (2005, background): “Recent papers that extend various types of queries to spatial networks are [27, 21 , 30].”
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation (2011, methodology): “Many approaches have been proposed, such as Voronoi-graph based methods [26, 18], Euclidean restriction plus network expansion [34], etc.”
Aggregate nearest neighbor queries in spatial databases (2005, background): “Furthermore, variations of nearest neighbor queries have been studied in the context of (i) road networks, where the distance between two points is defined as the length of the shortest path connecting them in the network [Papadias et al. 2003; Kolahdouzan and Shahabi 2004], (ii) spatio-temporal dat”
Ranking-based clustering of heterogeneous information networks with star network schema (2009, background): “However, although clustering on homogeneous networks has been studied over decades, clustering on heterogeneous networks has not been addressed until recently.”