Sciweavers

701 search results - page 97 / 141
» Self Bounding Learning Algorithms
Sort
View
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
13 years 6 months ago
Online Knowledge-Based Support Vector Machines
Prior knowledge, in the form of simple advice rules, can greatly speed up convergence in learning algorithms. Online learning methods predict the label of the current point and the...
Gautam Kunapuli, Kristin P. Bennett, Amina Shabbee...
ALT
2002
Springer
14 years 4 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
CIKM
2010
Springer
13 years 5 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
FOCS
1999
IEEE
13 years 12 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio
SIAMCOMP
2008
140views more  SIAMCOMP 2008»
13 years 7 months ago
The Forgetron: A Kernel-Based Perceptron on a Budget
Abstract. The Perceptron algorithm, despite its simplicity, often performs well in online classification tasks. The Perceptron becomes especially effective when it is used in conju...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer