Sciweavers

14 search results - page 1 / 3
» Finding near neighbors through cluster pruning
Sort
View
PODS
2007
ACM
100views Database» more  PODS 2007»
14 years 11 months ago
Finding near neighbors through cluster pruning
Flavio Chierichetti, Alessandro Panconesi, Prabhak...
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 11 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
PAMI
2008
152views more  PAMI 2008»
13 years 10 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
GIS
2006
ACM
14 years 12 months ago
Exploiting a page-level upper bound for multi-type nearest neighbor queries
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
Xiaobin Ma, Shashi Shekhar, Hui Xiong, Pusheng Zha...
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 2 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic