Results 121 to 130 of about 1,634,075 (173)
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 Frequent Closed Itemsets Mining
2008 International Conference on Computer Science and Software Engineering, 2008Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Most existing work focuses on mining all frequent itemsets. However, since any subset of a frequent set also is frequent, it is sufficient to mine the set of frequent closed itemsets which determines exactly the complete set of all frequent itemsets and is ...
Lisheng Ma, Yi Qi
exaly +3 more sources
An efficient algorithm for incrementally mining frequent closed itemsets
Applied Intelligence, 2013The purpose of mining frequent itemsets is to identify the items in groups that always appear together and exceed the user-specified threshold of a transaction database. However, numerous frequent itemsets may exist in a transaction database, hindering decision making.
Yue-Shi Lee, Show-Jane Yen
exaly +2 more sources
An algorithm for discovering the frequent closed itemsets in a large database
Journal of Experimental and Theoretical Artificial Intelligence, 2006Previous research revealed that the problem of discovering a complete set of frequent itemsets from a large database can be reduced to the problem of discovering the frequent closed itemsets, and this process results in a much smaller set of itemsets without information loss.
Sanasam Ranbir Singh, Bhanu Prasad
exaly +2 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
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
Mining frequent closed itemsets from a landmark window over online data streams [PDF]
Computers and Mathematics With Applications, 2009 The frequent closed itemsets determine exactly the complete set of frequent itemsets and are usually much smaller than the later. However, mining frequent closed itemsets from a landmark window over data streams is a challenging problem.
Jihong Guan
exaly +2 more sources
Generating Closed Frequent Itemsets with the Frequent Pattern List
2010 2nd International Workshop on Database Technology and Applications, 2010An approach is proposed to discover closed frequent itemsets with a simple linear list structure called the Frequent Pattern List(FPL) in transaction database. The approach selects representation patterns from candidate itemsets to reduce combinational space of frequent patterns.
Qin Li, Sheng Chang
openaire +2 more sources