Journal ArticleDOI
Extracting common subtrees from decision trees
Reads0
Chats0
TLDR
This paper explores an efficient technique for the extraction of common subtrees in decision trees based on a Suffix Tree string matching process and the algorithm is applied to the problem of finding common decision rules in path planning.Abstract:
This paper explores an efficient technique for the extraction of common subtrees in decision trees. The method is based on a Suffix Tree string matching process and the algorithm is applied to the problem of finding common decision rules in path planning.read more
References
More filters
Book
An introduction to parallel algorithms
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Book
Algorithms in C
TL;DR: Algorithms in C is a comprehensive repository of algorithms, complete with code, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms.
Journal ArticleDOI
An improved algorithm for approximate string matching
Zvi Galil,Kunsoo Park +1 more
TL;DR: Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented.
Journal ArticleDOI
Deterministic sampling: a new technique for fast pattern matching
TL;DR: This approach enables the text analysis (stages “search for sample” and “verify”) to be performed in $O(\log ^ * n) time and optimal spe...
Journal ArticleDOI
An optimal O (log n )time parallel string matching algorithm
Dany Breslauer,Zvi Galil +1 more
TL;DR: An optimal $O(\log \log n)$ time parallel algorithm for string matching on CROW-PRAM is presented and improves previous results of Galil and Vishkin.