Sciweavers

477 search results - page 27 / 96
» Rule Combination in Inductive Learning
Sort
View
IDA
2005
Springer
15 years 3 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
IDA
2003
Springer
15 years 2 months ago
Constructing Hierarchical Rule Systems
Rule systems have failed to attract much interest in large data analysis problems because they tend to be too simplistic to be useful or consist of too many rules for human interpr...
Thomas R. Gabriel, Michael R. Berthold
85
Voted
ACL
2008
14 years 11 months ago
An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming
The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present ...
Xiaofeng Yang, Jian Su, Jun Lang, Chew Lim Tan, Ti...
RSEISP
2007
Springer
15 years 3 months ago
Generalizing Data in Natural Language
This paper concerns the development of a new direction in machine learning, called natural induction, which requires from computergenerated knowledge not only to have high predicti...
Ryszard S. Michalski, Janusz Wojtusiak
ECCC
2008
117views more  ECCC 2008»
14 years 9 months ago
The complexity of learning SUBSEQ(A)
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
Stephen A. Fenner, William I. Gasarch, Brian Posto...