Yun Chi, Siegfried Nijssen, et al.  Home/Search
Context Related
| neclabs.com/~ychi...ee_review_fi05.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: Mining frequent subtrees from databases of labeled trees is a new research field that has many practical applications in areas such as computer networks, Web mining, bioinformatics, XML document mining, etc. These applications share a requirement for the more expressive power of labeled trees to capture the complex relations among data entities. Although frequent subtree mining is a more difficult task than frequent itemset mining, most existing frequent subtree mining algorithms borrow... (Update)
Cited by: More
Finding Trees From Unordered 0--1 Data - Hannes Heikinheimo Heikki (Correct)
Active bibliography (related documents): More All
6.7: Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (Correct)
3.1: Mining Closed and Maximal Frequent Subtrees from Databases .. - Chi, Xia, Yang, Muntz (Correct)
1.2: Efficiently Mining Frequent Embedded Unordered Trees - Zaki (2005) (Correct)
Similar documents based on text:
1.0: Unknown - (Correct)
BibTeX entry: (Update)
Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining -- an overview. Fundamenta Informaticae 66(1-2) (2005) 161--198 http://citeseer.ist.psu.edu/chi01frequent.html More
@misc{ chi05frequent,
author = "Y. Chi and R. Muntz and S. Nijssen and J. Kok",
title = "Frequent subtree mining -- an overview",
text = "Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining --
an overview. Fundamenta Informaticae 66(1-2) (2005) 161--198",
year = "2005",
url = "citeseer.ist.psu.edu/chi01frequent.html" }
Citations (may not include all citations):4212 Computers and Intractability--A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
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
249 Mining frequent patterns without candidate generation - Han, Pei et al. - 2000 ACM DBLP
157 Mining Sequential Patterns: Generalizations and Performance .. - Srikant, Agrawal - 1996
127 Discovery of Frequent Episodes in Event Sequences - Mannila, Toivonen et al. - 1997 ACM DBLP
112 and sequences: computer science and computational biology (context) - Gusfield - 1997
54 An Apriori-based Algorithm for Mining Frequent Substructures.. - Inokuchi, Washio et al. - 2000 ACM DBLP
52 Frequent Subgraph Discovery - Kuramochi, Karypis - 2001 ACM DBLP
45 gSpan: Graph-Based Substructure Pattern Mining - Yan, Han - 2002 DBLP
35 Modeling the branching characteristics and efficiency gains .. - Chalmers, Almeroth - 2001
32 Tree Matching Problems with Applications to Structured Text .. - Kilpelainen - 1992
24 Fast Vertical Mining Using Diffsets - Zaki - 2003 ACM DBLP
23 An analysis of a good algorithm for the subtree problem (context) - Reyner - 1977 DBLP
23 Discovering Typical Structures of Documents: A Road Map Appr.. - Wang, Liu - 1998 DBLP
20 Efficiently Mining Frequent Trees in a Forest - Zaki - 2002 ACM DBLP
18 CloseGraph: Mining Closed Frequent Graph Patterns (context) - Yan, Han - 2003 DBLP
18 TreeFinder: a First Step towards XML Data Mining (context) - Termier, Rousset et al. - 2002 DBLP
18 Time Algorithm for Subgraph Homeomorphism Problem on Trees (context) - Chung - 1987
17 Indexing and Mining Free Trees - Chi, Yang et al. - 2003
16 Discovering Frequent Substructures in Large Unordered Trees - Asai, Arimura et al. - 2003
15 Efficient Mining of Frequent Subgraph in the Presence of Iso.. - Huan, Wang et al. - 2003
13 Efficient Substructure Discovery from Large Semi-Structured .. - Asai, Abe et al. - 2002
12 ATreeGrep: Approximate Searching in Unordered Trees - Shasha, Wang et al. - 2002 DBLP
11 Faster Subtree Isomorphism - Shamir, Tsur - 1999 ACM DBLP
10 the topology of multicast trees (context) - Chalmers, Almeroth - 2002
10 An Efficient Algorithm for Discovering Frequent Subgraphs - Kuramochi, Karypis - 2002 ACM
10 Aggregated Multicast--A Comparative Study - Cui, Kim et al. - 2002
9 XRules: An Effective Structural Classifier for XML Data - Zaki, Aggarwal - 2003 DBLP
8 Constant Time Generation of Free Trees (context) - Wright, Richmond et al. - 1986 ACM DBLP
8 CMTreeMiner: Mining Both Closed and Maximal Frequent Subtree.. - Chi, Yang et al. - 2004
8 Mining Frequent Rooted Trees and Free Trees Using Canonical .. - Chi, Yang et al.
7 Subtree isomorphism in O (context) - Matula - 1978
7 Graphs and Applications (context) - Aldous, Wilson - 2000
6 Constant Time Generation of Rooted Trees (context) - Beyer, Hedetniemi - 1980 DBLP
6 A Fast Algorithm for Mining Frequent Connected Subgraphs (context) - Inokuchi, Washio et al. - 2002
6 Algorithms on Trees and Graphs (context) - Valiente - 2002 ACM DBLP
6 Efficient Discovery of Frequent Unordered Trees (context) - Nijssen, Kok - 2003
5 A Quickstart in Frequent Structure Mining Can Make a Differe.. (context) - Nijssen, Kok - 2004 ACM
4 Frequent Free Tree Discovery in Graph Data - uckert, Kramer - 2004 ACM DBLP
4 Efficient Data Mining for Maximal Frequent Subtrees (context) - Xiao, Yao et al. - 2003 ACM DBLP
4 Mining Frequent Quer Patterns from XML Queries (context) - Yang, Lee et al. - 2003 ACM DBLP
3 Unordered Tree Mining with Applications to Phylogeny (context) - Shasha, Wang et al. - 2004 ACM
3 Bottom-up Subtree Isomorphism for Unordered Labeled Trees - Luccio, Enriquez et al. - 2004
3 FREQT: An implementation of FREQT (context) - Kudo - 2003
3 Exact Rooted Subtree Matching in Sublinear Time - Luccio, Enriquez et al. - 2001
3 HybridTreeMiner: An Efficient Algorithm for Mining Frequent .. - Chi, Yang et al. - 2004
2 Efficient Generation of Rooted Trees (context) - Nakano, Uno - 2003
2 Mining Closed and Maximal Frequent Subtrees from Databases o.. - Chi, Xia et al. ACM
2 A Simple Constant Time Enumeration Algorithm for Free Trees (context) - Nakano, Uno - 2003
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