首页> 外文会议>2015 International Symposium on Mathematical Sciences and Computing Research >A computationally efficient of robust mahalanobis distance based on MVV estimator
【24h】

A computationally efficient of robust mahalanobis distance based on MVV estimator

机译:基于MVV估计器的鲁棒马哈拉诺比斯距离的计算效率

获取原文
获取原文并翻译 | 示例

摘要

MCD is a well-known multivariate robust estimator. However, the computation of the estimator is not simple especially for large sample size due to the complexity of the objective function i.e. minimizing covariance determinant. Recently, an alternative objective function which is simpler and faster was introduced. The objective function is to minimize vector variance, which consequently will generate the estimator known as minimum vector variance (MVV). In this paper, a simulation study was conducted to compare the computational efficiency of the two estimators with regards to the number of operations in the computation of objective function and also iterations of the algorithm to convergence. The result showed that the computational efficiency of MVV is higher than MCD for small or large data set.
机译:MCD是众所周知的多元稳健估计器。然而,由于目标函数的复杂性,即最小化协方差决定因素,估计器的计算并不简单,特别是对于大样本量。最近,引入了更简单和更快的替代目标函数。目标函数是使向量方差最小化,因此将生成称为最小向量方差(MVV)的估计量。本文进行了仿真研究,比较了两个估计量在目标函数计算中的运算效率以及算法迭代以收敛的效率。结果表明,无论大小数据集,MVV的计算效率均高于MCD。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号