Results 141 to 150 of about 1,634,075 (173)
Some of the next articles are maybe not open access.
The Closed Keys Base of Frequent Itemsets
2002In data mining, concise representations are useful and necessary to apprehending voluminous results of data processing. Recently many different concise representations of frequent itemsets have been investigated. In this paper, we present yet another concise representation of frequent itemsets, called the closed keys representation, with the following ...
openaire +2 more sources
A New Technique for Fast Frequent Closed Itemsets Mining
2005 IEEE International Conference on Systems, Man and Cybernetics, 2006This paper proposes a new technique for fast frequent closed itemsets mining. The method employs the concept of prefix-based equivalence class to partition the database in such a way that the possible frequent itemsets will be uniformly distributed in the partitions.
Li Ning 0002, Ningning Wu, Jing Zhang
openaire +2 more sources
Using Frequent Closed Itemsets for Data Dimensionality Reduction
2011 IEEE 11th International Conference on Data Mining, 2011We address important issues of dimensionality reduction of transactional data sets where the input data consists of lists of transactions, each of them being a finite set of items. The reduction consists in finding a small set of new items, so-called factor-items, which is considerably smaller than the original set of items while comprising full or ...
Petr Krajca +2 more
openaire +1 more source
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
Mining probabilistic frequent closed itemsets in uncertain databases
Proceedings of the 49th Annual Southeast Regional Conference, 2011This paper defines probabilistic support and probabilistic frequent closed itemsets in uncertain databases for the first time. It also proposes a probabilistic frequent closed itemset mining (PFCIM) algorithm to mine probabilistic frequent closed itemsets from uncertain databases.
Peiyi Tang, Erich A. Peterson
openaire +2 more sources
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
Mining Approximate Closed Frequent Itemsets over Stream
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008Frequent itemset mining is a very important problem in data mining. Closed frequent itemsets is the condensed representation of frequent itemsets thus spend less memory, so it is much suitable for stream mining. But on the other hand, when the minimum support is much lower, the size of closed frequent itemsets turns larger, which makes the performance ...
Haifeng Li 0006 +2 more
openaire +1 more source
Parallel SAT based closed frequent itemsets enumeration
2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA), 2015Frequent itemset mining (FIM) is a useful task for discovering frequent co-occurring items. Since its inception, a number of significant FIM algorithms have been developed to speed up mining performances. Unfortunately, for huge dataset, scalability remains an important issue.
Imen Ouled Dlala +4 more
openaire +1 more source
CWFM: Closed Contingency Weighted Frequent Itemsets Mining
2012Weighted pattern mining have been studied the importance of items. So far, in weight constraint based pattern mining, the weight has been considered the item's price. The price considered as the weight has a limit. The weight characteristic of weighted pattern mining should be considered case-by-case situation.
Eunkyoung Park +5 more
openaire +1 more source
Mining closed frequent itemset based on FP-Tree
2009 IEEE International Conference on Granular Computing, 2009Closed frequent itemsets provide a minimal representation of the itemset without losing their support information and they can greatly reduce the number of patterns. So how to obtain all the closed frequent itemsets effectively is of good importance. This paper constructs a FP-Tree according the matrix which only scans the database once. Also we design
Shengwei Li, Lingsheng Li, Chong Han
openaire +1 more source