Sciweavers

649 search results - page 79 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
ICCV
2003
IEEE
15 years 11 months ago
Minimum Risk Distance Measure for Object Recognition
Recently, the optimal distance measure for a given object discrimination task under the nearest neighbor framework was derived [1]. For ease of implementation and efficiency consi...
Shyjan Mahamud, Martial Hebert
ICML
2007
IEEE
15 years 10 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
73
Voted
ICML
2006
IEEE
15 years 10 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
WWW
2005
ACM
15 years 10 months ago
An experimental study on large-scale web categorization
Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification tech...
Tie-Yan Liu, Yiming Yang, Hao Wan, Qian Zhou, Bin ...
KDD
2001
ACM
124views Data Mining» more  KDD 2001»
15 years 10 months ago
Tri-plots: scalable tools for multidimensional data mining
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
Agma J. M. Traina, Caetano Traina Jr., Spiros Papa...