195 search results - page 6 / 39 » Clustering-Based K-Anonymisation Algorithms |
CIKM
2004
Springer
14 years 15 days ago
2004
Springer
This paper presents a cluster validation based document clustering algorithm, which is capable of identifying both important feature words and true model order (cluster number). I...
IDA
2003
Springer
14 years 9 days ago
2003
Springer
The segmentation of time-series is a constrained clustering problem: the data points should be grouped by their similarity, but with the constraint that all points in a cluster mus...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
: 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...
PKDD
2000
Springer
13 years 10 months 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...
ICCAD
2007
IEEE
14 years 4 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...