• 한국패션뷰티학회지
• /
• 제2권3호
• /
• pp.60-67
• /
• 2004

Representing all the parts of human body visible to fit into the script, it can be told that real make-up has been done. Based on the point of view. it will be different from others. To become the beautiful, beauty make-up has to be done, however, to be someone described in the script or any other factions after analyzing characters of being represented, special make-up fits into that category. In the special make-up, there are two different pins: one is 2 dimension make-up which is describing images using dots, lines and colors and other is 3 dimension which will include necessary shapes to figure. Even though there seems to be different between modern technologies and handy work, since accurate measures and graphics have to be used to make perfect character describes in the script, more investments and studies than before have to be made. Real attraction of 3 dimension make-up is building up the images and shapes using unseen abstract images having analyzing characters. It will be decided in the working process called modeling. As having distinguished this part from other make-ups as named prosthetics make-up, proposing means and measures of prosthetics make-up will actually help the others who are studying make-up.

• 조명전기설비학회논문지
• /
• 제30권2호
• /
• pp.37-42
• /
• 2016

This paper proposes a method to develop a high-precision dimension measurement system using a linear variable differential transformer sensor. The Dimension targets for measurement is carbon material vanes of key element in the rotating parts within vehicle circulating pump. Data acquisition system for dimension measurement is designed using the NI Compact RIO. And the program applying the dimension measurement algorithm is built using NI LabVIEW. The dimension measuring program is composed of a FPGA program, Real Time program and Host program. The method of the experiment compares master vane with target vane for measure the length of the carbon material vane. The experimental results confirmed the usefulness of the accuracy within ${\pm}4um$.

• Communications for Statistical Applications and Methods
• /
• 제27권4호
• /
• pp.431-443
• /
• 2020

The K-means clustering algorithm has had successful application in sufficient dimension reduction. Unfortunately, the algorithm does have reproducibility and nestness, which will be discussed in this paper. These are clear deficits for the K-means clustering algorithm; however, the hierarchical clustering algorithm has both reproducibility and nestness, but intensive comparison between K-means and hierarchical clustering algorithm has not yet been done in a sufficient dimension reduction context. In this paper, we rigorously study the two clustering algorithms for two popular sufficient dimension reduction methodology of inverse mean and clustering mean methods throughout intensive numerical studies. Simulation studies and two real data examples confirm that the use of hierarchical clustering algorithm has a potential advantage over the K-means algorithm.

• Communications for Statistical Applications and Methods
• /
• 제28권2호
• /
• pp.205-215
• /
• 2021

Sufficient dimension reduction is useful dimension reduction tool in regression, and sliced inverse regression (Li, 1991) is one of the most popular sufficient dimension reduction methodologies. In spite of its popularity, it is known to be sensitive to the number of slices. To overcome this shortcoming, the so-called fused sliced inverse regression is proposed by Cook and Zhang (2014). Unfortunately, the two existing methods do not have the direction application to large p-small n regression, in which the dimension reduction is desperately needed. In this paper, we newly propose seeded sliced inverse regression and seeded fused sliced inverse regression to overcome this deficit by adopting iterative projection approach (Cook et al., 2007). Numerical studies are presented to study their asymptotic estimation behaviors, and real data analysis confirms their practical usefulness in high-dimensional data analysis.

• Communications for Statistical Applications and Methods
• /
• 제31권2호
• /
• pp.213-234
• /
• 2024

In recent decades, increasing research attention has been directed toward predicting the price of stocks in financial markets using deep learning methods. For instance, recurrent neural network (RNN) is known to be competitive for datasets with time-series data. Long short term memory (LSTM) further improves RNN by providing an alternative approach to the gradient loss problem. LSTM has its own advantage in predictive accuracy by retaining memory for a longer time. In this paper, we combine both supervised and unsupervised dimension reduction methods with LSTM to enhance the forecasting performance and refer to this as a dimension reduction based LSTM (DR-LSTM) approach. For a supervised dimension reduction method, we use methods such as sliced inverse regression (SIR), sparse SIR, and kernel SIR. Furthermore, principal component analysis (PCA), sparse PCA, and kernel PCA are used as unsupervised dimension reduction methods. Using datasets of real stock market index (S&P 500, STOXX Europe 600, and KOSPI), we present a comparative study on predictive accuracy between six DR-LSTM methods and time series modeling.

• 한국컴퓨터정보학회논문지
• /
• 제17권1호
• /
• pp.161-169
• /
• 2012

