loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases
Hong Kong, China
December 18-December 22
ISBN: 0-7695-2702-7
Tomonobu Ozaki, Kobe University
Takenao Ohkawa, Kobe University
In this paper, two new closed ordered subtree miners are given which are based on the breadth-first and depth-first/breadth-first enumeration strategy, respectively. Through the experiments with synthesized and real world data, we discuss the effects of the difference of the search strategies in mining closed induced ordered subtrees.
Citation:
Tomonobu Ozaki, Takenao Ohkawa, "Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases," icdmw, pp.279-283, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.