Results 171 to 180 of about 846,186 (212)
Some of the next articles are maybe not open access.
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
Mining Maximal Frequent Itemsets with Frequent Pattern List
Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007Mining frequent itemsets is a major aspect of association rule research. However, the mining of the complete of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of maximal frequent itemsets.
Jin Qian, Feiyue Ye
openaire +2 more sources
2019
We present a survey of the most important algorithms that have been proposed in the context of the frequent itemset mining. We start with an introduction and overview of basic sequential algorithms, and then discuss and compare different parallel approaches based on shared-memory, message-passing, map-reduce, and the use of GPU accelerators.
Cafaro, Massimo, Pulimeno, Marco
openaire +2 more sources
We present a survey of the most important algorithms that have been proposed in the context of the frequent itemset mining. We start with an introduction and overview of basic sequential algorithms, and then discuss and compare different parallel approaches based on shared-memory, message-passing, map-reduce, and the use of GPU accelerators.
Cafaro, Massimo, Pulimeno, Marco
openaire +2 more sources
MAFIA: a maximal frequent itemset algorithm
IEEE Transactions on Knowledge and Data Engineering, 2005We present a new algorithm for mining maximal frequent itemsets from a transactional database. The search strategy of the algorithm integrates a depth-first traversal of the itemset lattice with effective pruning mechanisms that significantly improve mining performance.
Douglas Burdick +4 more
openaire +2 more sources
Discovering Frequent Itemsets in the Presence of Highly Frequent Items
2003This paper presents new techniques for focusing the discovery of frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent items adds significantly to the cost of computing the complete set of frequent itemsets.
Dennis P. Groth, Edward L. Robertson
openaire +3 more sources
Efficient mining frequent itemsets algorithms
International Journal of Machine Learning and Cybernetics, 2013Efficient algorithms for mining frequent itemsets are crucial for mining association rules as well as for many other data mining tasks. It is well known that countTable is one of the most important facility to employ subsets property for compressing the transaction database to new lower representation of occurrences items. One of the biggest problem in
Marghny H. Mohamed +1 more
openaire +1 more source
Finding frequent itemsets by transaction mapping
Proceedings of the 2005 ACM symposium on Applied computing, 2005In this paper, we present a novel algorithm for mining complete frequent itemsets. This algorithm is referred to as the TM algorithm from hereon. In this algorithm, we employ the vertical representation of a database. Transaction ids of each itemset are mapped and compressed to continuous transaction intervals in a different space thus reducing the ...
Mingjun Song, Sanguthevar Rajasekaran
openaire +1 more source
Incremental Frequent Itemsets Mining with MapReduce
2017Frequent itemsets mining is a common task in data mining. Since sizes of today’s databases go far beyond capabilities of a single machine, recent studies show how to adopt classical algorithms for frequent itemsets mining for parallel frameworks such as MapReduce. Even then, in case of a slight database update a re-run of the MapReduce mining algorithm
Kirill Kandalov, Ehud Gudes
openaire +2 more sources
Exploring Frequent Itemsets in Sweltering Climates
2019With digital transformation and in the highly competitive retail market, it is important to understand customer needs and environmental changes. Moreover, obtain more profits through novel data mining technology is essential as well. Thus, the following questions should be addressed. Does climate influence the purchasing willingness of consumers?
Ping Yu Hsu 0001 +5 more
openaire +1 more source
Mining Frequent Itemsets with Dualistic Constraints
2012Mining frequent itemsets can often generate a large number of frequent itemsets. Recent studies proposed mining itemset with the different types of constraint. The paper is to mine frequent itemsets, where a one: does not contain any item of C0 or contains at least one item of C0.
Anh N. Tran +3 more
openaire +2 more sources