loading...
Mining Closed and Maximal Frequent Induced Free Subtrees
Hong Kong, China December 18-December 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.111Sixth IEEE International Conference o ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Hitohiro Shiozaki, Tomonobu Ozaki, Takenao Ohkawa, "Mining Closed and Maximal Frequent Induced Free Subtrees," Data Mining Workshops, International Conference on, pp. 14-18, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICDMW.2006.111,
author = {Hitohiro Shiozaki and Tomonobu Ozaki and Takenao Ohkawa},
title = {Mining Closed and Maximal Frequent Induced Free Subtrees},
journal ={Data Mining Workshops, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2702-7},
pages = {14-18},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.111},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Mining Workshops, International Conference on
TI - Mining Closed and Maximal Frequent Induced Free Subtrees
SN - 0-7695-2702-7
SP14
EP18
A1 - Hitohiro Shiozaki,
A1 - Tomonobu Ozaki,
A1 - Takenao Ohkawa,
PY - 2006
KW - null
VL - 0
JA - Data Mining Workshops, International Conference on
ER -
 
Hitohiro Shiozaki, Kobe University
Tomonobu Ozaki, Kobe University
Takenao Ohkawa, Kobe University
Mining frequent tree patterns is an important problem, since tree structures are used in various fields such as computational biology, XML databases, and so on. However, mining all frequent subtrees is sometimes infeasible because of the combinatorial explosion. In this paper, by combining an efficient algorithm for enumerating free trees and the pruning techniques for mining closed and maximal rooted trees, we present an efficient algorithm named CMFree- TreeMiner that discovers only closed and maximal frequent induced free subtrees in a database of labeled free trees. Experimental results show the effectiveness of the proposed algorithm.
Citation:
Hitohiro Shiozaki, Tomonobu Ozaki, Takenao Ohkawa, "Mining Closed and Maximal Frequent Induced Free Subtrees," icdmw, pp.14-18, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions