Sciweavers

1890 search results - page 95 / 378
» Graph-Based Concept Learning
Sort
View
ALT
2005
Springer
16 years 24 days ago
Teaching Learners with Restricted Mind Changes
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses...
Frank J. Balbach, Thomas Zeugmann
RECSYS
2009
ACM
15 years 10 months ago
Preference elicitation with subjective features
Utility or preference elicitation is a critical component in many recommender and decision support systems. However, most frameworks for elicitation assume a predefined set of fe...
Craig Boutilier, Kevin Regan, Paolo Viappiani
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 8 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ICML
1989
IEEE
15 years 8 months ago
Constructive Induction by Analogy
The available concept-learners only partially fulfill the needs imposed by the learning apprentice generation of learners. We present a novel approach to interactive concept-learni...
Luc De Raedt, Maurice Bruynooghe
ICML
1998
IEEE
15 years 7 months ago
The Problem with Noise and Small Disjuncts
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
Gary M. Weiss, Haym Hirsh