Representative association rules-Reference-Cited by-同舟云学术

Representative association rules

Published:1998 Issue: Volume: Page:198-209
ISSN:0302-9743
Container-title:Research and Development in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Kryszkiewicz Marzena

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-64383-4_17

Reference10 articles.

1. Agraval R., Imielinski T., Swami A., Mining Associations Rules between Sets of Items in Large Databases. In Proc. of the ACM SIGMOD Conference on Management of Data, Washington, D.C., May 1993, pp. 207–216.

2. Srikant R., Agraval R., Mining Generalized Association Rules. In Proc. of the 21st VLDB Conference, Zurich, Swizerland, 1995, pp. 407–419.

3. Imielinski T., Virmani A., Abdulghani A., Discover Board Application Programming Interface and Query Language for Database Mining. In Proc. of KDD '96, Portland Ore., August 1996, pp. 20–26.

4. Meo R., Psaila G., Ceri S., A New SQL-like Operator for Mining Asscociation Rules, Proc. of the 22nd VLDB Conference, Mumbai (Bombay), India, 1996.

5. Communications of the ACM, November 1996-Vol. 39, No 11.

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

1. Enumerating Non-redundant Association Rules Using Satisfiability;Advances in Knowledge Discovery and Data Mining;2017

2. Quantitative Redundancy in Partial Implications;Formal Concept Analysis;2015

3. An effective association rule mining scheme using a new generic basis;Knowledge and Information Systems;2014-02-04

4. From data to classification rules and actions;International Journal of Intelligent Systems;2011-04-22

5. Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices;Formal Concept Analysis;2011