2916 search results - page 103 / 584 » Generating Rule Sets from Model Trees |
186
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
171
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
We characterise a computational model for processing annotated parse trees. The model is basically rewriting-based with specific provisions for dealing with annotations along the...
194
click to vote
DEXAW
2010
IEEE
15 years 7 months ago
2010
IEEE
Automatic generation of taxonomies can be useful for a wide area of applications. In our application scenario a topical hierarchy should be constructed reasonably fast from a large...
140
click to vote
ACL
2007
15 years 7 months ago
2007
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored ...
198
click to vote
NIPS
2003
15 years 7 months ago
2003
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...