1701 search results - page 185 / 341 » Providing k-anonymity in data mining |
102
click to vote
SISAP
2008
IEEE
15 years 4 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
We present a framework for clustering distributed data in unsupervised and semi-supervised scenarios, taking into account privacy requirements and communication costs. Rather than...
AUSDM
2008
Springer
15 years 10 days ago
2008
Springer
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...
101
click to vote
KDD
2006
ACM
15 years 10 months ago
2006
ACM
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...