Sciweavers

649 search results - page 57 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
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
AAAI
2012
11 years 10 months ago
Double-Bit Quantization for Hashing
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
Weihao Kong, Wu-Jun Li
ICML
2005
IEEE
14 years 8 months ago
Predicting relative performance of classifiers from samples
This paper is concerned with the problem of predicting relative performance of classification algorithms. It focusses on methods that use results on small samples and discusses th...
Rui Leite, Pavel Brazdil
TRECVID
2008
13 years 9 months ago
National Institute of Informatics, Japan at TRECVID 2008
This paper reports our experiments for TRECVID 2008 tasks: high level feature extraction, search and contentbased copy detection. For the high level feature extraction task, we use...
Duy-Dinh Le, Xiaomeng Wu, Shin'ichi Satoh, Sheetal...
ICML
2007
IEEE
14 years 8 months ago
Minimum reference set based feature selection for small sample classifications
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
Xue-wen Chen, Jong Cheol Jeong