Three-dimensional projection pursuit

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Authors Guy P Nason Statistics
Journal/Conference Name APPLIED STATISTICS
Paper Category
Paper Abstract SUMMARY The development and use of an approach to three-dimensional projection pursuit are discussed. The well-established Jones and Sibson moments index is chosen as a computationally efficient projection index to extend to three dimensions. The three-dimensional index was initially developed to find interesting linear combinations of spectral bands in a multispectral image. Computer algebraic methods are extensively employed to handle the complex formulae that constitute the index; these methods are explained in detail. A discussion of important practical issues such as interpreting projection solutions, dealing with outliers and optimization techniques completes the description of the index. An artificial tetrahedral data set is used to demonstrate how threedimensional projection pursuit can produce better clusters than those obtained by principal components analysis. The main example shows how three-dimensional projection pursuit can successfully combine bands to discover alternative clusters to those produced by, say, principal components.
Date of publication 1995
Code Programming Language R
Comment

Copyright Researcher 2021