Sampling hidden objects using nearest-neighbor oracles
KDD, pp. 1325-1333, 2011.
nearest-neighbor oraclehidden webset sizehidden objectvoronoi partitioningMore(9+)
Given an unknown set of objects embedded in the Euclidean plane and a nearest-neighbor oracle, how to estimate the set size and other properties of the objects? In this paper we address this problem. We propose an efficient method that uses the Voronoi partitioning of the space by the objects and a nearest-neighbor oracle. Our method can ...More
PPT (Upload PPT)