Sciweavers

801 search results - page 109 / 161
» Machine Learning with Data Dependent Hypothesis Classes
Sort
View
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 1 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
ISCIS
2005
Springer
14 years 2 months ago
Classification of Volatile Organic Compounds with Incremental SVMs and RBF Networks
Support Vector Machines (SVMs) have been applied to solve the classification of volatile organic compounds (VOC) data in some recent studies. SVMs provide good generalization perfo...
Zeki Erdem, Robi Polikar, Nejat Yumusak, Fikret S....
ICDM
2010
IEEE
134views Data Mining» more  ICDM 2010»
13 years 6 months ago
Consequences of Variability in Classifier Performance Estimates
The prevailing approach to evaluating classifiers in the machine learning community involves comparing the performance of several algorithms over a series of usually unrelated data...
Troy Raeder, T. Ryan Hoens, Nitesh V. Chawla
ICML
2009
IEEE
14 years 9 months ago
Uncertainty sampling and transductive experimental design for active dual supervision
Dual supervision refers to the general setting of learning from both labeled examples as well as labeled features. Labeled features are naturally available in tasks such as text c...
Vikas Sindhwani, Prem Melville, Richard D. Lawrenc...
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 9 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman