Results 91 to 100 of about 9,218 (205)
AN EFFICIENT ALGORITHM FOR MINING HIGH UTILITY ITEMSETS
Tạp chí Khoa họcHigh utility itemsets (HUIs) mining is the finding of itemsets that satisfy a user-defined minimum utility threshold. Many successful studies in this field have been carried out, however they are all reliant on Tidset techniques, which records the ...
Nguyen Thi Thanh Thuy*, Nguyen Van Le, Manh Thien Ly
doaj +1 more source
GPU-Accelerated Apriori Algorithm
ITM Web of Conferences, 2017 This paper propose a parallel Apriori algorithm based on GPU (GPUApriori) for frequent itemsets mining, and designs a storage structure using bit table (BIT) matrix to replace the traditional storage mode. In addition, parallel computing scheme on GPU is
Jiang Hao +3 more
doaj +1 more source
New and Efficient Algorithms for Producing Frequent Itemsets with the Map-Reduce Framework
Algorithms, 2018 The Map-Reduce (MR) framework has become a popular framework for developing new parallel algorithms for Big Data. Efficient algorithms for data mining of big data and distributed databases has become an important problem.
Yaron Gonen, Ehud Gudes, Kirill Kandalov
doaj +1 more source
Efficient Top-K Identical Frequent Itemsets Mining without Support Threshold Parameter from Transactional Datasets Produced by IoT-Based Smart Shopping Carts. [PDF]
Sensors (Basel), 2022 Rehman SU +4 more
europepmc +1 more source
A Frequent Itemset Hiding Toolbox [PDF]
, 2019 Advances in data collection and data storage technologies have given way to the establishment of transactional databases among companies and organizations, as they allow enormous amounts of data to be stored efficiently. Useful knowledge can be mined from these data, which can be used in several ways depending on the nature of the data.
Kagklis, Vasileios +2 more
openaire +2 more sources
Class Association Rule Pada Metode Associative Classification
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2011 Frequent patterns (itemsets) discovery is an important problem in associative classification rule mining. Differents approaches have been proposed such as the Apriori-like, Frequent Pattern (FP)-growth, and Transaction Data Location (Tid)-list ...
Eka Karyawati, Edi Winarko
doaj +1 more source
Inverted Index Automata Frequent Itemset Mining for Large Dataset Frequent Itemset Mining
IEEE AccessFrequent itemset mining (FIM) faces significant challenges with the expansion of large-scale datasets. Traditional algorithms such as Apriori, FP-Growth, and Eclat suffer from poor scalability and low efficiency when applied to modern datasets characterized by high dimensionality and high-density features.
Xin Dai +3 more
openaire +2 more sources
Mining frequent itemsets a perspective from operations research [PDF]
Many papers on frequent itemsets have been published. Besides somecontests in this field were held. In the majority of the papers the focus ison speed. Ad hoc algorithms and datastructures were introduced.
Kosters, W.A., Pijls, W.H.L.M.
core +1 more source
Interactive Constrained Association Rule Mining
, 2003 We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to be generated.
Bussche, Jan Van den, Goethals, Bart
core +3 more sources
Efficiently mining maximal frequent itemsets
Proceedings 2001 IEEE International Conference on Data Mining, 2002 We present GenMax, a backtracking search based algorithm for mining maximal frequent itemsets. GenMax uses a number of optimizations to prune the search space. It uses a novel technique called progressive focusing to perform maximality checking, and diffset propagation to perform fast frequency computation.
K. Gouda, M.J. Zaki
openaire +1 more source