Sciweavers

463 search results - page 67 / 93
» Induction in Noisy Domains
Sort
View
ICML
2004
IEEE
16 years 18 days ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
ICML
2002
IEEE
16 years 18 days ago
Adaptive View Validation: A First Step Towards Automatic View Detection
Multi-view algorithms reduce the amount of required training data by partitioning the domain features into separate subsets or views that are sufficient to learn the target concep...
Ion Muslea, Steven Minton, Craig A. Knoblock
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 6 days ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
EPIA
2009
Springer
15 years 6 months ago
An ILP System for Learning Head Output Connected Predicates
Inductive Logic Programming (ILP) [1] systems are general purpose learners that have had significant success on solving a number of relational problems, particularly from the biol...
José Carlos Almeida Santos, Alireza Tamaddo...
FMCAD
2009
Springer
15 years 6 months ago
Scalable conditional equivalence checking: An automated invariant-generation based approach
—Sequential equivalence checking (SEC) technologies, capable of demonstrating the behavioral equivalence of two designs, have grown dramatically in capacity over the past decades...
Jason Baumgartner, Hari Mony, Michael L. Case, Jun...