569 search results - page 89 / 114 » An efficient clustering method for k-anonymization |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
The massive distribution of the crawling task can lead to inefficient exploration of the same portion of the Web. We propose a technique to guide crawlers exploration based on the...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
ASPDAC
2008
ACM
13 years 10 months ago
2008
ACM
In this paper we describe load scheduling, a novel method that balances load among register files by residual resources. Load scheduling can reduce register pressure for clustered...
NIPS
2004
13 years 10 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...