73 search results - page 4 / 15 » Learning Efficient Rules by Maintaining the Explanation Stru... |
190
click to vote
CIAC
1994
Springer
15 years 9 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
146
click to vote
ACL
2001
15 years 6 months ago
2001
Named entity (NE) recognition is a task in which proper nouns and numerical information in a document are detected and classified into categories such as person, organization, loc...
170
click to vote
IDA
2006
Springer
15 years 5 months ago
2006
Springer
Exploring the vast number of possible feature interactions in domains such as gene expression microarray data is an onerous task. We describe Backward-Chaining Rule Induction (BCR...
163
click to vote
DAGSTUHL
1990
15 years 6 months ago
1990
One of the principal advantages of parallelizing a rule-based system, or more generally, any A.I. system, is the ability to pursue alternate search paths concurrently. Conventiona...
169
click to vote
AAAI
1996
15 years 6 months ago
1996
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...