New Approaches to Principal Component Analysis for Trees

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.

[1]  Tom M. W. Nye,et al.  Principal components analysis in the space of phylogenetic trees , 2011, 1202.5132.

[2]  Leo Breiman,et al.  Bagging Predictors , 1996, Machine Learning.

[3]  J. Marron,et al.  Object oriented data analysis: Sets of trees , 2007, 0711.3147.

[4]  S. Pizer,et al.  Measuring tortuosity of the intracerebral vasculature from MRA images , 2003, IEEE Transactions on Medical Imaging.

[5]  Carlos A. Alfaro,et al.  Dimension reduction in principal component analysis for trees , 2012, Comput. Stat. Data Anal..

[6]  E. L. Lawler,et al.  A Method for Solving Discrete Optimization Problems , 1966, Oper. Res..

[7]  Stephen R. Aylward,et al.  Initialization, noise, singularities, and scale in height ridge traversal for tubular object centerline extraction , 2002, IEEE Transactions on Medical Imaging.

[8]  Gabor Pataki,et al.  Visualizing the structure of large trees , 2010, 1001.0951.

[9]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[10]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[13]  Stephen R. Aylward,et al.  The effects of healthy aging on intracerebral blood vessels visualized by magnetic resonance angiography , 2010, Neurobiology of Aging.

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[15]  Gregory M. Constantine,et al.  Metric Models for Random Graphs , 1998 .

[16]  J. Marron,et al.  A Nonparametric Regression Model With Tree-Structured Response , 2012 .

[17]  Gabor Pataki,et al.  A Principal Component Analysis for Trees , 2008, 0810.0944.

[18]  Brian Everitt,et al.  Cluster analysis , 1974 .

[19]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[20]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[21]  William J. Cook,et al.  Combinatorial Optimization: Cook/Combinatorial , 1997 .