Partition-based sorted pre-fix tree construction using global list to mine maximal patterns with incremental and interactive mining Online publication date: Sat, 13-Sep-2014
by R. Vishnu Priya; A. Vadivel
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 2, No. 2/3, 2012
Abstract: Maximal pattern mining in highly dynamic transactional database is difficult task since both discarded and updated contents are used together by changing the threshold. This essence has spurred the researchers to develop algorithm to support both incremental and interactive mining, which do not identify the pattern again and again for a corresponding update in the database. In this paper, a partition-based sorted prefix-tree (PSP-tree) is proposed and is constructed in two phases with single scan. Initially, the sub trees are built along with its item lists and are merged to obtain the global sorted item list. Later, each node of the sub trees is dynamically rearranged based on the sorted list and merged to form the proposed tree to support incremental and interactive mining. Performance of PSP-tree is encouraging especially for sparse database and the patterns are mined very fast compared to recent similar approach.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook