Results 151 to 160 of about 801,363 (206)
Fast and memory efficient mining of frequent closed itemsets
IEEE Transactions on Knowledge and Data Engineering, 2006 This paper presents a new scalable algorithm for discovering closed frequent itemsets, a lossless and condensed representation of all the frequent itemsets that can be mined from a transactional database. Our algorithm exploits a divide-and-conquer approach and a bitwise vertical representation of the database and adopts a particular visit and ...
Raffaele Perego +2 more
exaly +8 more sources
Mining Frequent Closed Itemsets from Distributed Repositories
, 2007 In this paper we address the problem of mining frequent closed itemsets in a highly distributed setting like a Grid. The extraction of frequent (closed) itemsets is an important problem in Data Mining, and is a very expensive phase needed to extract from a transactional database a reduced set of meaningful association rules, typically used for Market ...
LUCCHESE, Claudio +3 more
openaire +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An efficient algorithm for mining closed inter-transaction itemsets
Data and Knowledge Engineering, 2008In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items.
Anthony J T Lee, Chun-Sheng Wang
exaly +3 more sources
Efficient algorithms for deriving complete frequent itemsets from frequent closed itemsets
Applied Intelligence, 2021When mining frequent itemsets (abbr. FIs) from dense datasets, it usually produces too many itemsets and results in the mining task to suffer from a very long execution time and high memory consumption. Frequent closed itemset (abbr. FCI) is a compact and lossless representation of FI. Mining FCIs can not only reduce the execution time and memory usage,
Cheng-Wei Wu +4 more
openaire +2 more sources
An algorithm for mining frequent closed itemsets
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008The problem of mining frequent itemsets plays an essential role in mining association rules, but it is not necessary to mine all frequent itemsets, instead it is sufficient to mine the set of frequent closed itemsets, which is much smaller than the set of all frequent itemsets. In this paper, we present an efficient algorithm, FCI-Miner, for mining all
Tiejun Zhang, Junrui Yang, Xiuqin Wang
openaire +1 more source
\delta-Tolerance Closed Frequent Itemsets
Sixth International Conference on Data Mining (ICDM'06), 2006In this paper, we study an inherent problem of mining Frequent Itemsets (FIs): the number of FIs mined is often too large. The large number of FIs not only affects the mining performance, but also severely thwarts the application of FI mining. In the literature, Closed FIs (CFIs) and Maximal FIs (MFIs) are proposed as concise representations of FIs ...
James Cheng, Yiping Ke, Wilfred Ng
openaire +1 more source
An efficient algorithm for mining closed itemsets
Journal of Zhejiang University-SCIENCE A, 2004This paper presents a new efficient algorithm for mining frequent closed itemsets. It enumerates the closed set of frequent itemsets by using a novel compound frequent itemset tree that facilitates fast growth and efficient pruning of search space. It also employs a hybrid approach that adapts search strategies, representations of projected transaction
Jun-qiang, Liu, Yun-he, Pan
openaire +2 more sources
Distributed Frequent Closed Itemsets Mining
2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System, 2007As many large organizations have multiple data sources and the scale of dataset becomes larger and larger, it is inevitable to carry out data mining in the distributed environment. In this paper, we address the problem of mining global frequent closed itemsets in distributed environment.
Chun Liu +3 more
openaire +2 more sources