A Projection Pursuit Algorithm for Exploratory Data Analysis
نویسندگان
چکیده
منابع مشابه
A Projection Pursuit Algorithm for Exploratory Data Analysis
An algorithm for the analysis of multivariate data is presented, and discussed in terms of specific examples. The algorithm seeks to find oneand two-dimensional linear projections of multivariate data that are relatively highly revealing. *Supported by the U.S. Atomic Energy Commission under Contract AT(@+3)515. **Prepared in part in connection with research at Princeton University supported by...
متن کاملLocalized Exploratory Projection Pursuit
Based on CART, we introduce a recursive partitioning method for high dimensional space which partitions the data using low dimensional features. The low dimensional features are extracted via an exploratory projection pursuit (EPP) method, localized to each node in the tree. In addition, we present an exploratory splitting rule that is potentially less biased to the training data. This leads to...
متن کاملMulti-Objective Genetic Programming Projection Pursuit for Exploratory Data Modeling
For classification problems, feature extraction is a crucial process which aims to find a suitable data representation that increases the performance of the machine learning algorithm. According to the curse of dimensionality [4] theorem, the number of samples needed for a classification task increases exponentially as the number of dimensions (variables, features) increases. On the other hand,...
متن کاملProjection Pursuit for Exploratory Supervised Classification
In high-dimensional data, one often seeks a few interesting low-dimensional projections that reveal important features of the data. Projection pursuit is a procedure for searching high-dimensional data for interesting low-dimensional projections via the optimization of a criterion function called the projection pursuit index. Very few projection pursuit indices incorporate class or group inform...
متن کامل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 d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1974
ISSN: 0018-9340
DOI: 10.1109/t-c.1974.224051