• Communications for Statistical Applications and Methods
• /
• 제11권2호
• /
• pp.275-285
• /
• 2004

We explore classification analysis using graphical methods such as sliced inverse regression and sliced average variance estimation based on dimension reduction. Some useful information about classification analysis are obtained by sliced inverse regression and sliced average variance estimation through dimension reduction. Two examples are illustrated, and classification rates by sliced inverse regression and sliced average variance estimation are compared with those by discriminant analysis and logistic regression.

• 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
• /
• 제24권5호
• /
• pp.533-541
• /
• 2017

Sufficient dimension reduction (SDR) replaces original p-dimensional predictors to a lower-dimensional linearly transformed predictor. The sliced inverse regression (SIR) has the longest and most popular history of SDR methodologies. The critical weakness of SIR is its known sensitive to the numbers of slices. Recently, a fused sliced inverse regression is developed to overcome this deficit, which combines SIR kernel matrices constructed from various choices of the number of slices. In this paper, the fused sliced inverse regression and SIR are compared to show that the former has a practical advantage in survival regression over the latter. Numerical studies confirm this and real data example is presented.

• 응용통계연구
• /
• 제10권2호
• /
• pp.293-308
• /
• 1997

일변량 분할 역회귀 방법은 일반화 회귀모형에서 효과적인 차원축약방향과 공간을 추정하는 방법이다. 본 논문에서는 두 일반화 회귀모형을 동시에 고려하여 효과적인 차원축약방향과 공간을 추정하는 방법으로 이변량 분할 역회귀를 제안한다. 이러한 이변량 분할 역회귀 방법은 모형식이 선형, 이차형, 삼차형, 비선형 등의 여러 모형식에서 효과적인 차원축약방향을 추정하며, 일변량 분할 역회귀에 비하여 모형에 존재하는 오차에 크게 영향을 받지 않고 효과적인 차원축약방향을 추정한다. 특히 모형식이 대칭의 이차형인 경우에 일변량 분할 역회귀 방법이 효과적인 차원축약방향을 추정하지 못하는 문제를 해결할 수 있다.

• Communications for Statistical Applications and Methods
• /
• 제25권5호
• /
• pp.513-521
• /
• 2018

The goal of sufficient dimension reduction (SDR) is to replace original p-dimensional predictors with a lower-dimensional linearly transformed predictor. The sliced inverse regression (SIR) (Li, Journal of the American Statistical Association, 86, 316-342, 1991) is one of the most popular SDR methods because of its applicability and simple implementation in practice. However, SIR may yield different dimension reduction results for different numbers of slices and despite its popularity, is a clear deficit for SIR. To overcome this, a fused sliced inverse regression was recently proposed. The study shows that the dimension-reduced predictors is robust to the numbers of the slices, but it does not investigate how robust its dimension determination is. This paper suggests a permutation dimension determination for the fused sliced inverse regression that is compared with SIR to investigate the robustness to the numbers of slices in the dimension determination. Numerical studies confirm this and a real data example is presented.

• 대한인간공학회지
• /
• 제6권1호
• /
• pp.3-8
• /
• 1987

This paper develops a statistical mode which estimates mental and physical loads of light work from sinus arrhythmia (SA) scores. During experiments, various levels of mental and physical loads (respectively scored by information processing and finger tapping rates) were imposed on subjects and SA scores were measured from the subjects. Two methods were used in developing workload estimation model. One is an algebraic inverse function of a multivariate regression equation, where mental and physical loads are independent variables and SA scores are dependent variables. The other is a statistical multivariate inverse regression. Of the two methods, inverse function resulted in larger mean squqre error in predicting mental and physical loads. Hence, inverse regression model is recommended for precise workload estimation.

• Communications for Statistical Applications and Methods
• /
• 제14권1호
• /
• pp.215-227
• /
• 2007

Variable selection algorithm for Sliced Inverse Regression using penalty function is proposed. We noted SIR models can be expressed as generalized eigenvalue decompositions and incorporated penalty functions on them. We found from small simulation that the HARD penalty function seems to be the best in preserving original directions compared with other well-known penalty functions. Also it turned out to be effective in forcing coefficient estimates zero for irrelevant predictors in regression analysis. Results from illustrative examples of simulated and real data sets will be provided.

• Communications for Statistical Applications and Methods
• /
• 제18권3호
• /
• pp.267-275
• /
• 2011

According to recent studies, Bayesian information criteria(BIC) is proposed to determine the structural dimension of the central subspace through sliced inverse regression(SIR) with high-dimensional predictors. The BIC may be useful in K-means clustering inverse regression(KIR) with high-dimensional predictors. However, the direct application of the BIC to KIR may be problematic, because the slicing scheme in SIR is not the same as that of KIR. In this paper, we present empirical penalty term studies of BIC in KIR to identify the most appropriate one. Numerical studies and real data analysis are presented.

• Communications for Statistical Applications and Methods
• /
• 제28권3호
• /
• pp.267-279
• /
• 2021

A regression with multi-dimensional responses is quite common nowadays in the so-called big data era. In such regression, to relieve the curse of dimension due to high-dimension of responses, the dimension reduction of predictors is essential in analysis. Sufficient dimension reduction provides effective tools for the reduction, but there are few sufficient dimension reduction methodologies for multivariate regression. To fill this gap, we newly propose two fused slice-based inverse regression methods. The proposed approaches are robust to the numbers of clusters or slices and improve the estimation results over existing methods by fusing many kernel matrices. Numerical studies are presented and are compared with existing methods. Real data analysis confirms practical usefulness of the proposed methods.

• ETRI Journal
• /
• 제44권5호
• /
• pp.805-815
• /
• 2022

The model-based evolutionary algorithms are divided into three groups: estimation of distribution algorithms, inverse modeling, and surrogate modeling. Existing inverse modeling is mainly applied to solve multi-objective optimization problems and is not suitable for many-objective optimization problems. Some inversed-model techniques, such as the inversed-model of multi-objective evolutionary algorithm, constructed from the Pareto front (PF) to the Pareto solution on nondominated solutions using a random grouping method and Gaussian process, were introduced. However, some of the most efficient inverse models might be eliminated during this procedure. Also, there are challenges, such as the presence of many local PFs and developing poor solutions when the population has no evident regularity. This paper proposes inverse modeling using random forest regression and uniform reference points that map all nondominated solutions from the objective space to the decision space to solve many-objective optimization problems. The proposed algorithm is evaluated using the benchmark test suite for evolutionary algorithms. The results show an improvement in diversity and convergence performance (quality indicators).