Projection pursuit in high dimensions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Dimensional Feature Reduction via Projection Pursuit

................................................................................................................................... v 1 . INTROIIUCTION .................................................................................................................... 1 1.1 Background .............................................................................................................. ...

متن کامل

Multiplicative Models in Projection Pursuit

Friedman and Stuetzle (JASA, 1981) developed a methodology for modeling a response surface by the sum of general smooth functions of linear combinations of the predictor variables. Here multiplicative models for regression and categorical regression are explored. The construction of these models and their performance relative to additive models are examined. CHAPTER 0 INTRODUCTION In recent wor...

متن کامل

Functional Projection Pursuit

This article describes the adaption of exploratory projection pursuit for use with functional data. The aim is to nd \interesting" projections of functional data: e.g. to separate curves into meaningful clusters. Functional data are projected onto low-dimensional subspaces determined by a projection function using a suitable inner product. Such a projection is rapidly computed by representing d...

متن کامل

Oblique Projection Matching Pursuit

Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is...

متن کامل

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...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 2018

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.1801177115