Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Patricia-Trie Approach for Incremental Mining of Frequent Itemsets on Indexed Data Blocks


Affiliations
1 Malla Reddy Institute Of Technology, Hyderabad, Andhra Pradesh, India
2 Nehru Technology Anantapur, Anantapur, Andhra Pradesh, India
3 NBKRIT, Vakada, Andhra Pradesh, India
4 AITAM, Rajam, Andhra Pradesh, India
     

   Subscribe/Renew Journal


Patricia-Trie based I-Forest index is a novel index structure that supports efficient item set mining into a relational DBMS. The The Patricia-Trie based I-Forest index provides a complete and compact representation of transactional data. It is a general structure that efficiently supports different algorithmic approaches to item set extraction. Selective access of the physical index blocks significantly reduces the I/O costs and efficiently exploits DBMS buffer management strategies. This approach, albeit implemented into a relational DBMS, yields performance better than the state-of-the-art algorithms accessing data on a flat file and is characterized by a linear scalability also for large data sets.

Keywords

Datamining, Frequent Itemsets, Patricis-Trie, XML, I ndex fabric, Sparse Datasets.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 285

PDF Views: 3




  • A Patricia-Trie Approach for Incremental Mining of Frequent Itemsets on Indexed Data Blocks

Abstract Views: 285  |  PDF Views: 3

Authors

K. Naresh Babu
Malla Reddy Institute Of Technology, Hyderabad, Andhra Pradesh, India
K. F. Bharati
Nehru Technology Anantapur, Anantapur, Andhra Pradesh, India
P. Nagendra
NBKRIT, Vakada, Andhra Pradesh, India
T. Chalapathi Rao
AITAM, Rajam, Andhra Pradesh, India

Abstract


Patricia-Trie based I-Forest index is a novel index structure that supports efficient item set mining into a relational DBMS. The The Patricia-Trie based I-Forest index provides a complete and compact representation of transactional data. It is a general structure that efficiently supports different algorithmic approaches to item set extraction. Selective access of the physical index blocks significantly reduces the I/O costs and efficiently exploits DBMS buffer management strategies. This approach, albeit implemented into a relational DBMS, yields performance better than the state-of-the-art algorithms accessing data on a flat file and is characterized by a linear scalability also for large data sets.

Keywords


Datamining, Frequent Itemsets, Patricis-Trie, XML, I ndex fabric, Sparse Datasets.