Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data
We introduce the dependence distance, a new notion of the intrinsic distance between points, derived as a pointwise extension of statistical dependence measures between variables. We then introduce a dimension reduction procedure for preserving this distance, which we call the dependence map. We explore its theoretical justification, connection to other methods, and empirical behavior on real data sets.
KeywordsDependence maps Dimensionality reduction Dependence Markov chain
Unable to display preview. Download preview PDF.
- Bottou L, Cortes C, Denker J, Drucker H, Guyon I, Jackel L, LeCun Y, Muller U, Sackinger E, Simard P, et al (1994) Comparison of classifier methods: a case study in handwritten digitrecognition. In: Proceedings of the 12th IAPR international. conference on pattern recognition, vol 2-conference B: computer vision & image processingGoogle Scholar
- Haykin S (2008) Neural networks: a comprehensive foundation. Prentice Hall, Upper Saddle RiverGoogle Scholar
- Lafon S, Keller Y, Coifman RR (2006) Data fusion and multicue data matching by diffusion maps. IEEE Trans Pattern Anal Mach Intell 28(11):1784–1797. http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.223 Google Scholar
- Mahadevan S, Maggioni M (2006) Value function approximation with diffusion wavelets and Laplacian eigenfunctions. Adv Neural Inf Process Syst 18: 843Google Scholar
- Smola A, Kondor R (2003) Kernels and regularization on graphs. In: Learning theory and kernel machines: 16th annual conference on learning theory and 7th kernel workshop, COLT/Kernel 2003, Washington, August 24–27, 2003, proceedings. Springer, Berlin, p 144Google Scholar