Sciweavers

2190 search results - page 6 / 438
» Learning with the Set Covering Machine
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Predicting diverse subsets using structural SVMs
In many retrieval tasks, one important goal involves retrieving a diverse set of results (e.g., documents covering a wide range of topics for a search query). First of all, this r...
Yisong Yue, Thorsten Joachims
COLT
1995
Springer
15 years 6 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
AUSDM
2006
Springer
177views Data Mining» more  AUSDM 2006»
15 years 7 months ago
On The Optimal Working Set Size in Serial and Parallel Support Vector Machine Learning With The Decomposition Algorithm
The support vector machine (SVM) is a wellestablished and accurate supervised learning method for the classification of data in various application fields. The statistical learnin...
Tatjana Eitrich, Bruno Lang
EUROCOLT
1999
Springer
15 years 7 months ago
Regularized Principal Manifolds
Many settings of unsupervised learning can be viewed as quantization problems — the minimization of the expected quantization error subject to some restrictions. This allows the ...
Alex J. Smola, Robert C. Williamson, Sebastian Mik...
TSD
2010
Springer
15 years 1 months ago
A Priori and A Posteriori Machine Learning and Nonlinear Artificial Neural Networks
The main idea of a priori machine learning is to apply a machine learning method on a machine learning problem itself. We call it "a priori" because the processed data se...
Jan Zelinka, Jan Romportl, Ludek Müller