164 search results - page 5 / 33 » On k-Anonymity and the Curse of Dimensionality |
AUSDM
2007
Springer
13 years 12 months ago
2007
Springer
One of the inherent problems in pattern recognition is the undersampled data problem, also known as the curse of dimensionality reduction. In this paper a new algorithm called pai...
TKDE
2011
13 years 21 days ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
COR
2008
13 years 5 months ago
2008
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
PODS
2001
ACM
14 years 5 months ago
2001
ACM
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
IDEAL
2010
Springer
13 years 3 months ago
2010
Springer
: Covariance matrices capture correlations that are invaluable in modeling real-life datasets. Using all d2 elements of the covariance (in d dimensions) is costly and could result ...