Sciweavers

589 search results - page 18 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
KDD
1994
ACM
116views Data Mining» more  KDD 1994»
15 years 1 months ago
Exception Dags as Knowledge Structures
: The problem of transforming the knowledge bases of performance systems using induced rules or decision trees into comprehensible knowledgestructures is addressed. A knowledgestru...
Brian R. Gaines
ADC
2003
Springer
139views Database» more  ADC 2003»
15 years 2 months ago
Deriving Relation Keys from XML Keys
Much work on XML data was around storage and querying and did not consider constraints of XML, especially keys. Since constraints have been proposed in many papers for XML, much r...
Qing Wang, Hongwei Wu, Jianchang Xiao, Aoying Zhou...
ICPR
2002
IEEE
15 years 10 months ago
The Combining Classifier: To Train or Not to Train?
When more than a single classifier has been trained for the same recognition problem the question arises how this set of classifiers may be combined into a final decision rule. Se...
Robert P. W. Duin
75
Voted
EMNLP
2008
14 years 11 months ago
Forest-based Translation Rule Extraction
Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of ...
Haitao Mi, Liang Huang
CORR
1998
Springer
113views Education» more  CORR 1998»
14 years 9 months ago
Letter to Sound Rules for Accented Lexicon Compression
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
V. Pagel, Kevin Lenzo, Alan W. Black