Sciweavers

143 search results - page 10 / 29
» Lazy Learning for Improving Ranking of Decision Trees
Sort
View
COLT
1998
Springer
13 years 11 months ago
Improved Boosting Algorithms using Confidence-Rated Predictions
Abstract. We describe several improvements to Freund and Schapire's AdaBoost boosting algorithm, particularly in a setting in which hypotheses may assign confidences to each o...
Robert E. Schapire, Yoram Singer
ESWA
2006
122views more  ESWA 2006»
13 years 7 months ago
Transmembrane segments prediction and understanding using support vector machine and decision tree
In recent years, there have been many studies focusing on improving the accuracy of prediction of transmembrane segments, and many significant results have been achieved. In spite...
Jieyue He, Hae-Jin Hu, Robert W. Harrison, Phang C...
GIS
2010
ACM
13 years 6 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 6 months ago
Generalized model learning for Reinforcement Learning on a humanoid robot
— Reinforcement learning (RL) algorithms have long been promising methods for enabling an autonomous robot to improve its behavior on sequential decision-making tasks. The obviou...
Todd Hester, Michael Quinlan, Peter Stone
NIPS
2007
13 years 9 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...