• Journal of the Korean Data and Information Science Society
• /
• 제5권1호
• /
• pp.1-10
• /
• 1994

Projection pursuit(PP) is a computer-intensive method which seeks out interesting linear projections of multivariate data onto a lower dimension space by machine. By working with lower dimensional projections, projection pursuit avoids the sparseness of high dimensional data. We show through simulation that two projection pursuit discriminant mothods proposed by Chen(1989) and Huber(1985) do not improve very much the error rate than the existing methods and compare several classification procedures.

• Communications for Statistical Applications and Methods
• /
• 제7권3호
• /
• pp.633-641
• /
• 2000

In this paper, we propose a method to identify multiple outliers in regression analysis with only assumption of smoothness on the regression function. Our method uses single-linkage clustering algorithm and Projection Pursuit Regression (PPR). It was compared with existing methods using several simulated and real examples and turned out to be very useful in regression problem with the regression function which is far from linear.

• Journal of the Korean Statistical Society
• /
• 제31권4호
• /
• pp.519-532
• /
• 2002

K-means clustering is a well-known partitioning method of multivariate observations. Recently, the method is implemented broadly in data mining softwares due to its computational efficiency in handling large data sets. However, it does not yield a suitable visual display of multivariate observations that is important especially in exploratory stage of data analysis. The aim of this study is to develop a K-means clustering method that enables visual display of multivariate observations in a low-dimensional space, for which the projection pursuit method is adopted. We propose a computationally inexpensive and reliable algorithm and provide two numerical examples.

• International Journal of Control, Automation, and Systems
• /
• 제4권6호
• /
• pp.705-713
• /
• 2006

For the analysis of multiunit extracellular neural signals as multiple spike trains, neural spike sorting is essential. Existing algorithms for the spike sorting have been unsatisfactory when the signal-to-noise ratio(SNR) is low, especially for implementation of fully-automated systems. We present a novel method that shows satisfactory performance even under low SNR, and compare its performance with a recent method based on principal component analysis(PCA) and fuzzy c-means(FCM) clustering algorithm. Our system consists of a spike detector that shows high performance under low SNR, a feature extractor that utilizes projection pursuit based on negentropy maximization, and an unsupervised classifier based on Gaussian mixture model. It is shown that the proposed feature extractor gives better performance compared to the PCA, and the proposed combination of spike detector, feature extraction, and unsupervised classification yields much better performance than the PCA-FCM, in that the realization of fully-automated unsupervised spike sorting becomes more feasible.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.467-482
• /
• 2000

Testing equality of two and k distributions has long been an interesting issue in statistical inference. To overcome the sparseness of data points in high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained, some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation for the statistics the based on Number theoretic method is applied. Several simulation experiments are performed.

• 응용통계연구
• /
• 제5권1호
• /
• pp.103-111
• /
• 1992

다변량 통계분석기법중 하나로 제기된 투사지향방법은 다변량자료를 관심있는 일차원 또는 이차원의 자료로의 선형투사를 찾아 나가는 방법이다. 이 방법은 다변량 자료가 갖는 차원의 문제를 해결해 줄 수 있는 유용한 기법으로 제시되었다. 본 연구에서는 투사지향방법을 이용하여 추정한 다변량 확률밀도함수를 사용한 새로운 비모수적인 판별분석방법을 제시하고, 이를 기존의 모수적 판별분석방법중 실제적으로 많이 사용되는 선형판별함수방법, 그리고 기존의 비모수적 판별분석방법중 계산상의 편리성이 많은 K-최인접방법과 컴퓨터 시뮬레이션을 통하여 비교분석하였다.

• Journal of applied mathematics & informatics
• /
• 제8권2호
• /
• pp.361-370
• /
• 2001

Testing equality of covariance matrix of k populations has long been an interesting issue in statistical inference. To overcome the sparseness of data points in a high-dimensional space and deal with the general cases, we suggest several projection pursuit type statistics. Some results on the limiting distributions of the statistics are obtained. some properties of Bootstrap approximation are investigated. Furthermore, for computational reasons an approximation which is based on Number theoretic method for the statistics is adopted. Several simulation experiments are performed.

• Communications for Statistical Applications and Methods
• /
• 제9권1호
• /
• pp.213-220
• /
• 2002

Anthropometric survey is important as a basis for human engineering fields. According to our experiences, there are difficulties in obtaining the measurements of some body parts because respondents are reluctant to expose. In order to overcome these difficulties, we propose a method for estimating such hard-to-measure measurements by using easy-to-measure measurements those are closely related to them. Multiple Regression Model, Feedforward Neural Network(FNN) Model and Projection Pursuit Regression(PPR) Model will be used as analytical tools for this purpose. The method we propose will be illustrated with real data from the 1992 Korea national anthropometric survey.

• 응용통계연구
• /
• 제29권6호
• /
• pp.1061-1075
• /
• 2016

본 논문에서는 고차원 대용량 자료의 시각화에서 발생할 수 있는 문제점들을 살펴보고 이에 대하여 개발된 방법들에 대하여 논의하였다. 고차원 자료의 경우 2차원 공간상에 표현하기 위하여 중요 변수를 선택해야하며 다양한 시각적 표현 속성과 다면화 방법을 이용하여 좀 더 많은 변수들을 표현할 수 있었다. 또한 관심있는 뷰를 보이는 낮은 차원을 찾는 사영추정방법을 이용할 수 있다. 대용량 자료에서는 점들이 겹쳐지는 문제점을 흩트림과 알파 블렌딩 등을 이용하여 해결할 수 있었다. 또한 고차원 대용량 자료의 탐색을 위하여 개발된 R 패키지인 tabplot과 scagnostics, 그리고 대화형 웹 그래프를 위한 다양한 형태의 R 패키지들을 살펴보았다.

• 전기전자학회논문지
• /
• 제25권1호
• /
• pp.76-82
• /
• 2021

In this paper, the compressed sensing basic pursuit denoise algorithm adopted to synthetic aperture radar imaging is investigated to improve the object recognition. From the incomplete data sets for image processing, the compressed sensing algorithm had been integrated to recover the data before the conventional back- projection algorithm was involved to obtain the synthetic aperture radar images. This method can lead to the reduction of measurement events while scanning the objects. An ultra-wideband radar scheme using a stripmap synthetic aperture radar algorithm was utilized to detect objects hidden behind the box. The Ultra-Wideband radar system with 3.1~4.8 GHz broadband and UWB antenna were implemented to transmit and receive signal data of two conductive cylinders located inside the paper box. The results confirmed that the images can be reconstructed by using a 30% randomly selected dataset without noticeable distortion compared to the images generated by full data using the conventional back-projection algorithm.