MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Correction to "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees"." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

721,810 documents found, showing 1 through 10. Next 10 →

ATOM

Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
by Yun Chi Student, Yun Chi, Student Member, Yi Xia, Yirong Yang, Richard R. Muntz — 2005 — IEEE Transactions on Knowledge and Data Engineering
… subtrees. CHI ET AL.: MINING CLOSED AND MAXIMAL FREQUENT SUBTREES FROM DATABASES OF LABELED ROOTED TREES 3…
Add To MetaCart

Mining closed and maximal frequent subtrees from databases of labeled rooted trees
by Yun Chi, Student Member, Yi Xia, Yirong Yang, Richard R. Muntz — 2005 — IEEE Transactions on Knowledge and Data Engineering
… for mining closed and maximal frequent subtrees from databases of labeled rooted ordered trees. In Section 4…
Cited by 16 (1 self) – Add To MetaCart

CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
by Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz — 2003 — In The Eighth Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD’04
…Miner algorithm that mines both closed and maximal frequent subtrees from a database of labeled rooted unordered…
Cited by 11 (3 self) – Add To MetaCart

Frequent Subtree Mining - An Overview
by Yun Chi, Richard Muntz, Siegfried Nijssen, Joost Kok — 2005
…, Leiden, The Netherlands joost@(email omitted); Abstract. Mining frequent subtrees from databases of labeled trees…
Cited by 16 (0 self) – Add To MetaCart

Canonical Forms for Labeled Trees and Their Applications in Frequent Subtree Mining
by Yun Chi, Yirong Yang, Richard R. Muntz — 2004
…, FreeTreeMiner, for mining frequent subtrees in a database of labeled free trees. This algorithm…
Cited by 7 (0 self) – Add To MetaCart

Mining Adaptively Frequent Closed Unlabeled Rooted Trees in Data Streams
by Albert Bifet, Ricard Gavaldà, Departament De Llenguatges I Sistemes
…Mining Adaptively Frequent Closed Unlabeled Rooted Trees in Data Streams Albert Bifet Ricard…
Add To MetaCart

Approximate labelled subtree homeomorphism
by Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-ukelson — 2004 — In Proceedings of 15th Annual Symposium of Combinatorial Pattern Matching
… and T , respectively. We also give an O(mn) algorithm for rooted ordered trees. 1 Introduction The matching of labelled…
Cited by 8 (1 self) – Add To MetaCart

Mining Frequent Rooted Trees and Free Trees Using Canonical Forms
by Yun Chi, Yirong Yang, Richard R. Muntz — 2003
… subtrees in a database of rooted unordered trees. The algorithm mines frequent subtrees by traversing…
Cited by 7 (3 self) – Add To MetaCart

Discovering Frequent Agreement Subtrees from Phylogenetic Data
by Sen Zhang, Jason T. L. Wang
… tree mining algorithm, called Phylominer [36], to find all frequent agreement subtrees (FASTs) from a…
Add To MetaCart

Efficiently mining maximal frequent itemsets
by Karam Gouda, Mohammed J. Zaki — 2001 — In ICDM
…, there has been recent interest in mining maximal frequent patterns in these ”hard” dense databases. Another…
Cited by 92 (10 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB