IMine index support for frequent item set mining
Active In SP
Joined: Feb 2011
09-02-2011, 01:08 PM
i am Rupa devi pursuing b-tech final year (IT branch) from a JNTU affliated college and i would request you to post or mail the document related to the project and implimentation title as mentioned.
and my problem regarding this project and implimentation is that i am not able to understand the algorithm present in it and how i need to implement it.I know java programming language and i am doing my project and implimentation haf way through .
so please post the related information about it .
Abstract :This paper presents the IMine index, a general and compact structure which provides tight integration of itemset extraction in a relational DBMS. Since no constraint is enforced during the index creation phase, IMine provides a complete representation of the original database. To reduce the I/O cost, data accessed together during the same extraction phase are clustered on the same disk block. The IMine index structure can be efficiently exploited by different itemset extraction algorithms. In particular, IMine data access methods currently support the FP-growth and LCM v.2 algorithms, but they can straightforwardly support the enforcement of various constraint categories. The IMine index has been integrated into the PostgreSQL DBMS and exploits its physical level access methods. Experiments, run for both sparse and dense data distributions, show the efficiency of the proposed index and its linear scalability also for large datasets. Itemset mining supported by the IMine index shows performance always comparable with, and sometimes better than, state of the art algorithms accessing data on flat file.