𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A scalable algorithm for mining maximal frequent sequences using a sample

✍ Scribed by Congnan Luo; Soon M. Chung

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
582 KB
Volume
15
Category
Article
ISSN
0219-1377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for mining frequent ord
A fast algorithm for mining frequent ordered subtrees
✍ Shohei Hido; Hiroyuki Kawano πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 653 KB

## Abstract In this research, the authors took up the problem of discovering frequent ordered subtree patterns in tree structured data sets, which is of note in the actively researched area of frequent partial structure mining for semistructured data. With conventional algorithms, nonredundant freq