| Alternate document: Details Efficiently Mining Frequent Embedded Unordered Trees (05) Mohammed J. Zaki |
Mohammed J. Zaki  Home/Search
Context
Related
| rpi.edu/~zaki/./PS/TKDE05b.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/~zaki/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Mining frequent trees is very useful in domains like bioinformatics, Web mining, mining semistructured data, etc. We formulate the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees. We present TREEMINER,a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list. We contrast TREEMINER with a pattern matching tree mining algorithm (PATTERNMATCHER), and we also compare it with TREEMINERD, which counts only... (Update)
Similar documents (at the sentence level):
38.4%: Efficiently Mining Frequent Trees in a Forest - Zaki (2002) (Correct)
5.8%: Efficiently Mining Frequent Embedded Unordered Trees - Zaki (2005) (Correct)
Active bibliography (related documents): More All
0.5: A New Distance for High Level RNA - Secondary Structure Comparison (Correct)
0.1: Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (Correct)
0.1: HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) (Correct)
Similar documents based on text:
5.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ zaki-efficiently,
author = "Mohammed J. Zaki",
title = "Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications",
url = "citeseer.ist.psu.edu/zaki05efficiently.html" }
Citations (may not include all citations):400 Fast Discovery of Association Rules (context) - Agrawal, Mannila et al. - 1996
340 Mining Sequential Patterns - Agrawal, Srikant - 1995
35 Counting Twig Matches in a Tree - Chen, Jagadish et al. - 2001
30 Compact Labeling Schemes for Ancestor Queries (context) - Abiteboul, Kaplan et al. - 2001
17 Tree Pattern Matching and Subset Matching in Deterministic o.. - Cole, Hariharan et al.
17 Indexing and Mining Free Trees - Chi, Yang et al. - 2003
16 Discovering Frequent Substructures in Large Unordered Trees - Asai, Arimura et al. - 2003
13 Efficient Substructure Discovery from Large SemiStructured D.. - Asai, Abe et al. - 2002
2 The Ribonuclease P Database - Brown - 1999
2 Regular Path Expressions with Constraints (context) - Abiteboul, Vianu - 1997
2 HybridTreeMiner: An Efficient Algorihtm for Mining Frequent .. (context) - Chi, Yang et al. - 2004
Documents on the same site (http://www.cs.rpi.edu/~zaki/papers.html): More
Parallel Classification for Data Mining on Shared-Memory.. - Zaki (1998) (Correct)
Efficient Enumeration of Frequent Sequences - Zaki (1998) (Correct)
PlanMine: Predicting Plan Failures using Sequence Mining - Zaki, Lesh, Ogihara (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC