arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.01332stat.ME
收藏

函数深度研究

A Study of Functional Depths

James P. Long, Jianhua Z. Huang

摘要:

功能深度用于将功能观察从最外围到最典型进行排序。由功能深度产生的等级已经被提议作为功能分类器、等级测试和数据可视化程序的基础。许多建议的功能深度是不变的域置换,一个不寻常的属性的功能数据分析过程。本质上,这些深度将函数数据视为多变量数据。在这项工作中,我们比较现有的几个功能深度的性能,一个简单的适应现有的多元深度概念,$L^\infty$深度($L^{\infty}D$)。在模拟和真实数据,我们表明$L^{\infty}D$的性能相当或优于几个现有的概念的功能深度。此外,我们回顾了如何评估深度函数,并提出了一些改进。特别是,我们表明,经验的深度函数的渐近性可能是错误的领导,而是提出了一种新的方法,秩秩图,用于评估经验的深度秩稳定性。

英文摘要:

Functional depth is used for ranking functional observations from most outlying to most typical. The ranks produced by functional depth have been proposed as the basis for functional classifiers, rank tests, and data visualization procedures. Many of the proposed functional depths are invariant to domain permutation, an unusual property for a functional data analysis procedure. Essentially these depths treat functional data as if it were multivariate data. In this work, we compare the performance of several existing functional depths to a simple adaptation of an existing multivariate depth notion, $L^\infty$ depth ($L^{\infty}D$). On simulated and real data, we show $L^{\infty}D$ has performance comparable or superior to several existing notions of functional depth. In addition, we review how depth functions are evaluated and propose some improvements. In particular, we show that empirical depth function asymptotics can be mis--leading and instead propose a new method, the rank--rank plot, for evaluating empirical depth rank stability.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