Sciweavers

2190 search results - page 112 / 438
» Learning with the Set Covering Machine
Sort
View
DAC
2003
ACM
14 years 10 months ago
Support vector machines for analog circuit performance representation
The use of Support Vector Machines (SVMs) to represent the performance space of analog circuits is explored. In abstract terms, an analog circuit maps a set of input design parame...
Fernando De Bernardinis, Michael I. Jordan, Albert...
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
14 years 9 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
NECO
2000
86views more  NECO 2000»
13 years 9 months ago
A Bayesian Committee Machine
The Bayesian committee machine (BCM) is a novel approach to combining estimators which were trained on different data sets. Although the BCM can be applied to the combination of a...
Volker Tresp
ICML
2007
IEEE
14 years 10 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
ICML
2002
IEEE
14 years 10 months ago
Cranking: Combining Rankings Using Conditional Probability Models on Permutations
A new approach to ensemble learning is introduced that takes ranking rather than classification as fundamental, leading to models on the symmetric group and its cosets. The approa...
Guy Lebanon, John D. Lafferty