Sciweavers

421 search results - page 12 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Semi-supervised learning on large complex simulations
Complex simulations can generate very large amounts of data stored disjointly across many local disks. Learning from this data can be problematic due to the difficulty of obtainin...
John Nicholas Korecki, Kevin W. Bowyer, Larry O. H...
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 2 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...
JMLR
2006
125views more  JMLR 2006»
14 years 9 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
PKDD
2010
Springer
143views Data Mining» more  PKDD 2010»
14 years 7 months ago
A Unified Approach to Active Dual Supervision for Labeling Features and Examples
Abstract. When faced with the task of building accurate classifiers, active learning is often a beneficial tool for minimizing the requisite costs of human annotation. Traditional ...
Josh Attenberg, Prem Melville, Foster J. Provost
ALT
1998
Springer
15 years 1 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh