34 search results - page 3 / 7 » Finding Data Broadness Via Generalized Nearest Neighbors |
138
Voted
PVLDB
2008
14 years 12 months ago
2008
Uncertainty pervades many domains in our lives. Current real-life applications, e.g., location tracking using GPS devices or cell phones, multimedia feature extraction, and sensor...
201
click to vote
SIGMOD
2006
ACM
16 years 17 days ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
121
Voted
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
91
Voted
IJPRAI
2006
15 years 12 days ago
2006
Linear Discriminant Analysis (LDA) is a popular feature extraction technique in statistical pattern recognition. However, it often suffers from the small sample size problem when ...
213
click to vote
GIS
2006
ACM
16 years 1 months ago
2006
ACM
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...