Searching for "Indexing and Mining Free Trees." – sorted by Relevance.
-
Indexing and Mining Free Trees
- . We then apply our tree indexing technique to the frequent subtree mining problem and present FreeTree
- Add To MetaCart
-
Indexing and Mining Free Trees
- UCLA Computer Science Department Technical Report #030041 1 Indexing and Mining Free Trees Yun Chi
- Cited by 27 (7 self) – Add To MetaCart
-
Mining closed and maximal frequent subtrees from databases of labeled rooted trees
- frequent subtrees. Index Terms—Trees, graph algorithms, data mining, mining methods and algorithms
- Cited by 16 (1 self) – Add To MetaCart
-
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
- of indexing and mining free trees and developed an Apriori-like algorithm, FreeTreeMiner, to mine all frequent
- Cited by 11 (3 self) – Add To MetaCart
-
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
- structural classifier for XML data. In [5], Chi et al. have studied the problem of indexing and mining free
- Add To MetaCart
-
Mining Frequent Rooted Trees and Free Trees Using Canonical Forms
- orders of magnitudes compared to known algorithms for mining frequent free trees. 1 Introduction. Graphs
- Cited by 7 (3 self) – Add To MetaCart

