Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases

I
ICDMW
2006
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Abstract - Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Tomonobu Ozaki Articles by Takenao Ohkawa

Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)

Hong Kong, China

December 18-December 22

ISBN: 0-7695-2702-7

	ASCII Text	x
	Tomonobu Ozaki, Takenao Ohkawa, "Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases," Data Mining Workshops, International Conference on, pp. 279-283, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006.

	BibTex	x
	@article{ 10.1109/ICDMW.2006.67, author = {Tomonobu Ozaki and Takenao Ohkawa}, title = {Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases}, journal ={Data Mining Workshops, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2702-7}, pages = {279-283}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.67}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining Workshops, International Conference on TI - Efficient Mining of Closed Induced Ordered Subtrees in Tree-structured Databases SN - 0-7695-2702-7 SP279 EP283 A1 - Tomonobu Ozaki, A1 - Takenao Ohkawa, PY - 2006 KW - null VL - 0 JA - Data Mining Workshops, International Conference on ER -

Tomonobu Ozaki, Kobe University

Takenao Ohkawa, Kobe University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.67

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.