Sciweavers

1439 search results - page 4 / 288
» Bagging with Adaptive Costs
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Batch mode Adaptive Multiple Instance Learning for computer vision tasks
Multiple Instance Learning (MIL) has been widely exploited in many computer vision tasks, such as image retrieval, object tracking and so on. To handle ambiguity of instance label...
Wen Li, Lixin Duan, Ivor Wai-Hung Tsang, Dong Xu
ICASSP
2011
IEEE
12 years 11 months ago
Multiple instance tracking based on hierarchical maximizing bag's margin boosting
In online tracking, the tracker evolves to reflect variations in object appearance and surroundings. This updating process is formulated as a supervised learning problem, thus a ...
Chunxiao Liu, Guijin Wang, Xinggang Lin, Bobo Zeng
ICRA
2007
IEEE
133views Robotics» more  ICRA 2007»
14 years 1 months ago
A visual bag of words method for interactive qualitative localization and mapping
— Localization for low cost humanoid or animal-like personal robots has to rely on cheap sensors and has to be robust to user manipulations of the robot. We present a visual loca...
David Filliat
ECML
2007
Springer
14 years 1 months ago
Roulette Sampling for Cost-Sensitive Learning
In this paper, we propose a new and general preprocessor algorithm, called CSRoulette, which converts any cost-insensitive classification algorithms into cost-sensitive ones. CSRou...
Victor S. Sheng, Charles X. Ling
JMLR
2010
128views more  JMLR 2010»
13 years 6 months ago
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
Bagging is a simple way to combine estimates in order to improve their performance. This method, suggested by Breiman in 1996, proceeds by resampling from the original data set, c...
Gérard Biau, Frédéric C&eacut...