Sciweavers

522 search results - page 40 / 105
» Feature selection for ranking using boosted trees
Sort
View
ICML
2004
IEEE
16 years 18 days ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
15 years 1 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo
ACMSE
2010
ACM
14 years 6 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
MVA
2010
181views Computer Vision» more  MVA 2010»
14 years 10 months ago
Human action detection via boosted local motion histograms
This paper presents a novel learning method for human action detection in video sequences. The detecting problem is not limited in controlled settings like stationary background or...
Qingshan Luo, Xiaodong Kong, Guihua Zeng, Jianping...
ICPR
2010
IEEE
14 years 9 months ago
Boosting Bayesian MAP Classification
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
Paolo Piro, Richard Nock, Frank Nielsen, Michel Ba...