A large experiment on combining classifiers is reported and discussed. It includes, both, the combination of different classifiers on the same feature set and the combination of classifiers on different feature sets. Various fixed and trained combining rules are used. It is shown that there is no overall winning combining rule and that bad classifiers as well as bad feature sets may contain val...

Data fusion under the belief function framework has attracted the interest of many researchers over the past few years. Until now, many combination rules have been proposed in order to aggregate beliefs induced form dependent or independent information sources. Although the choice of the most appropriate rule among several alternatives is crucial, it still requires non-trivial effort. In this i...

Classifier fusion may generate more accurate classification than each of the basic classifiers. Fusion is often based on fixed combination rules like the product, average etc. This paper presents decision templates as classifier fusion method for the recognition of the handwritten English and Farsi numerals (1-9). The process involves extracting a feature vector on well-known image databases. T...

By merging syntactic categories of word classes, lexical categories were obtained. By demonstrating combination and type raising rules respectively from curried and uncurried perspectives, a category combination algorithm was presented, in which application, composition and type raising rules were sequentially examined, and the first available rule was selected. A Chinese CCG parser was develop...

Various rules can be generated from databases by using association rule algorithms, but only a small number of these rules may be selected for implementation due to the limitations of resources. Accordingly, evaluating the quality of these rules becomes a hot topic in the data mining field. Based on multiple criteria decision theory, a framework for evaluating the mined association rules using ...

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a class of continuous real-time models of reactive systems for which efficient model-checking algorithms have been devised. In this paper, we show that these algorithms can very easily be prototyped in the ELAN system. This...

A data-driven rule is a rule that is activated as a result of modiications of data items in a database. Data-driven rules become very useful in applications that use a combination of rules and DBMS technologies. This paper presents the considerations in choosing an adequate programming style for representing data-driven rules based on software engineering aspects, namely, ease of use in a high-...

Reduplication, the remaining problem in computational morphology is a morphological process that involves copying the base form wholly or partially. Reduplication can also be classified as either bounded or unbounded reduplication. Some solutions have been proposed for bounded reduplication. Some of the proposed solutions use ordered replace rules while others use simultaneous two-level rules. ...