Sciweavers

1400 search results - page 148 / 280
» Post-Analysis of Learned Rules
Sort
View
PPSN
2004
Springer
15 years 10 months ago
Learning Probabilistic Tree Grammars for Genetic Programming
Genetic Programming (GP) provides evolutionary methods for problems with tree representations. A recent development in Genetic Algorithms (GAs) has led to principled algorithms cal...
Peter A. N. Bosman, Edwin D. de Jong
COOPIS
2003
IEEE
15 years 10 months ago
Mining for Lexons: Applying Unsupervised Learning Methods to Create Ontology Bases
Ontologies in current computer science parlance are computer based resources that represent agreed domain semantics. This paper first introduces ontologies in general and subseque...
Marie-Laure Reinberger, Peter Spyns, Walter Daelem...
CSCLP
2003
Springer
15 years 10 months ago
Learning Approximate Consistencies
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107 Stefano Bi...
Arnaud Lallouet, Andrei Legtchenko, Thi-Bich-Hanh ...
EMNLP
2006
15 years 6 months ago
Learning Information Status of Discourse Entities
In this paper we address the issue of automatically assigning information status to discourse entities. Using an annotated corpus of conversational English and exploiting morpho-s...
Malvina Nissim
JAIR
2006
106views more  JAIR 2006»
15 years 4 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...