504 search results - page 37 / 101 » PCS: An Efficient Clustering Method for High-Dimensional Dat... |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
The goal of the knowledge discovery and data mining is to extract the useful knowledge from the given data. Visualization enables us to find structures, features, patterns, and re...
ICIP
2008
IEEE
14 years 2 months ago
2008
IEEE
Face representation based on the Visual Codebook becomes popular because of its excellent recognition performance, in which the critical problem is how to learn the most efficien...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
ICDM
2009
IEEE
13 years 5 months ago
2009
IEEE
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...