Title: To see the wood for the trees: Mining frequent tree patterns
Authors: Bringmann, Bj√∂rn # ×
Issue Date: 2004
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3848 pages:38-63
Abstract: Various definitions and frameworks for discovering frequent trees in forests have been developed recently. At the heart of these frameworks lies the notion of matching, which determines if a pattern tree matches a tree in a data set. We compare four notions of tree matching for use in frequent tree mining and show how they are related to each other. Furthermore, we show how Zaki's TreeMinerV algorithm can be adapted to employ three of the four notions of tree matching. Experiments on synthetic and real world data highlight the differences between the matchings.
ISBN: 3-540-31331-1
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
chp%3A10.1007%2F11615576_3.pdf Published 1374KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science