446 search results - page 83 / 90 » Randomization in Privacy-Preserving Data Mining |
120
Voted
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...
124
click to vote
SAC
2006
ACM
15 years 6 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...