349 search results - page 12 / 70 » Information Preserving Dimensionality Reduction |
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
WIRN
2005
Springer
14 years 3 months ago
2005
Springer
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
CIKM
2003
Springer
14 years 3 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
IJPRAI
2010
13 years 7 months ago
2010
: Many locality-based unsupervised dimensionality reduction (DR) algorithms have recently been proposed and demonstrated to be effective to a certain degree in some classification ...