Sciweavers

393 search results - page 18 / 79
» On the Convergence of Boosting Procedures
Sort
View
TNN
2010
176views Management» more  TNN 2010»
13 years 3 months ago
Sparse approximation through boosting for learning large scale kernel machines
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
Ping Sun, Xin Yao
TNN
2010
127views Management» more  TNN 2010»
13 years 3 months ago
RAMOBoost: ranked minority oversampling in boosting
In recent years, learning from imbalanced data has attracted growing attention from both academia and industry due to the explosive growth of applications that use and produce imba...
Sheng Chen, Haibo He, Edwardo A. Garcia
ICML
2007
IEEE
14 years 9 months ago
Boosting for transfer learning
Traditional machine learning makes a basic assumption: the training and test data should be under the same distribution. However, in many cases, this identicaldistribution assumpt...
Wenyuan Dai, Qiang Yang, Gui-Rong Xue, Yong Yu
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
14 years 1 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...
COLT
1997
Springer
14 years 23 days ago
General Convergence Results for Linear Discriminant Updates
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
Adam J. Grove, Nick Littlestone, Dale Schuurmans