Results 131 to 140 of about 2,974 (185)
Some of the next articles are maybe not open access.
EXPEDITE: EXPress closED ITemset Enumeration
Expert Systems with Applications, 2015Abstract In this paper, we introduce EXPress closED ITemset Enumeration (E xpedite ), a new frequent closed itemset (FCI) miner designed to speed up the process of FCIs extraction from a dataset of transactions. Compared to the state of the art, E xpedite provides a CPU time saving of up to two orders of magnitude without compromising other ...
G. Aliberti +3 more
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 +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
Mining Frequent and Homogeneous Closed Itemsets
2016It is well known that when mining frequent itemsets from a transaction database, the output is usually too large to be effectively exploited by users. To cope with this difficulty, several forms of condensed representations of the set of frequent itemsets have been proposed, among which the notion of closure is one of the most popular.
Hilali, Ines +4 more
openaire +2 more sources
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
N-Most Interesting Closed Itemset Mining
2008 Third International Conference on Convergence and Hybrid Information Technology, 2008In this paper, we propose an efficient algorithm, NCLOSED, for mining the N k-closed itemsets with the highest supports for 1 up to a certain kmax value. The algorithm adopts best-first search strategy to generate closed itemsets with highest remaining supports. It does not keep closed itemsets mined in main memory to ensure that they are really closed.
Panida Songram, Veera Boonjing
openaire +1 more source
Mining Frequent Closed Itemsets from Distributed Repositories
2007In 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 +3 more sources
Mining Frequent Weighted Closed Itemsets
2013Mining frequent itemsets plays an important role in mining association rules. One of methods for mining frequent itemsets is mining frequent weighted itemsets (FWIs). However, the number of FWIs is often very large when the database is large. Besides, FWIs will generate a lot of rules and some of them are redundant.
Bay Vo, Nhu-Y Tran, Duong-Ha Ngo
openaire +1 more source
Incrementally building frequent closed itemset lattice
Expert Systems with Applications, 2014A concept lattice is an ordered structure between concepts. It is particularly effective in mining association rules. However, a concept lattice is not efficient for large databases because the lattice size increases with the number of transactions. Finding an efficient strategy for dynamically updating the lattice is an important issue for real-world ...
Phuong-Thanh La, Bac Le, Bay Vo
openaire +1 more source
Efficient closed high-utility itemset mining
Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016This paper presents a novel algorithm for discovering closed high-utility itemsets (CHUIs) efficiently. It proposes three strategies to mine CHUIs efficiently: closure jumping, forward closure checking and backward closure checking. It also relies on two new upper-bounds named local utility and sub-tree utility to prune the search space, and a Fast ...
Philippe Fournier-Viger +4 more
openaire +1 more source