Sciweavers

522 search results - page 62 / 105
» Feature selection for ranking using boosted trees
Sort
View
ACL
2008
15 years 1 months ago
Computing Confidence Scores for All Sub Parse Trees
Computing confidence scores for applications, such as dialogue system, information retrieving and extraction, is an active research area. However, its focus has been primarily on ...
Feng Lin, Fuliang Weng
CVPR
2005
IEEE
16 years 1 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang
DMIN
2006
124views Data Mining» more  DMIN 2006»
15 years 1 months ago
Optimal Multi-class Classification with Principal Components
An approach to build a multi-class classifier is proposed in this paper. This approach consists of a derivation to show under which loss function an optimal classifier can be obtai...
Albert Hoang
DASFAA
2009
IEEE
104views Database» more  DASFAA 2009»
15 years 6 months ago
On the Discovery of Conserved XML Query Patterns for Evolution-Conscious Caching
Existing xml query pattern-based caching strategies focus on extracting the set of frequently issued query pattern trees (qpt) based on the support of the qpts in the history. Thes...
Sourav S. Bhowmick
IDA
2007
Springer
15 years 6 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski