Sciweavers

296 search results - page 14 / 60
» Privacy-preserving algorithms for distributed mining of freq...
Sort
View
CORR
2008
Springer
159views Education» more  CORR 2008»
13 years 9 months ago
Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same pro...
Bart Kuijpers, Vanessa Lemmens, Bart Moelans, Karl...
KAIS
2006
164views more  KAIS 2006»
13 years 9 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
DIS
2007
Springer
14 years 28 days ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin
ICDM
2002
IEEE
132views Data Mining» more  ICDM 2002»
14 years 1 months ago
Speed-up Iterative Frequent Itemset Mining with Constraint Changes
Mining of frequent itemsets is a fundamental data mining task. Past research has proposed many efficient algorithms for the purpose. Recent work also highlighted the importance of...
Gao Cong, Bing Liu
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 6 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa