Results 121 to 130 of about 2,597 (181)

Finding Frequent Itemsets in High-Speed Data Streams

open access: yes, 2008
Finding frequent itemsets from data streams is one of important tasks of stream data mining. In a time-varying data stream, when the significant change on the frequent itemsets is detected, it is ideal to compute the new frequent itemsets as quickly as ...
Xingzhi Sun, Xue Li, Maria E. Orlowska
core  

Ameliorated Algorithm to Maintain Discovered Frequent Itemsets

open access: yes
It is an important task in data mining to maintain discovered frequent itemsets for association rule mining. Because most time-consuming operation for mining association rules is to find the frequent itemsets from the transaction database.
Makinouchi, Akifumi   +5 more
core  

Mining Recent Frequent Itemsets in Sliding Windows over Data Streams

open access: yes, 2012
This paper considers the problem of mining recent frequent itemsets over data streams. As the data grows without limit at a rapid rate, it is hard to track the new changes of frequent itemsets over data streams. We propose an efficient one-pass algorithm
Han, Congying, He, Guoping, Xu, Lijun
core  

Frequent itemset mining on multiprocessor systems.

open access: yes, 2014
Frequent itemset mining is an important building block in many data mining applications like market basket analysis, recommendation, web-mining, fraud detection, and gene expression analysis. In many of them, the datasets being mined can easily grow up to hundreds of gigabytes or even terabytes of data.
openaire   +3 more sources

FREQUENT ITEMSETS MINING FOR BIG DATA

open access: yes, 2019
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

ITL-Mine: Mining Frequent Itemsets More Efficiently

open access: yes, 2002
The discovery of association rules is an important problem in data mining. It is a two-step process consisting of finding the frequent itemsets and generating association rules from them.
Raj P. Gopalan, Yudho Giri Sucahyo
core  

A Fuzzy Algorithm for Mining High Utility Rare Itemsets -FHURI

open access: yes, 2014
Classical frequent itemset mining identifies frequent itemsets in transaction databases using only frequency of item occurrences, without considering utility of items.
Pillai, Jyothi   +4 more
core  

Mining frequent itemsets from uncertain data

open access: yes, 2007
We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions whose items are associated with existential probabilities and give a formal definition of frequent patterns under such an ...
Kao, B, Chui, CK, Hung, E
core  

Extraction of itemsets frequents

open access: yesInternational Journal of Mathematics Research, 2020
R. Elayachi   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy