164 search results - page 11 / 33 » On k-Anonymity and the Curse of Dimensionality |
95
Voted
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Clustering large data sets of high dimensionality has always been a serious challenge for clustering algorithms. Many recently developed clustering algorithms have attempted to ad...
DIS
2006
Springer
15 years 1 months ago
2006
Springer
Parametric Embedding (PE) has recently been proposed as a general-purpose algorithm for class visualisation. It takes class posteriors produced by a mixture-based clustering algori...
BMEI
2008
IEEE
14 years 11 months ago
2008
IEEE
The importance of gene expression data in cancer diagnosis and treatment by now has been widely recognized by cancer researchers in recent years. However, one of the major challen...
180
click to vote
ICDE
2000
IEEE
15 years 10 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...