arXiv · 0805.3043
Projection pursuit for discrete data
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.
Explore related subjects
Keep this discovery
Persi Diaconis, Julia Salzman. 2008-05-20. Projection pursuit for discrete data. https://doi.org/10.1214/193940307000000482
Cite the original work for its findings. Save a collection to share your selection of sources.