Incremental Itemset Mining Based on Matrix Apriori Algorithm-Reference-Cited by-同舟云学术

Incremental Itemset Mining Based on Matrix Apriori Algorithm

Published:2012 Issue: Volume: Page:192-204
ISSN:0302-9743
Container-title:Data Warehousing and Knowledge Discovery
language:
Short-container-title:

Author:

Oguz Damla,Ergenc Belgin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-32584-7_16.pdf

Reference18 articles.

1. Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. ACM SIGMOD Record 22(2), 207–216 (1993)

2. The Morgan Kaufmann Series in Data Management Systems;J. Han,2006

3. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: 20th International Conference on Very Large Data Bases, pp. 487–499. Morgan Kaufmann Publishers Inc., San Francisco (1994)

4. Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. ACM SIGMOD Rec. 29(2), 1–12 (2000)

5. Pavon, J., Viana, S., Gomez, S.: Matrix Apriori: Speeding Up the Search for Frequent Patterns. In: 24th IASTED International Conference on Database and Applications, pp. 75–82. ACTA Press, Anaheim (2006)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SufRec, an algorithm for mining association rules: Recursivity and task parallelism;Expert Systems with Applications;2024-02

2. Negatively-Associated Maximal Frequent Geneset Mining on DNA Methylation Profile;2021 IEEE International Conference on Bioinformatics and Biomedicine (BIBM);2021-12-09

3. On the Efficient Representation of Datasets as Graphs to Mine Maximal Frequent Itemsets;IEEE Transactions on Knowledge and Data Engineering;2021-04-01

4. High Utility Itemsets Mining Based on Divide-and-Conquer Strategy;Wireless Personal Communications;2020-08-27

5. Comparison of Dynamic Itemset Mining Algorithms for Multiple Support Thresholds;Proceedings of the 21st International Database Engineering & Applications Symposium on - IDEAS 2017;2017