Sciweavers

147 search results - page 28 / 30
» Agnostic Learning with Ensembles of Classifiers
Sort
View
KDD
2009
ACM
150views Data Mining» more  KDD 2009»
14 years 8 months ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
BMCBI
2010
98views more  BMCBI 2010»
13 years 7 months ago
Learning to predict expression efficacy of vectors in recombinant protein production
Background: Recombinant protein production is a useful biotechnology to produce a large quantity of highly soluble proteins. Currently, the most widely used production system is t...
Wen-Ching Chan, Po-Huang Liang, Yan-Ping Shih, Uen...
CSIE
2009
IEEE
14 years 2 months ago
Building a General Purpose Cross-Domain Sentiment Mining Model
Building a model using machine learning that can classify the sentiment of natural language text often requires an extensive set of labeled training data from the same domain as t...
Matthew Whitehead, Larry Yaeger
SDM
2010
SIAM
218views Data Mining» more  SDM 2010»
13 years 8 months ago
Confidence-Based Feature Acquisition to Minimize Training and Test Costs
We present Confidence-based Feature Acquisition (CFA), a novel supervised learning method for acquiring missing feature values when there is missing data at both training and test...
Marie desJardins, James MacGlashan, Kiri L. Wagsta...
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
14 years 7 months ago
Empirical comparisons of various voting methods in bagging
Finding effective methods for developing an ensemble of models has been an active research area of large-scale data mining in recent years. Models learned from data are often subj...
Kelvin T. Leung, Douglas Stott Parker Jr.