Results 181 to 190 of about 739 (208)
Some of the next articles are maybe not open access.
Mining Association Rules with Frequent Closed Itemsets Lattice
2003One of the most important tasks in the field of data mining is the problem of finding association rules. In the past few years, frequent closed itemsets mining has been introduced. It is a condensed representation of the data and generates a small set of rules without information loss.
Lei Jia, Jun Yao, Renqing Pei
openaire +1 more source
Targeted Querying of Closed High-Utility Itemsets
2023 IEEE International Conference on Big Data (BigData), 2023Shan Huang 0009 +2 more
openaire +1 more source
An efficient algorithm for mining frequent maximal and closed itemsets
International Journal of Hybrid Intelligent Systems, 2009The mining of frequent patterns is a basic problem in data mining applications. Frequent maximal and closed itemsets mining has become an important alternative of association rule mining. In this paper we present an effective algorithm which based on the blanket approach for mining all frequent maximal & closed itemsets. The performance of the proposed
openaire +1 more source
Parallel Computation of Closed Itemsets and Implication Rule Bases
2007Formal concept analysis has been successfully applied as a data mining framework whereby target patterns come in the form of intent families and implication bases. Since their extraction is a challenging task, especially for large datasets, parallel techniques should be helpful in reducing the computational effort and increasing the scalability of the ...
Jean François Djoufak Kengue +2 more
openaire +1 more source
Efficient strategies for incremental mining of frequent closed itemsets over data streams
Expert Systems With Applications, 2022Junqiang Liu +2 more
exaly
Frequent Closed Informative Itemset Mining
2007 International Conference on Computational Intelligence and Security (CIS 2007), 2007Huaiguo Fu +2 more
openaire +1 more source
Closed-Itemset Incremental-Mining Problem
2005Association rules, introduced by Agrawal, Imielinski and Swami (1993), provide useful means to discover associations in data. The problem of mining association rules in a database is defined as finding all the association rules that hold with more than a user-given minimum support threshold and a user-given minimum confidence threshold.
openaire +1 more source
Mining Closed and Maximal Frequent Itemsets
2011This chapter contains sections titled: Introduction Preliminaries Existing Approaches for Closed and Maximal Itemset Mining Efficient CFI and MFI Mining: Charm and Genmax Experimental Results Conclusions This chapter contains sections titled: Acknowledgments ...
openaire +1 more source
Mining of Closed High Utility Itemsets: A Survey
Recent Advances in Computer Science and Communications, 2021Kuldeep Singh +2 more
exaly