FreeS: A fast algorithm to discover frequent free subtrees using a novel canonical form

Chowdhury, Israt J. & Nayak, Richi (2015) FreeS: A fast algorithm to discover frequent free subtrees using a novel canonical form. In Wang, Jianyong & Cellary, Wojciech (Eds.) Web Information Systems Engineering – WISE 2015, Springer, Miami, FL, pp. 123-137.

View at publisher


Web data can often be represented in free tree form; however, free tree mining methods seldom exist. In this paper, a computationally fast algorithm FreeS is presented to discover all frequently occurring free subtrees in a database of labelled free trees. FreeS is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises the enumeration approach based on a tree-structure guided scheme. This paper presents lemmas that introduce conditions to conform the generation of free tree candidates during enumeration. Empirical study using both real and synthetic datasets shows that FreeS is scalable and significantly outperforms (i.e. few orders of magnitude faster than) the state-of-the-art frequent free tree mining algorithms, HybridTreeMiner and FreeTreeMiner.

Impact and interest:

0 citations in Scopus
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

16 since deposited on 18 Feb 2016
16 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 93069
Item Type: Conference Paper
Refereed: Yes
Keywords: Web data, Free tree, Canonical form, Enumeration approach, Graph mining
DOI: 10.1007/978-3-319-26190-4_9
ISBN: 9783319261904
ISSN: 1611-3349
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: 2015 Springer International Publishing Switzerland
Deposited On: 18 Feb 2016 05:42
Last Modified: 22 Feb 2016 16:00

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page