6094 search results - page 769 / 1219 » Applications of a Color-Naming Database |
165
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
166
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
189
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
159
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
187
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...