arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.2370stat.MEstat.AP
收藏

树木主成分分析的新方法

New Approaches to Principal Component Analysis for Trees

Burcu Aydın, Gábor Pataki, Haonan Wang, Alim Ladha, Elizabeth Bullitt, J. S. Marron

摘要:

面向对象的数据分析是统计学中的一个新领域,它研究一般数据对象的总体。在这篇文章中,我们认为人口的树结构的对象作为我们的兴趣焦点。我们开发了改进的分析工具,数据躺在一个二叉树空间类似于经典的主成分分析方法在欧几里德空间。我们的PCA扩展是一维子空间的类似物,最适合的数据。以前的工作是基于树线的概念。在本文中,以前的树线概念的推广提出:k-树线。以前提出的树线是k树线,其中k=1。在这项工作中研究的k-树线的新的子情况是2-树线和树曲线,它解释了更多的变化,每个主成分比树线。最优主成分树系可在线性时间内计算。因为2-树线和树曲线更复杂,它们在计算上更昂贵,但产生改进的数据分析结果。我们提供了一个比较研究,所有这些方法的激励数据集组成的脑血管结构的98个主题。

英文摘要:

Object Oriented Data Analysis is a new area in statistics that studies populations of general data objects. In this article we consider populations of tree-structured objects as our focus of interest. We develop improved analysis tools for data lying in a binary tree space analogous to classical Principal Component Analysis methods in Euclidean space. Our extensions of PCA are analogs of one dimensional subspaces that best fit the data. Previous work was based on the notion of tree-lines. In this paper, a generalization of the previous tree-line notion is proposed: k-tree-lines. Previously proposed tree-lines are k-tree-lines where k=1. New sub-cases of k-tree-lines studied in this work are the 2-tree-lines and tree-curves, which explain much more variation per principal component than tree-lines. The optimal principal component tree-lines were computable in linear time. Because 2-tree-lines and tree-curves are more complex, they are computationally more expensive, but yield improved data analysis results. We provide a comparative study of all these methods on a motivating data set consisting of brain vessel structures of 98 subjects.

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

↑