Sciweavers

649 search results - page 38 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
SIGMOD
2002
ACM
114views Database» more  SIGMOD 2002»
14 years 7 months ago
Time-parameterized queries in spatio-temporal databases
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
Yufei Tao, Dimitris Papadias
CVPR
2007
IEEE
14 years 9 months ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
CVPR
2004
IEEE
14 years 9 months ago
Learning Classifiers from Imbalanced Data Based on Biased Minimax Probability Machine
We consider the problem of the binary classification on imbalanced data, in which nearly all the instances are labelled as one class, while far fewer instances are labelled as the...
Kaizhu Huang, Haiqin Yang, Irwin King, Michael R. ...
WCE
2007
13 years 9 months ago
A Fast Multivariate Nearest Neighbour Imputation Algorithm
— Imputation of missing data is important in many areas, such as reducing non-response bias in surveys and maintaining medical documentation. Nearest neighbour (NN) imputation al...
Norman Solomon, Giles Oatley, Kenneth McGarry
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 9 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
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...
Levent Ertöz, Michael Steinbach, Vipin Kumar