Sciweavers

FLAIRS
1998
14 years 25 days ago
Interactively Training Pixel Classifiers
Manual generation of training examples for supervised learning is an expensive process. One way to reduce this cost is to produce training instances that are highly informative. T...
Justus H. Piater, Edward M. Riseman, Paul E. Utgof...
ACML
2009
Springer
14 years 4 months ago
Learning Algorithms for Domain Adaptation
A fundamental assumption for any machine learning task is to have training and test data instances drawn from the same distribution while having a sufficiently large number of tra...
Manas A. Pathak, Eric Nyberg
COLT
2005
Springer
14 years 5 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
AWIC
2007
Springer
14 years 5 months ago
Improving Text Classification by Web Corpora
A major difficulty of supervised approaches for text classification is that they require a great number of training instances in order to construct an accurate classifier. This pap...
Rafael Guzmán-Cabrera, Manuel Montes-y-G&oa...
ICDM
2008
IEEE
164views Data Mining» more  ICDM 2008»
14 years 6 months ago
Classifying High-Dimensional Text and Web Data Using Very Short Patterns
In this paper, we propose the "Democratic Classifier", a simple, democracy-inspired patternbased classification algorithm that uses very short patterns for classificatio...
Hassan H. Malik, John R. Kender
ICML
2006
IEEE
15 years 9 days ago
Concept boundary detection for speeding up SVMs
Support Vector Machines (SVMs) suffer from an O(n2 ) training cost, where n denotes the number of training instances. In this paper, we propose an algorithm to select boundary ins...
Navneet Panda, Edward Y. Chang, Gang Wu