Projection pursuit for discrete data

DOI10.1214/193940307000000482MaRDI QIDQ3626776zbMATH OpenOpenAlexFDO

Authors Persi Diaconis, Julia Salzman

Publication date 22 May 2009

Published in Institute of Mathematical Statistics Collections (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0805.3043, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.323.8987

zbMATH Keywords

binary vectordiscrete Radon transformleast uniform partitionphylogenetic treePlatorankingsyllable patterns

Mathematics Subject Classification ID

Radon transform (44A12) Multivariate analysis (62H99) Applications of statistics (62P99) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Linguistics (91F20)

Abstract: This paper develops projection pursuit for discrete data using the discrete Radon transform. Discrete projection pursuit is presented as an exploratory method for finding informative low dimensional views of data such as binary vectors, rankings, phylogenetic trees or graphs. We show that for most data sets, most projections are close to uniform. Thus, informative summaries are ones deviating from uniformity. Syllabic data from several of Plato's great works is used to illustrate the methods. Along with some basic distribution theory, an automated procedure for computing informative projections is introduced.

Recommendations

• Projection-pursuit approach for categorical data
• Projection pursuit exploratory data analysis
• On projection pursuit regression
• scientific article; zbMATH DE number 3960797
• Projection pursuit discriminant analysis
• scientific article; zbMATH DE number 66823
• scientific article; zbMATH DE number 4018127

Cited in

(4)

• Skewness-based projection pursuit: a computational approach
• A projection pursuit method on the multidimensional squared contingency table
• Smoothing categorical data
• A Computational Perspective on Projection Pursuit in High Dimensions: Feasible or Infeasible Feature Extraction

This page was built for publication: Projection pursuit for discrete data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626776)