Sciweavers

47 search results - page 3 / 10
» Learning Transformation Rules to Find Grammatical Relations
Sort
View
JDWM
2007
122views more  JDWM 2007»
13 years 5 months ago
A Hyper-Heuristic for Descriptive Rule Induction
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable...
Tho Hoan Pham, Tu Bao Ho
CIARP
2009
Springer
14 years 7 days ago
Learning Relational Grammars from Sequences of Actions
Many tasks can be described by sequences of actions that normally exhibit some form of structure and that can be represented by a grammar. This paper introduces FOSeq, an algorithm...
Blanca Vargas-Govea, Eduardo F. Morales
ICML
2003
IEEE
14 years 6 months ago
An Analysis of Rule Evaluation Metrics
In this paper we analyze the most popular evaluation metrics for separate-and-conquer rule learning algorithms. Our results show that all commonly used heuristics, including accur...
Johannes Fürnkranz, Peter A. Flach
AAAI
1992
13 years 6 months ago
Learning to Disambiguate Relative Pronouns
In this paper we show how a natural language system can learn to find the antecedents of relative pronouns. We use a well-known conceptual clustering system to create a case-based...
Claire Cardie
IJCAI
2007
13 years 7 months ago
Some Effects of a Reduced Relational Vocabulary on the Whodunit Problem
A key issue in artificial intelligence lies in finding the amount of input detail needed to do successful learning. Too much detail causes overhead and makes learning prone to ove...
Daniel T. Halstead, Kenneth D. Forbus