PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees
Kutty, Sangeetha, Nayak, Richi, & Li, Yuefeng (2007) PCITMiner- Prefix-based Closed Induced Tree Miner for finding closed induced frequent subtrees. In Christen, P., Kennedy, P. J., Li, J., Kolyshkina, I., & Williams, G. J. (Eds.) Sixth Australasian Data Mining Conference (AusDM 2007), 3-4 December 2007, Gold Coast.
Frequent subtree mining has attracted a great deal of interest among the researchers due to its application in a wide variety of domains. Some of the domains include bio informatics, XML processing, computational linguistics, and web usage mining. Despite the advances in frequent subtree mining, mining for the entire frequent subtrees is infeasible due to the combinatorial explosion of the frequent subtrees with the size of the datasets. In order to provide a reduced and concise representation without information loss, we propose a novel algorithm, PCITMiner (Prefix-based Closed Induced Tree Miner). PCITMiner adopts the prefix-based pattern growth strategy to provide the closed induced frequent subtrees efficiently. The empirical analysis reveals that our algorithm significantly outperforms the current state of the art algorithm, PrefixTreeISpan.
Impact and interest:
Citation counts are sourced monthly from and 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 theindexing service can be viewed at the linked Google Scholar™ search.
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.
|Item Type:||Conference Paper|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > LIBRARY AND INFORMATION STUDIES (080700) > Information Retrieval and Web Search (080704)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2007 Australian Computer Society|
|Copyright Statement:||Copyright © 2007, Australian Computer Society, Inc. This
paper appeared at the Sixth Australasian Data Mining
Conference (AusDM 2007), Gold Coast, Australia.
Conferences in Research and Practice in Information
Technology (CRPIT), Vol. 70. Peter Christen, Paul Kennedy,
Jiuyong Li, Inna Kolyshkina and Graham Williams, Ed.
Reproduction for academic, not-for profit purposes permitted provided this text is included.
|Deposited On:||04 Aug 2008 00:00|
|Last Modified:||29 Feb 2012 13:35|
Repository Staff Only: item control page