Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets-Reference-Cited by-同舟云学术

Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets

Published:2009-10 Issue:10 Volume:68 Page:1091-1111
ISSN:0169-023X
Container-title:Data & Knowledge Engineering
language:en
Short-container-title:Data & Knowledge Engineering

Author:

Hamrouni T.,Ben Yahia S.,Mephu Nguifo E.

Publisher

Elsevier BV

Subject

Information Systems and Management

Reference61 articles.

1. Fast discovery of association rules;Agrawal,1996

2. J.L. Balcázar, A. Bifet, A. Lozano, Mining frequent closed unordered trees through natural representations, in: Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), LNCS, vol. 4604, Springer-Verlag, Sheffield, UK, July 2007, pp. 347–359.

3. Horn axiomatizations for sequential data;Balcázar;Theoretical Computer Science,2007

4. Essential classification rule sets;Baralis;ACM Transactions on Database Systems,2004

5. Mining frequent patterns with counting inference;Bastide;ACM-SIGKDD Explorations,2000

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

1. Efficient Associate Rules Mining Based on Topology for Items of Transactional Data;Mathematics;2023-01-12

2. Simplifying Implications with Positive and Negative Attributes: A Logic-Based Approach;Mathematics;2022-02-16

3. High average-utility itemsets mining: a survey;Applied Intelligence;2021-07-14

4. Exploiting the Formation of Maximal Cliques in Social Networks;Symmetry;2017-06-29

5. Sampling frequent and minimal boolean patterns: theory and application in classification;Data Mining and Knowledge Discovery;2015-03-12