Projection pursuit for discrete data

Details Projection pursuit for discrete data Projection pursuit for discrete data

2008-05-20

arxiv.org/abs/0805.3043v1

IMS Collections 2008, Vol. 2, 265-288

Mathematics

Statistics Theory

Published in at http://dx.doi.org/10.1214/193940307000000482 the IMS Collections (http://www.imstat.org/publications/imscollec

Scientific paper

10.1214/193940307000000482

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.

Affiliated with

Also associated with

No associations

Rating

Projection pursuit for discrete data does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Projection pursuit for discrete data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projection pursuit for discrete data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300304