返回
Median-Based Classifiers for High-Dimensional Data
DOI:10.1198/jasa.2009.tm08107.png)
摘要
En 中文
Conventional distance-based classifiers use standard Euclidean distance, and so can suffer from excessive volatility if vector components have heavy-tailed distributions. This difficulty can be alleviated by replacing the L-2 distance by its L-1 counterpart. For example, the L-1 version of the popular centroid classifier would allocate a new data value to the population to whose centroid it was closest in L-1 terms. However, this approach can lead to inconsistency, because the centroid is defined using L-2, rather than L-1, distance. In particular, by mixing L-1 and L-2 approaches, we produce a classifier that can seriously misidentify data in cases where the means and medians of marginal distributions take different values. These difficulties motivate replacing centroids by medians. However, in the very-high-dimensional settings commonly encountered today, this can be problematic if we attempt to work with a conventional spatial median. Therefore, we suggest using componentwise medians to construct a robust classifier that is relatively insensitive to the difficulties caused by heavy-tailed data and entails straightforward computation. We also consider generalizations and extensions of this approach based on, for example, using data truncation to achieve additional robustness. Using both empirical and theoretical arguments, we explore the properties of these methods, and show that the resulting classifiers can be particularly effective. Supplementary materials are available online.
Keyword:
Centroid classifier
Componentwise median
Data depth
Distance-based classifier
High-dimensional data
L-1 method
Robust method
Sample median
Spatial median
Strength of dependence
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
Classification methods for the development of genomic signatures from high-dimensional data
GENOME BIOLOGY
IF9.4

