Sciweavers

91 search results - page 17 / 19
» Online Non-stationary Boosting
Sort
View
ICTAI
2010
IEEE
13 years 7 months ago
Combining Mixed Integer Programming and Supervised Learning for Fast Re-planning
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
Emmanuel Rachelson, Ala Ben Abbes, Sebastien Dieme...
ECCE
2007
13 years 11 months ago
Cross-participants: fostering design-use mediation in an open source software community
Motivation – This research aims at investigating emerging roles and forms of participation fostering design-use mediation during the Open Source Software design process Research...
Flore Barcellini, Françoise Détienne...
ECCV
2010
Springer
13 years 10 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
CVPR
2006
IEEE
14 years 11 months ago
Applying Ensembles of Multilinear Classifiers in the Frequency Domain
Ensemble methods such as bootstrap, bagging or boosting have had a considerable impact on recent developments in machine learning, pattern recognition and computer vision. Theoret...
Christian Bauckhage, Thomas Käster, John K. T...
WWW
2008
ACM
14 years 10 months ago
Floatcascade learning for fast imbalanced web mining
This paper is concerned with the problem of Imbalanced Classification (IC) in web mining, which often arises on the web due to the "Matthew Effect". As web IC applicatio...
Xiaoxun Zhang, Xueying Wang, Honglei Guo, Zhili Gu...