Sciweavers

7163 search results - page 231 / 1433
» Privacy-Preserving Data Mining
Sort
View
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
16 years 6 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen
ADBIS
2001
Springer
115views Database» more  ADBIS 2001»
15 years 10 months ago
Interactive Constraint-Based Sequential Pattern Mining
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
Marek Wojciechowski
148
Voted
ADMA
2006
Springer
137views Data Mining» more  ADMA 2006»
15 years 9 months ago
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
Abstract. The issue of maintaining privacy in frequent itemset mining has attracted considerable attentions. In most of those works, only distorted data are available which may bri...
Jinlong Wang, Congfu Xu, Hongwei Dan, Yunhe Pan
EUSFLAT
2009
233views Fuzzy Logic» more  EUSFLAT 2009»
15 years 3 months ago
SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
Christian Borgelt, Xiaomeng Wang
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
15 years 11 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu