子空间拓扑
模式识别(心理学)
异常检测
透视图(图形)
离群值
降噪
多维标度
人工智能
缩放比例
计算机科学
降维
数学
统计
几何学
作者
Lingchen Kong,Chuanqi Qi,Houduo Qi
标识
DOI:10.1109/tsp.2019.2922167
摘要
The classical multidimensional scaling (cMDS) has become a cornerstone for analyzing metric dissimilarity data due to its simplicity in derivation, low computational complexity and its nice interpretation via the principle component analysis. This paper focuses on its capability of denoising and outlier detection. Our new interpretation shows that cMDS always overly denoises a sparsely perturbed data by subtracting a fully dense denoising matrix in a subspace from the given data matrix. This leads us to consider two types of sparsity-driven models: subspace sparse MDS and full-space sparse MDS, which respectively uses the $\ell _1$ and $\ell _{1-2}$ regularization to induce sparsity. We then develop fast majorization algorithms for both models and establish their convergence. In particular, we are able to control the sparsity level at every iterate provided that the sparsity control parameter is above a computable threshold. This is a desirable property that has not been enjoyed by any of existing sparse MDS methods. Our numerical experiments on both artificial and real data demonstrates that cMDS with appropriate regularization can perform the tasks of denoising and outlier detection, and inherits the efficiency of cMDS in comparison with several state-of-the-art sparsity-driven MDS methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI