Mahalanobis Distance Minimization Mapping: M3
Abstract
This paper presents a versatile linear regression method between high-dimensional spaces based on Mahalanobis distance minimization criterion. Standard regression methods suffer from ¿multi-collinearity¿ problem, which makes regressions unstable and unreliable. For solving this problem, dimensionality reduction methods, such as PCR, PLS, and CCA, are widely used. These dimensionality reduction methods can robustly capture the major correlations between input and output variables by suppressing the minor correlations. However, the minor correlations are sometimes necessary for estimating natural outputs. In this paper, we propose Mahalanobis-distance Minimization Mapping (M3), which avoids multi-collinearity problem without reducing the dimensionality. M3 estimates the most likely output according to the training sample distribution. We conducted experiments for comparing the accuracy among M3, CCA, and other methods, and we confirmed that M3 always estimates the most accurate outputs among them.
Cite
Text
Oka and Wada. "Mahalanobis Distance Minimization Mapping: M3." IEEE/CVF International Conference on Computer Vision Workshops, 2009. doi:10.1109/ICCVW.2009.5457712Markdown
[Oka and Wada. "Mahalanobis Distance Minimization Mapping: M3." IEEE/CVF International Conference on Computer Vision Workshops, 2009.](https://mlanthology.org/iccvw/2009/oka2009iccvw-mahalanobis/) doi:10.1109/ICCVW.2009.5457712BibTeX
@inproceedings{oka2009iccvw-mahalanobis,
title = {{Mahalanobis Distance Minimization Mapping: M3}},
author = {Oka, Aiko and Wada, Toshikazu},
booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
year = {2009},
pages = {93-100},
doi = {10.1109/ICCVW.2009.5457712},
url = {https://mlanthology.org/iccvw/2009/oka2009iccvw-mahalanobis/}
}