Abstract
In this study a projection pursuit method is used to explore c d (square) contingency table data. The method operates on projection matrices constructed from the contingency tables using affine geometry and creates projections (or marginals) using a Radon transform. The projection matrices and the projections can be used to find the "interesting" (nonuniform structure), and to cluster and to order the, cases. This projection pursuit method is implemented with graph visualization of projection. It is similar to the discrete version of Andrews' curve. We demonstrate how this approach compares to association rules commonly used in data mining using a market basket data set and compare the PP results with the analysis of a data set from Wishart and Leach) (1970).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
