Open Access Open Access  Restricted Access Subscription or Fee Access

A New Approach to Discover Frequent Patterns Using FP-Graph Model

B. Jayanthi, Dr.K. Duraiswamy


In this paper an algorithm is proposed for mining frequent itemsets. This paper proposes a new framework to generate frequent Itemsets/Patterns. First, a partitioning technique is used to divide a transaction database TDB into n non-overlapping partitions. Second we use fp-graph model to discover frequent itemsets for each partition. Example illustrating the proposed approach is given. The characteristics of the algorithm are discussed.


Data Mining, Frequent Patterns, Frequent Itemset, Partitioning Technique, FP-Graph, Association Rule

Full Text:



Agrawal R,Imienlinski T,Swami A,(1993).Mining association rules between sets of items in large databases. In Proc. Of the ACM SIGMOD Int. Conf. on Management of Data, Pages 207-216.

Agrawal R, and Srikant R,(1994). Fast algorithms for mining association rules. In Proc. Of the 20th Int. Conf. on very Large Databases.pages 487-499.

Bayardo R.J.,(1998)Efficiently mining long patterns from databases.In Proc. Of the Int. ACM SIGMOD Conf., pages 85-93.

Burdick .D,Calimlim, and Gehrke .J,(2001) Mafia: A maximal frequent itemset algorithm for transactional databases. In Proc. Of the 17 th Int. Conf. on Data Engineering.

Dong. G, Li .J,(1999) Efficient mining of Emerging Patterns : Discovering Trends and Differences. Knowledge Discovery and Data Mining, pages 43-52.

Han .J,Pei .J, and Yin .Y,(2000) Mining Frequent patterns without Li .J, candidate generation. In Proc. Of ACM-SIGMOD Int. Conf. on Management of Data, pages 1-12.

Ramamohanarao .K, Dong .G,(2000) Emerging patterns and Classification. In Proc. Of the 6th Asian Computing Science Conf. on Advances in Computing Science, Pages 15-32.

Maqbool .F,Bashir .S, Baig >A.R.,(2006) E-MAP: Efficiently mining asynchronous periodic Patterns. Int.J. of Comp.Sc. and Net. Sceurity 6(8A), pages, 174-179.

Tan .P,Kumar .V, and Srivastava .J,(2000) Indirect association: mining higher order dependencies in data. In Proc. Of the 4th European Conf. on Principles and Practice of Knowledge Discovery in Databases, pages 632-637.

Tatavarty .G, Bhatnagar .R, young .B,(2007) Discovery of Temporal Dependencies between Frequent patterns in Multivariate Time Series In. The 2007 IEEE Symposium on Computational Intelligence and Data Mining, pages,688-696.

Yi-Jun Wang, Wei-Qing sun, Jin-tao She, Sheng-Biao Wei, Cheng-Min wang, Frequent pattern network Mining algorithm Based on Transaction –Item association Matrix. In Proc.of the 13th WSEAS International conference on Computers, Pages 498 – 501.

Zaki .m .J, Hsiao.C,(2000) Charm: An Zaki .m .J, Hsiao.C,(2000) Charm: An efficient algorithm for closed itemset mining. In Proc. Of the 2nd SIAM Int. conf. on Data mining.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.