Sciweavers

108 search results - page 13 / 22
» Cover Trees for Nearest Neighbor
Sort
View
CVPR
2005
IEEE
14 years 10 months ago
Random Subspaces and Subsampling for 2-D Face Recognition
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
Nitesh V. Chawla, Kevin W. Bowyer
IDA
2005
Springer
14 years 1 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
ICCV
2007
IEEE
14 years 9 months ago
Improving Descriptors for Fast Tree Matching by Optimal Linear Projection
In this paper we propose to transform an image descriptor so that nearest neighbor (NN) search for correspondences becomes the optimal matching strategy under the assumption that ...
Krystian Mikolajczyk, Jiri Matas
AAAI
2011
12 years 7 months ago
A Scalable Tree-Based Approach for Joint Object and Pose Recognition
Recognizing possibly thousands of objects is a crucial capability for an autonomous agent to understand and interact with everyday environments. Practical object recognition comes...
Kevin Lai, Liefeng Bo, Xiaofeng Ren, Dieter Fox
SAC
2004
ACM
14 years 1 months ago
An optimized approach for KNN text categorization using P-trees
The importance of text mining stems from the availability of huge volumes of text databases holding a wealth of valuable information that needs to be mined. Text categorization is...
Imad Rahal, William Perrizo