Sciweavers

283 search results - page 25 / 57
» Bounds on the Generalization Performance of Kernel Machine E...
Sort
View
JMLR
2002
89views more  JMLR 2002»
13 years 7 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
ICASSP
2011
IEEE
12 years 11 months ago
Using the kernel trick in compressive sensing: Accurate signal recovery from fewer measurements
Compressive sensing accurately reconstructs a signal that is sparse in some basis from measurements, generally consisting of the signal’s inner products with Gaussian random vec...
Hanchao Qi, Shannon Hughes
ACL
2003
13 years 8 months ago
Fast Methods for Kernel-Based Text Analysis
Kernel-based learning (e.g., Support Vector Machines) has been successfully applied to many hard problems in Natural Language Processing (NLP). In NLP, although feature combinatio...
Taku Kudo, Yuji Matsumoto
CIKM
2008
Springer
13 years 9 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
ICML
1998
IEEE
14 years 8 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour