Abstract Views :186 |
PDF Views:3
Authors
Affiliations
1 Malla Reddy Institute Of Technology, Hyderabad, Andhra Pradesh, IN
2 Nehru Technology Anantapur, Anantapur, Andhra Pradesh, IN
3 NBKRIT, Vakada, Andhra Pradesh, IN
4 AITAM, Rajam, Andhra Pradesh, IN
Source
Data Mining and Knowledge Engineering, Vol 3, No 2 (2011), Pagination: 115-124
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.
