Matrix Apriori: Speeding up the search for frequent patterns

Proceedings of the IASTED International Conference on Databases and Applications, DBA 2006

Volumn , Issue , 2006, Pages 75-82

  Pavón, Judith ^a   Viana, Sidney ^b   Gómez, Santiago ^c  

^a ANHEMBI MORUMBI UNIVERSITY   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c RMIT UNIVERSITY   (Australia)

Author keywords

Association rules; Data mining; Databases; Frequent patterns

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA MINING; USER INTERFACES; VECTORS;

APRIORI AND FP-GROWTH; FREQUENT PATTERNS; MATRIX APRIORI;

RELATIONAL DATABASE SYSTEMS;

EID: 38049186447     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. C.C.Aggarwal, Towards Long Pattern Generation in Dense Database. ACMSlGKDD Explorations. Vol. 3, No. 1, July 2001, 20-26.
2. R. Agrawal, T.Imielinski, and Swami, A. Mining Association Rules between Sets of Items in Large Databases. In Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1993, 207-216.
3. R.Agrawal, H.Mannila, R.Srikant, H.Toivonen, and A.I.Verkamo, Fast Discovery of Association Rules. In U. Fayyad et al. (eds), Advances in Knowledge Discovery and Data Mining (Menlo Park, CA: AAAI Press, 1996, 307-328).
4. R.Agrawal R. Srikant, Fast Algorithms for Mining Association Rules. In Proceedings of the International Conference on Very Large Data Bases, 1994, 487-499.
5. Y.Bastide, R.Taouil, N.Pasquier, G.Stumme, and L.Kakhal, Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations. Special Issue on Scalable Data Mining Algorithms. Vol. 2., No. 2, Dec. 2000, 66-75.
6. R.J.Bayardo, Efficiently Mining Long Patterns from Databases. In Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1998, 85-93.
7. J.Han, M.Kamber, Data Mining: Concepts and Techniques (Morgan Kaufmann Publishers. New York. 2000).
8. J.Han, J.Pei, Y.Yin, Mining Frequent Patterns without Candidate Generation. In: Proceedings of ACM-SIGMOD International Conference on Management of Data. Vol 29, No. 2, 2000, 1-12.
9. J.Han, J.Wang, Y.Lu, and Tzvetkov, P. Mining Top-K Frequent Closed Patterns without Minimum Support In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), 2002, 211-218.
10. B.Liu, W.Hsu, Y.Ma, Mining Association Rules with Multiple Minimum Supports. In: Proceedings of the Fifth ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999, 337-341.
11. Y.Liu, L.Wei-keng A.Choudhary, A Fast High Utility Itemsets Mining algorithm. In: Proceedings of the Isr International Workshop on Utility-based Data Mining (SIGKDD'05),2005, 90-99.
12. J.Park, M.Chen, P.Yu, An effective hash-based algorithm for mining association rules. In: Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1995, 175-186.
13. N.Pasquier, Y.Bastide, R.Taouil, L.Lakhal, Discovering Frequent Closed Itemsets for Association Rules. In: the Proceedings of the Seventh International Conference of Database Theory (ICDT'99), 1999, 398-416.
14. J.Pei, J.Han, R.Mao, CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: Proceedings of the ACM-SIGMOD International Workshop on Data Mining and Knowledge Discovery, 2000, 11-20.
15. K.Wang, Y.He, J.Han, Pushing Support Constraints In: Association Rules Mining. IEEE Transactions on Knowledge and Data Engineering. Vol. 15., No. 3, May 2003, 642-658.
16. M.J.Zaki, C.J.Hsiao, CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proceedings of Second SIAM International Conference on Data Mining. 2002.
17. Z.Zheng, R.Kohavi, L.Mason, Real World Performance of Association Rule Algorithms. In: Proceedings of the Seventh ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001, 401-406.