Sciweavers

296 search results - page 30 / 60
» Privacy-preserving algorithms for distributed mining of freq...
Sort
View
SAC
2004
ACM
14 years 2 months ago
Mining dependence rules by finding largest itemset support quota
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...
Alexandr A. Savinov
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
14 years 3 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 2 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
14 years 17 days ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
TIME
2008
IEEE
14 years 3 months ago
Time Aware Mining of Itemsets
Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web acces logs....
Bashar Saleh, Florent Masseglia