Results 151 to 160 of about 1,634,075 (173)

An efficient algorithm for mining frequent maximal and closed itemsets

International Journal of Hybrid Intelligent Systems, 2009
The 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   +2 more sources

Mining frequent closed itemsets from multidimensional databases

International Journal of Computational Vision and Robotics, 2015
This paper proposes an algorithm for mining frequent closed itemsets from multidimensional databases. The algorithm, which does not require transforming a database into a transaction database, is based on the intersections of object identifications for fast computing the supports of itemsets.
Bay Vo, Hien T. Nguyen
openaire   +1 more source

ACCF: Associative Classification Based on Closed Frequent Itemsets

2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008
Recent studies in data mining have proposed a new classification approach, called associative classification, which, according to several reports, such as , achieves higher classification accuracy than traditional classification approaches such as C4.5.
Xueming Li, Dongxia Qin, Cun Yu
openaire   +2 more sources

Tough constraint-based frequent closed itemsets mining

Proceedings of the 2003 ACM symposium on Applied computing - SAC '03, 2003
Mining frequent itemsets has been one of the hot topics in data mining. Candidate generation-and-test approaches such as Apriori have been proved to be effective. However, in practical applications, we will face a lot of intractable frequent itemsets under the preset minimum support.
Lei Jia, Renqing Pei, Dingyu Pei
openaire   +1 more source

Mining Closed and Maximal Frequent Itemsets

2011
This 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

Frequent Closed Informative Itemset Mining

2007 International Conference on Computational Intelligence and Security (CIS 2007), 2007
Huaiguo Fu, Mícheál Ó Foghlú, Willie Donnelly   +2 more
openaire   +2 more sources

Efficient strategies for incremental mining of frequent closed itemsets over data streams

Expert Systems With Applications, 2022
Xiaoning Jiang, Junqiang Liu, Xueling Wang   +2 more
exaly  

Mining Top-K Frequent Closed Itemsets Is Not in APX

2006
Mining top-k frequent closed itemsets was initially proposed and exactly solved by Wang et al. [IEEE Transactions on Knowledge and Data Engineering 17 (2005) 652-664]. However, in the literature, no research has ever considered the complexity of this problem.
openaire   +2 more sources

: A vertical algorithm for mining frequent closed itemsets

Expert Systems With Applications, 2021
Nader Aryabarzan, Behrouz Minaei-Bidgoli
exaly  

Mining Frequent Closed Itemsets Without Candidate Generation

2005
Mining frequent closed itemsets provides complete and non-redundant result for the analysis of frequent pattern. Most of the previous studies adopted the FP-tree based conditional FP-tree generation and candidate itemsets generation-and-test approaches.
openaire   +2 more sources