A new algorithm for faster mining of generalized association rules-Reference-Cited by-同舟云学术

A new algorithm for faster mining of generalized association rules

Published:1998 Issue: Volume: Page:74-82
ISSN:0302-9743
Container-title:Principles of Data Mining and Knowledge Discovery
language:
Short-container-title:

Author:

Hipp Jochen,Myka Andreas,Wirth Rüdiger,Güntzer Ulrich

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0094807

Reference7 articles.

1. R. Agrawal, T. Imielinski, A. Swami: Mining Association Rules between Sets of Items in Large Databases, In Proc. of ACM SIGMOD ’93, 1993, Washington, USA.

2. R. Agrawal, R. Srikant, Fast Algorithms for Mining Association Rules, In Proc. of the VLDB ’94, 1994, Santiago, Chile.

3. J. Han, Y. Fu, Discovery of Multiple-Level Association Rules from Large Databases, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.

4. R. Srikant, R. Agrawal, Mining Generalized Association Rules, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.

5. A. Savasere, E. Omiecinski, S. Navathe, An Efficient Algorithm for Mining Association Rules in Large databases, In Proc. of the VLDB ’95, 1995, Zürich, Switzerland.

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

1. Mining Top-K constrained cross-level high-utility itemsets over data streams;Knowledge and Information Systems;2024-01-21

2. Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases;Information Sciences;2022-03

3. Cross-Level High-Utility Itemset Mining Using Multi-core Processing;Computational Collective Intelligence;2021

4. An Efficient Approach for Mining High-Utility Itemsets from Multiple Abstraction Levels;Intelligent Information and Database Systems;2021

5. Mining Cross-Level High Utility Itemsets;Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices;2020