Sciweavers

522 search results - page 3 / 105
» Feature selection for ranking using boosted trees
Sort
View
102
Voted
WWW
2011
ACM
14 years 4 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
BMCBI
2006
139views more  BMCBI 2006»
14 years 9 months ago
DNA Molecule Classification Using Feature Primitives
Background: We present a novel strategy for classification of DNA molecules using measurements from an alpha-Hemolysin channel detector. The proposed approach provides excellent c...
Raja Tanveer Iqbal, Matthew Landry, Stephen Winter...
SAC
2004
ACM
15 years 2 months ago
Interval and dynamic time warping-based decision trees
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Juan José Rodríguez, Carlos J. Alons...
ICIP
2007
IEEE
15 years 11 months ago
Domain-Partitioning Rankboost for Face Recognition
In this paper we propose a domain partitioning RankBoost approach for face recognition. This method uses Local Gabor Binary Pattern Histogram (LGBPH) features for face representat...
Bangpeng Yao, Haizhou Ai, Yoshihisa Ijiri, Shihong...
BMCBI
2004
167views more  BMCBI 2004»
14 years 9 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...