Sciweavers

259 search results - page 31 / 52
» Mining frequent itemsets in time-varying data streams
Sort
View
84
Voted
IJCNN
2007
IEEE
15 years 4 months ago
An Associative Memory for Association Rule Mining
— Association Rule Mining is a thoroughly studied problem in Data Mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the...
Vicente O. Baez-Monroy, Simon O'Keefe
ACTA
2007
85views more  ACTA 2007»
14 years 9 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
ICDM
2008
IEEE
95views Data Mining» more  ICDM 2008»
15 years 4 months ago
Publishing Sensitive Transactions for Itemset Utility
We consider the problem of publishing sensitive transaction data with privacy preservation. High dimensionality of transaction data poses unique challenges on data privacy and dat...
Yabo Xu, Benjamin C. M. Fung, Ke Wang, Ada Wai-Che...
FIMI
2003
210views Data Mining» more  FIMI 2003»
14 years 11 months ago
COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation
Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. Some of these major problems are: (1) the repetitive I/O disk sca...
Osmar R. Zaïane, Mohammad El-Hajj
69
Voted
FIMI
2003
88views Data Mining» more  FIMI 2003»
14 years 11 months ago
A fast APRIORI implementation
The efficiency of frequent itemset mining algorithms is determined mainly by three factors: the way candidates are generated, the data structure that is used and the implementati...
Ferenc Bodon