Results 121 to 130 of about 846,106 (226)

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  

Mining frequent closed itemsets out-of-core

open access: yes, 2006
Extracting frequent itemsets is an important task in many data mining applications. When data are very large, it becomes mandatory to perform the mining task by using an external memory algorithm, but only a few of these algorithms have been proposed so ...
Lucchese C, Perego R, Orlando S
core  

Estimating the number of frequent itemsets in a large database

open access: yes, 2009
Estimating the number of frequent itemsets for minimal support α in a large dataset is of great interest from both theoretical and practical perspectives.
Dave Fuhry   +4 more
core  

DCI Closed: a fast and memory efficient algorithm to mine frequent closed itemsets

open access: yes, 2004
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting and discarding duplicate closed itemsets, without the need of keeping in ...
Lucchese C, Perego R, Orlando S
core  

A new classification of datasets for frequent itemsets

open access: yes, 2010
International audienceThe discovery of frequent patterns is a famous problem in data mining. While plenty of algorithms have been proposed during the last decade, only a few contributions have tried to understand the influence of datasets on the ...
Petit, Jean-Marc   +2 more
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