Sciweavers

7378 search results - page 1106 / 1476
» Introduction to Machine Learning
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Totally corrective boosting algorithms that maximize the margin
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...
Gunnar Rätsch, Jun Liao, Manfred K. Warmuth
ICML
2003
IEEE
16 years 7 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
SIGSOFT
2008
ACM
16 years 7 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
169
Voted
WWW
2009
ACM
16 years 7 months ago
Automatically assessing resource quality for educational digital libraries
With the rise of community-generated web content, the need for automatic assessment of resource quality has grown, particularly in the realm of educational digital libraries. We d...
Philipp G. Wetzler, Steven Bethard, Kirsten R. But...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 7 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
« Prev « First page 1106 / 1476 Last » Next »