Sciweavers

143 search results - page 18 / 29
» On Using Machine Learning for Logic BIST
Sort
View
MLDM
2009
Springer
14 years 2 months ago
Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization
A number of two-class classification methods first discretize each attribute of two given training sets and then construct a propositional DNF formula that evaluates to True for ...
Klaus Truemper
ISMB
1993
13 years 8 months ago
Representation for Discovery of Protein Motifs
There are several dimensions and levels of complexity in which information on protein motifs may be available. For example, onedimensional sequence motifs may be associated with s...
Darrell Conklin, Suzanne Fortier, Janice I. Glasgo...
ML
2006
ACM
13 years 7 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
ICML
2009
IEEE
14 years 8 months ago
Compositional noisy-logical learning
We describe a new method for learning the conditional probability distribution of a binary-valued variable from labelled training examples. Our proposed Compositional Noisy-Logica...
Alan L. Yuille, Songfeng Zheng
ICML
2008
IEEE
14 years 8 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka