Tài liệu tham khảo |
Loại |
Chi tiết |
[1] R. Agrawal, T. Imieliński, and A. Swami, “Mining association rules between sets of items in large databases,” Acm sigmod record, vol. 22, no. 2. pp. 207–216, 1993 |
Sách, tạp chí |
Tiêu đề: |
Mining association rules between sets of items in large databases,” "Acm sigmod record |
|
[2] R. Agrawal, R. Srikant, and others, “Fast algorithms for mining association rules,” in Proc. 20th int. conf. very large data bases, VLDB, 1994, vol. 1215, no. 12, pp. 487–499 |
Sách, tạp chí |
Tiêu đề: |
Fast algorithms for mining association rules,” in "Proc. 20th int. conf. very large data bases, VLDB |
|
[3] A. Savasere, E. R. Omiecinski, and S. B. Navathe, “An efficient algorithm for mining association rules in large databases,” 1995 |
Sách, tạp chí |
Tiêu đề: |
An efficient algorithm for mining association rules in large databases |
|
[4] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Discovering frequent closed itemsets for association rules,” in International Conference on Database Theory, 1999, pp. 398–416 |
Sách, tạp chí |
Tiêu đề: |
Discovering frequent closed itemsets for association rules,” in "International Conference on Database Theory |
|
[5] M. Shekofteh, A. M. Rahmani, and M. A. Dezfuli, “A-Close+: An Algorithm for Mining Frequent Closed Itemsets,” in 2008 International Conference on Advanced Computer Theory and Engineering, 2008, pp.638–642 |
Sách, tạp chí |
Tiêu đề: |
A-Close+: An Algorithm for Mining Frequent Closed Itemsets,” in "2008 International Conference on Advanced Computer Theory and Engineering |
|
[6] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Efficient mining of association rules using closed itemset lattices,” Inf. Syst., vol. 24, no. 1, pp. 25–46, 1999 |
Sách, tạp chí |
Tiêu đề: |
Efficient mining of association rules using closed itemset lattices,” "Inf. Syst |
|
[7] J. Pei, J. Han, R. Mao, and others, “Closet: An efficient algorithm for mining frequent closed itemsets.,” in ACM SIGMOD workshop on research issues in data mining and knowledge discovery, 2000, vol. 4, no. 2, pp. 21–30 |
Sách, tạp chí |
Tiêu đề: |
Closet: An efficient algorithm for mining frequent closed itemsets.,” in "ACM SIGMOD workshop on research issues in data mining and knowledge discovery |
|
[8] J. Wang, J. Han, and J. Pei, “CLOSET+: searching for the best strategies for mining frequent closed itemsets,” in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, 2003, pp. 236–245 |
Sách, tạp chí |
Tiêu đề: |
CLOSET+: searching for the best strategies for mining frequent closed itemsets,” in "Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining |
|
[9] M. J. Zaki and C.-J. Hsiao, “CHARM: An efficient algorithm for closed itemset mining,” in Proceedings of the 2002 SIAM international conference on data mining, 2002, pp. 457–473 |
Sách, tạp chí |
Tiêu đề: |
CHARM: An efficient algorithm for closed itemset mining,” in "Proceedings of the 2002 SIAM international conference on data mining |
|
[10] D. Burdick, M. Calimlim, and J. Gehrke, “Mafia: A maximal frequent itemset algorithm for transactional databases,” in ICDE, 2001, vol. 1, pp. 443–452 |
Sách, tạp chí |
Tiêu đề: |
Mafia: A maximal frequent itemset algorithm for transactional databases,” in "ICDE |
|
[11] K. Gouda and M. J. Zaki, “Genmax: An efficient algorithm for mining maximal frequent itemsets,” Data Min. Knowl. Discov., vol. 11, no. 3, pp. 223–242, 2005 |
Sách, tạp chí |
Tiêu đề: |
Genmax: An efficient algorithm for mining maximal frequent itemsets,” "Data Min. Knowl. Discov |
|
[12] Z. P. Ogihara, M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, “New algorithms for fast discovery of association rules,” 1997 |
Sách, tạp chí |
Tiêu đề: |
New algorithms for fast discovery of association rules |
|
[14] J. Han, J. Pei, Y. Yin, and R. Mao, “Mining frequent patterns without candidate generation: A frequent-pattern tree approach,” Data Min.Knowl. Discov., vol. 8, no. 1, pp. 53–87, 2004 |
Sách, tạp chí |
Tiêu đề: |
Mining frequent patterns without candidate generation: A frequent-pattern tree approach,” "Data Min. "Knowl. Discov |
|
[15] L.-X. Qin, P. Luo, and Z.-Z. Shi, “Efficiently mining frequent itemsets with compact FP-tree,” in International Conference on Intelligent Information Processing, 2004, pp. 397–406 |
Sách, tạp chí |
Tiêu đề: |
Efficiently mining frequent itemsets with compact FP-tree,” in "International Conference on Intelligent Information Processing |
|
[16] L. T. T. Nguyen, B. Vo, L. T. T. Nguyen, P. Fournier-Viger, and A. Selamat, “ETARM: an efficient top-k association rule mining algorithm,” Appl. Intell., vol. 48, no. 5, pp. 1148–1160, 2018 |
Sách, tạp chí |
Tiêu đề: |
ETARM: an efficient top-k association rule mining algorithm,” "Appl. Intell |
|
[17] M. S. Saravanan and R. J. R. Sree, “A simple process model generation using a new association rule mining algorithm and clustering approach,”in 2011 Third International Conference on Advanced Computing, 2011, pp. 265–269 |
Sách, tạp chí |
Tiêu đề: |
A simple process model generation using a new association rule mining algorithm and clustering approach,” in "2011 Third International Conference on Advanced Computing |
|
[18] R. Sumathi and E. Kirubakaran, “Architectural perspective of parallelizing association rule mining,” in IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM-2012), 2012, pp. 437–442 |
Sách, tạp chí |
Tiêu đề: |
Architectural perspective of parallelizing association rule mining,” in "IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM-2012) |
|
[19] N. Aryabarzan, B. Minaei-Bidgoli, and M. Teshnehlab, “negFIN: An efficient algorithm for fast mining frequent itemsets,” Expert Syst.Appl., vol. 105, pp. 129–143, 2018 |
Sách, tạp chí |
Tiêu đề: |
negFIN: An efficient algorithm for fast mining frequent itemsets,” "Expert Syst. "Appl |
|
[20] R. Srikant and R. Agrawal, “Mining quantitative association rules in large relational tables,” in Acm Sigmod Record, 1996, vol. 25, no. 2, pp.1–12 |
Sách, tạp chí |
Tiêu đề: |
Mining quantitative association rules in large relational tables,” in "Acm Sigmod Record |
|
[21] B. Lent, A. Swami, and J. Widom, “Clustering association rules,” in Proceedings 13th International Conference on Data Engineering, 1997, pp. 220–231 |
Sách, tạp chí |
Tiêu đề: |
Clustering association rules,” in "Proceedings 13th International Conference on Data Engineering |
|