### An Efficient Algorithm for Mining Frequent K-Item Sets for Association Rule Mining in Large Databases

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

Agarwal, R., and Srikant R., 1994, “Fast algorithms for mining association rules,” Proc. 20th VLDB, Santiago, Chile.

R. Agrawal and R. Srikant, “Mining Sequential Patterns,” Proc. 1995 Int‟l Conf. Data Eng. (ICDE ‟95), pp. 3-14, Mar. 1995.

Sarasere, A., Omiecinsky, E., and Navathe, S., 1995. “An efficient Algorithm for Mining Association Rules in Large Databases”, Proc. 21st VLDB cconference, Swizerland..

Mannila, H., Toivonen, H. and Verkamo, A., 1994, “Improved methods for finding association rules,” Proc. AAAI Workshop Knowledge Discovery.

Transactions on Knowledge and Data Engineering. Chao Li, Z., Lian He, P., and Lei, M, 2005 “ A High Efficient AprioriTID algorithm for mining association rule”, Proc. Fourth International Conference on Machine Learning and Cybernetics, Guangzhou.

“MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases”, Proc. 2001 International Conference on Data Engineering (ICDE‟01), pp:443-452.

Han, J., Pei, J., Yin, Y., and Mao, R., 2004, “ Mining Frequent patterns without candidate generation: A Frequent-Pattern Tree Approach”. Data Mining and Knowledge Discovery, Vol. 8(1),Pp: 53-87.

C. Borgelt, “Efficient Implementations of Apriori and Eclat,” Proc.IEEE ICDM Workshop Frequent Itemset Mining Implementations, CEUR Workshop Proc., vol. 80, Nov. 2003.

M.J. Zaki and C.-J. Hsiao, “Charm: An Efficient Algorithm for Closed Itemsets Mining,” Proc. Second SIAM Int‟l Conf. Data Mining, Apr. 2002.

Wang, J., Han, J., Lu, Y., and Tzvetkov, P., 2005, “TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets”. IEEE Transactions on Knowledge and Data Engineering. Vol. 17(5), pp. 652-664.

Sriphaew, K., and Theeramunkong, T., 2002, “A new method for finding generalized frequent itemsets in generalized association rule mining”. Proc. Seventh International Symposium on Computers and Communications, pp: 1040-1045

Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L., 1999, “Discovering Frequent Closed Itemsets for Association Rules”.Proc. Seventh International Conference on Database Theory (ICDT‟99), pp. 398-416.

Seno, M., and Karypis, G., 2001, “LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing support constraint”, IEEE Transactions on Knowledge and Data Engineering.

Chao Li, Z., Lian He, P., and Lei, M, 2005 “ A High Efficient AprioriTID algorithm for mining association rule”, Proc. Fourth International Conference on Machine Learning and Cybernetics, Guangzhou

Grahne, G., Zhu, J., 2005, “Fast Algorithms for Frequent Itemset Mining Using FP-Trees”, IEEE Transactions on Knowledge and Data Engineering. Vol. 17(10).

K. Gouda and M.J. Zaki, “Efficiently Mining Maximal Frequent Itemsets,” Proc. IEEE Int‟l Conf. Data Mining, pp. 163-170, 2001.

### Refbacks

- There are currently no refbacks.

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