Sciweavers

83 search results - page 8 / 17
» Time Aware Mining of Itemsets
Sort
View
DAWAK
2006
Springer
13 years 10 months ago
A Greedy Approach to Concurrent Processing of Frequent Itemset Queries
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
Pawel Boinski, Marek Wojciechowski, Maciej Zakrzew...
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 6 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
DKE
2008
124views more  DKE 2008»
13 years 6 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
FIMI
2003
88views Data Mining» more  FIMI 2003»
13 years 8 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
ICA3PP
2005
Springer
14 years 7 days ago
Mining Traces of Large Scale Systems
Abstract— Large scale distributed computing infrastructure captures the use of high number of nodes, poor communication performance and continously varying resources that are not...
Christophe Cérin, Michel Koskas