Results 1 to 10 of about 2,597 (181)
Finding the True Frequent Itemsets [PDF]
Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It requires to identify all itemsets appearing in at least a fraction $θ$ of a transactional dataset $\mathcal{D}$. Often though, the ultimate goal of mining $\mathcal{D}$ is not an analysis of the dataset \emph{per se}, but the understanding of the underlying process that ...
Riondato, Matteo, VANDIN, FABIO
openaire +6 more sources
Mining Frequent Itemsets in a Stream [PDF]
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency over all possible windows in the stream from any point in the past until the current state that satisfy a minimal length constraint.
Toon Calders +2 more
openaire +7 more sources
TKFIM: Top-K frequent itemset mining technique based on equivalence classes [PDF]
Frequently used items mining is a significant subject of data mining studies. In the last ten years, due to innovative development, the quantity of data has grown exponentially.
Saood Iqbal +5 more
doaj +2 more sources
Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
When it comes to association rule mining, all frequent itemsets are first found, and then the confidence level of association rules is calculated through the support degree of frequent itemsets.
Yalong Zhang +4 more
doaj +1 more source
Finding Stable Periodic-Frequent Itemsets in Big Columnar Databases
Stable periodic-frequent itemset mining is essential in big data analytics with many real-world applications. It involves extracting all itemsets exhibiting stable periodic behaviors in a temporal database.
Hong N. Dao +5 more
doaj +1 more source
Efficient mining of intra-periodic frequent sequences
Frequent Sequence Mining (FSM) is a fundamental task in data mining. Although FSM algorithms extract frequent patterns, they cannot discover patterns that periodically appear in the data.
Edith Belise Kenmogne +4 more
doaj +1 more source
Association Mining for Super Market Sales using UP Growth and Top-K Algorithm [PDF]
Frequent itemsets(HUIs) mining is an evolving field in data mining, that centers around finding itemsets having a utility that meets a user-specified minimum utility by finding all the itemsets.
Bhope Harshal +3 more
doaj +1 more source
An algebraic semigroup method for discovering maximal frequent itemsets
Discovering maximal frequent itemsets is an important issue and key technique in many data mining problems such as association rule mining. In the literature, generating maximal frequent itemsets proves either to be NP-hard or to have O(l34l(m+n))O\left({
Liu Jiang +5 more
doaj +1 more source
High Scalability Document Clustering Algorithm Based On Top-K Weighted Closed Frequent Itemsets
Documents clustering based on frequent itemsets can be regarded a new method of documents clustering which is aimed to overcome curse of dimensionality of items produced by documents being clustered.
Gede Aditra Pradnyana, Arif Djunaidy
doaj +1 more source
Weighted Frequent Itemsets Mining Algorithm Based on Difference Nodeset [PDF]
To address the low mining efficiency of NFWI,a WN-list based algorithm for weighted frequent itemsets mining,this paper proposes a WDiffNodeset-based weighted frequent itemsets mining algorithm,DiffNFWI.The algorithm extends the data structure of ...
WANG Bin, FANG Xinxiu, WEI Tianyou
doaj +1 more source

