๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories

โœ Scribed by Christophe Ringeissen

Book ID
112252229
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1016 KB
Volume
126
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Unification in the Union of Disjoint Equ
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
โœ FRANZ BAADER; KLAUS U. SCHULZ ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 756 KB

Most of the work on the combination of unification algorithms for the union of disjoint equational theories has been restricted to algorithms that compute finite complete sets of unifiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms

An evolutionary algorithm for constructi
An evolutionary algorithm for constructing a decision forest: Combining the classification of disjoints decision trees
โœ Lior Rokach ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 232 KB

Decision forest is an ensemble classification method that combines multiple decision trees to in a manner that results in more accurate classifications. By combining multiple heterogeneous decision trees, decision forest is effective in mitigating noise that is often prevalent in real-world classifi