일반적으로 유클리드 최소신장트리는 2차원 평면상에 존재하는 입력노드들이 최소 비용으로 연결된 것이다. 그러나 생성된 유클리드 최소신장트리는 3차원의 현실세계에 적용할 경우 그 연결비용은 최소비용이 아닐 수 있다. 본 논문에서는 3차원 공간상에 존재하는 입력노드를 최단 길이로 연결하는 3차원 유클리드 최소신장트리를 제안한다. 100%의 공간비율의 3차원 공간상에 존재하는 30,000개의 입력 노드에 대한 실험에서, 본 논문에서 제안된 방법에 생성된 트리는, Prim의 2차원 최소신장트리 알고리즘에 의해 생성된 유클리드 최소신장트리에 비해, 2차원 평면에서만 고려했을 때 251.2%의 연결 비용의 증가를 보이지만 이것은 3차원 실세계에서는 의미가 없다. 본 논문에서 제안된 방법에 의해 생성된 트리는 3차원 공간에서는 90.0%의 비용의 절감율을 보인다. 이는 제안된 방법이 3차원적 연결에 관한 많은 현실적인 문제에 잘 적용될 수 있음을 나타낸다.

• Communications for Statistical Applications and Methods
• /
• 제19권4호
• /
• pp.559-569
• /
• 2012

Compositional data consist of compositions that are non-negative vectors of proportions with the unit-sum constraint. In disciplines such as petrology and archaeometry, it is fundamental to statistically analyze this type of data. Aitchison (1983) introduced a log-contrast principal component analysis that involves logratio transformed data, as a dimension-reduction technique to understand and interpret the structure of compositional data. However, the analysis is not usable when zero values are present in the data. In this paper, we introduce 4 possible methods to reduce the dimension of compositional data with zero values. Two real data sets are analyzed using the methods and the obtained results are compared.

• Communications for Statistical Applications and Methods
• /
• 제24권3호
• /
• pp.303-315
• /
• 2017

Yoo (2015, Statistics and Probability Letters, 99, 109-113) derives theoretical results in an optimal sufficient dimension reduction with singular inner-product matrix. The results are promising, but Yoo (2015) only presents one simulation study. So, an evaluation of its practical usefulness is necessary based on numerical studies. This paper studies the asymptotic behaviors of Yoo (2015) through various simulation models and presents a real data example that focuses on ordinary least squares. Intensive numerical studies show that the $x^2$ test by Yoo (2015) outperforms the existing optimal sufficient dimension reduction method. The basis estimation by the former can be theoretically sub-optimal; however, there are no notable differences from that by the latter. This investigation confirms the practical usefulness of Yoo (2015).

• Communications for Statistical Applications and Methods
• /
• 제29권5호
• /
• pp.603-614
• /
• 2022

The naive Bayes classifier is one of the most straightforward classification tools and directly estimates the class probability. However, because it relies on the independent assumption of the predictor, which is rarely satisfied in real-world problems, its application is limited in practice. In this article, we propose employing sufficient dimension reduction (SDR) to substantially improve the performance of the naive Bayes classifier, which is often deteriorated when the number of predictors is not restrictively small. This is not surprising as SDR reduces the predictor dimension without sacrificing classification information, and predictors in the reduced space are constructed to be uncorrelated. Therefore, SDR leads the naive Bayes to no longer be naive. We applied the proposed naive Bayes classifier after SDR to build a recommendation system for the eyewear-frames based on customers' face shape, demonstrating its utility in the top-k classification problem.

• Communications for Statistical Applications and Methods
• /
• 제29권5호
• /
• pp.615-627
• /
• 2022

Principal Fitted Component (PFC) is a semi-parametric sufficient dimension reduction (SDR) method, which is originally proposed in Cook (2007). According to Cook (2007), the PFC has a connection with other usual non-parametric SDR methods. The connection is limited to sliced inverse regression (Li, 1991) and ordinary least squares. Since there is no direct comparison between the two approaches in various forward regressions up to date, a practical guidance between the two approaches is necessary for usual statistical practitioners. To fill this practical necessity, in this paper, we newly derive a connection of the PFC to covariance methods (Yin and Cook, 2002), which is one of the most popular SDR methods. Also, intensive numerical studies have done closely to examine and compare the estimation performances of the semi- and non-parametric SDR methods for various forward regressions. The founding from the numerical studies are confirmed in a real data example.