Canonical Forms for Labeled Trees and Their Applications in Frequent Subtree...  Home/Search
Context
Related
| neclabs.com/~ychi...nonical_kais05.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: neclabs.com/~ychi/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. In this paper, we first present two canonical forms for labeled rooted unordered trees--the breadth-first canonical form (BFCF) and the depth-first canonical form (DFCF). Then the canonical forms are applied to the frequent subtree mining problem. Based on the BFCF, we develop a vertical mining algorithm, RootedTreeMiner, to discover all frequently... (Update)
Active bibliography (related documents): More All
0.6: Mining Closed and Maximal Frequent Subtrees from Databases .. - Chi, Xia, Yang, Muntz (2004) (Correct)
0.4: Finding Trees From Unordered 0--1 Data - Hannes Heikinheimo Heikki (Correct)
0.4: Mining Frequent Rooted Trees and Free Trees Using Canonical.. - Chi, Yang, Muntz (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ for-accepted,
author = "Canonical Forms For",
title = "Accepted for publication in Knowledge and Information Systems",
url = "citeseer.ist.psu.edu/764269.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994 ACM
63 A tree projection algorithm for generation of frequent item .. - Agarwal, Aggarwal et al. - 2001 ACM DBLP
53 ciently mining long patterns from databases (context) - Jr - 1998
35 Counting twig matches in a tree - Chen, Jagadish et al. - 2001 ACM DBLP
17 Indexing and mining free trees - Chi, Yang et al. - 2003 ACM DBLP
16 Discovering frequent substructures in large unordered trees - Asai, Arimura et al. - 2003 DBLP
13 cient substructure discovery from large semi-structured data (context) - Asai, Abe et al. - 2002
8 CMTreeMiner: Mining both closed and maximal frequent subtree.. - Chi, Yang et al. - 2004
7 Graphs and Applications (context) - Aldous, Wilson - 2000
6 Alogtime algorithms for tree isomorphism (context) - Buss - 1997
3 cient algorithm for mining frequent rooted trees and free tr.. (context) - Chi, Yang et al. - 2004
Documents on the same site (http://www.nec-labs.com/~ychi/index.html): More
HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) (Correct)
Indexing and Mining Free Trees - Yun Chi Yirong (Correct)
Loadstar: A Load Shedding Scheme for Classifying Data Streams - Yun Chi Philip (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