Results 91 to 100 of about 9,424 (197)
Efficiently Mining Frequent Itemsets on Massive Data
Frequent itemset mining is an important operation to return all itemsets in the transaction table, which occur as a subset of at least a specified fraction of the transactions.
Xixian Han +5 more
doaj +1 more source
Frequent Itemset Mining in Big Data With Effective Single Scan Algorithms
This paper considers frequent itemsets mining in transactional databases. It introduces a new accurate single scan approach for frequent itemset mining (SSFIM), a heuristic as an alternative approach (EA-SSFIM), as well as a parallel implementation on ...
Youcef Djenouri +3 more
doaj +1 more source
Efficiently mining maximal frequent itemsets
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
Probabilistic Support Prediction: Fast Frequent Itemset Mining in Dense Data
Frequent itemset mining (FIM) is a highly resource-demanding data-mining task fundamental to numerous data-mining applications. Support calculation is a frequently performed computation-intensive operation of FIM algorithms, whereas storing transactional
Muhammad Sadeequllah +3 more
doaj +1 more source
FREQUENT ITEMSETS MINING FOR BIG DATA
Frequent Itemsets Mining (FIM) is a fundamental mining model and plays an important role in Data Mining. It has a vast range of application fields and can be employed as a key calculation phase in many other mining models such as Association Rules, Correlations, Classifications, etc. Generally speaking, FIM counts the frequencies of co-occurrence items,
openaire +2 more sources
Association rules recommendation algorithm supporting recommendation nonempty
Existing association rule recommendation technologies were focus on extraction efficiency of association rule in data mining.However,it lacked consideration of recommendation balance between popular and unusual data and efficient processing.In order to ...
Ming HE, Wei-shi LIU, Jiang ZHANG
doaj +2 more sources
Incremental Closed Frequent Itemsets Mining-Based Approach Using Maximal Candidates
Incremental frequent itemset mining aims to efficiently update frequent itemsets without recalculating them from scratch, making it suitable for streaming data and real-time analytics.
Mohammed A. Al-Zeiadi +1 more
doaj +1 more source
Extraction of itemsets frequents
R. Elayachi +3 more
openaire +1 more source
Taking attendance from employees always becomes a problem for Human Resource Department (HRD) in many companies lately. Although there is an automatic check-lock machine, it still has a weakness.
Gregorius Satia Budhi +1 more
doaj
Evaluating the Privacy Implications of Frequent Itemset Disclosure. [PDF]
Serra E, Vaidya J, Akella H, Sharma A.
europepmc +1 more source

