569 search results - page 59 / 114 » An efficient clustering method for k-anonymization |
SDM
2004
SIAM
13 years 10 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
SDM
2003
SIAM
13 years 10 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
PKDD
2000
Springer
14 years 9 days ago
2000
Springer
: One way to scale up clustering algorithms is to squash the data by some intelligent compression technique and cluster only the compressed data records. Such compressed data recor...
ICCV
2009
IEEE
15 years 1 months ago
2009
IEEE
We present an efficient method for feature correspondence and object-based image matching, which exploits both photometric similarity and pairwise geometric consistency from local ...
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
The spatio-temporal patterning of gene expression in early embryos is an important source of information for understanding the functions of genes involved in development. Most ana...