Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data

DOI10.1007/S10618-012-0267-9MaRDI QIDQ2377273zbMATH OpenOpenAlexFDO

Authors Kichun Lee, Alexander Gray, Hee-Young Kim

Publication date 28 June 2013

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-012-0267-9

zbMATH Keywords

dependencedependence mapsdimensionality reductionMarkov chain

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Supervised dimensionality reduction via distance correlation maximization
• A method for extracting nonlinear structure based on measures of dependence
• On the distance concentration awareness of certain data reduction techniques
• DISTANCE-RATIO LEARNING FOR DATA VISUALIZATION
• Intrinsic dimension estimation: advances and open problems

Cites work

• An introduction to copulas.
• Correlation and dependence
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• scientific article; zbMATH DE number 51537 (Why is no real title available?)
• Kernels and regularization on graphs.
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Mining exhaled volatile organic compounds for breast cancer detection

Cited in

(2)

• Supervised dimensionality reduction via distance correlation maximization
• A method for extracting nonlinear structure based on measures of dependence

This page was built for publication: Dependence maps, a dimensionality reduction with dependence distance for high-dimensional data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2377273)