1 |
R. Agrawal, T. Imieliski, and A. Swami, "Mining association rules between sets of items in large databases," in Proc. ACM SIGMOD Int. Cont. Manage. Data, pp.207-216, 1993.
|
2 |
R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in Proc. Int. Conf. Very Large Data Bases, pp.487-499, 1994.
|
3 |
Jiawei Han, Jian Pei, and Yiwen Yin, "Mining Frequent Patterns without Candidate Generation," in ACM-SIGMOD, Dallas, 2000.
|
4 |
Chris Giannella, Jiawei Han, Jian Pei, Xifeng Yan, and Philip S. Yu, "Mining Frequent Patterns in Data Streams at Multiple Time Granularities; Data Mining: Next Generation Challenges and Future Directions," AAAI/MIT, 2003.
|
5 |
O. R. Zaiane and M. El-Hajj, "COFI Approach for Mining Frequent Itemsets Revisited," Proc. ACM SIGMOD Workshop Res. Issues Data Mining Knowl. Discovery, pp.70-75, 2004.
|
6 |
O. R. Zaiane and M. El-Hajj, "Cofi-tree mining: A new approach to pattern growth with reduced candidacy," in Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementation(FIMI'03), 2003.
|
7 |
M. Adnan and R. Alhajj, "DRFP-tree: Disc-resident frequent pattern tree," Appl. Intell., Vol.30, No.2, pp.84-97, 2009
DOI
|
8 |
M. Adnan and R. Alhajj, "A bounded and Adaptive Memorybased Approach to Mine Frequent Patterns From Very Large Databases," IEEE Transactions on Systems, Man, and Cybernetics, Part B(2011), pp.154-172.
DOI
|
9 |
C. K. -S. Leung, Q. I. Khan, and T. Hoque, "CanTree:A Tree Structure for Efficient Incremental Mining of Frequent Patterns," Proc. IEEE Int. Conf. Data Mining, pp.274-281, 2005.
|
10 |
C. K. -S. Leung, and Q. I. Khan, "DSTree:a tree structure for the mining of frequent sets from data streams," in Proc. IEEE ICDM, pp.928-932, 2006.
|
11 |
G. Liu, H. Lu, J. X. Yu, W. Wang, and X. Xiao, "AFOPT: An efficient implementation of pattern growth approach," in Proc. FIMI, 2003.
|
12 |
Cheung, William and Osmar R. Zaiane, "Incremental mining of frequent patterns without candidate generation or support constraint," DatabaseEngineering and Applications Symposium, Proceedings. Seventh International. IEEE, pp.111-116, 2003.
|
13 |
B. Goethals, "Memory issues in frequent itemset mining," in proc. ACM SAC, pp.530-534, 2004.
|
14 |
R. Vaarandi, "A breadth-first algorithm for mining frequent patterns from event logs," in Proc. IEEE INTELLCOMM, pp.274-281, 2004.
|
15 |
G. Buehrer, S. Parthasarathy, and A. Ghoting, "Out-of-core frequent pattern mining on a commodity PC," in Proc. 12th ACM SIGKDD Int. Conf. KDD, pp.86-95, 2006.
|