Sciweavers

2031 search results - page 131 / 407
» Oblique Support Vector Machines
Sort
View
ICML
2001
IEEE
14 years 9 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
IJCNN
2006
IEEE
14 years 2 months ago
Non-Relevance Feedback Document Retrieval based on One Class SVM and SVDD
— This paper reports a new document retrieval method using non-relevant documents. Especially, this paper reports a comparison of retrieval efficiency between One Class Support ...
Takashi Onoda, Hiroshi Murata, Seiji Yamada
ICML
2007
IEEE
14 years 9 months ago
Sparse probabilistic classifiers
The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining ...
Romain Hérault, Yves Grandvalet
ICML
2003
IEEE
14 years 9 months ago
Tackling the Poor Assumptions of Naive Bayes Text Classifiers
Naive Bayes is often used as a baseline in text classification because it is fast and easy to implement. Its severe assumptions make such efficiency possible but also adversely af...
Jason D. Rennie, Lawrence Shih, Jaime Teevan, Davi...
ICML
2000
IEEE
14 years 9 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers