Sciweavers

34 search results - page 2 / 7
» pakdd 2010
Sort
View
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 8 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng
PAKDD
2010
ACM
275views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Anonymizing Transaction Data by Integrating Suppression and Generalization
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
Junqiang Liu, Ke Wang
PAKDD
2010
ACM
182views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Computation of Ratios of Secure Summations in Multi-party Privacy-Preserving Latent Dirichlet Allocation
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
Bin Yang, Hiroshi Nakagawa
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 8 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
PAKDD
2010
ACM
134views Data Mining» more  PAKDD 2010»
13 years 8 months ago
Generating Diverse Ensembles to Counter the Problem of Class Imbalance
Abstract. One of the more challenging problems faced by the data mining community is that of imbalanced datasets. In imbalanced datasets one class (sometimes severely) outnumbers t...
T. Ryan Hoens, Nitesh V. Chawla