Sciweavers

4255 search results - page 161 / 851
» On Learning Boolean Functions
Sort
View
COLT
2007
Springer
15 years 4 months ago
How Good Is a Kernel When Used as a Similarity Measure?
Recently, Balcan and Blum [1] suggested a theory of learning based on general similarity functions, instead of positive semi-definite kernels. We study the gap between the learnin...
Nathan Srebro
SAT
2009
Springer
132views Hardware» more  SAT 2009»
15 years 4 months ago
Relaxed DPLL Search for MaxSAT
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
Lukas Kroc, Ashish Sabharwal, Bart Selman
KI
2006
Springer
14 years 10 months ago
Classification of Skewed and Homogenous Document Corpora with Class-Based and Corpus-Based Keywords
In this paper, we examine the performance of the two policies for keyword selection over standard document corpora of varying properties. While in corpus-based policy a single set ...
Arzucan Özgür, Tunga Güngör
BMCBI
2008
100views more  BMCBI 2008»
14 years 10 months ago
High-precision high-coverage functional inference from integrated data sources
Background: Information obtained from diverse data sources can be combined in a principled manner using various machine learning methods to increase the reliability and range of k...
Bolan Linghu, Evan S. Snitkin, Dustin T. Holloway,...
IJCNN
2008
IEEE
15 years 4 months ago
Numerical condition of feedforward networks with opposite transfer functions
— Numerical condition affects the learning speed and accuracy of most artificial neural network learning algorithms. In this paper, we examine the influence of opposite transfe...
Mario Ventresca, Hamid R. Tizhoosh