• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2007.04a
• /
• pp.37-40
• /
• 2007

As a demand for underground structure is increasing with more parking and retail spaces required. Various construction methods are reviewed and selected for each specific site for economical and fast construction. In this study, factors for selecting construction methods were categorized for substructure construction. Construction processes of substructure are consisted of methods for excavation, earth retaining systems, and placement of slabs. Factors for the selection of substructure construction method are the condition of surrounding, geotechnical, information and constraint by comfortness for others nearby. After survey for the construction data of 5 different sites, analysis about reliable substructure construction selection method was suggested.

• Communications for Statistical Applications and Methods
• /
• v.14 no.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
• /
• v.4 no.2
• /
• pp.453-463
• /
• 1997

Nonparametric kernel regression has recently gained widespread acceptance as an attractive method for the nonparametric estimation of the mean function from noisy regression data. Also, the practical implementation of kernel method is enhanced by the availability of reliable rule for automatic selection of the bandwidth. In this article, we propose a method for automatic selection of the bandwidth that minimizes the asymptotic mean square error. Then, the estimated bandwidth by the proposed method is compared with the theoretical optimal bandwidth and a bandwidth by plug-in method. Simulation study is performed and shows satisfactory behavior of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.151-159
• /
• 1997

In sample surveys, we expect preferred samples that reduce the survey cost and increase the precision of estimators will be selected. Goodman and Kish (1950) introduced controlled selection as a method of sample selection that increases the probability of drawing preferred samples, while decreases the probability of drawing nonpreferred samples. In this paper, we obtain the controlled plans using the maximum entropy principle, and when the order of nonpreferred samples is considered, we propose the algorithm to obtain a controlled plan.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.627-635
• /
• 2003

In this short communication we discuss the bias problem of C4.5 in split variable selection and suggest a method to reduce the variable selection bias among categorical predictor variables. A penalty proportional to the number of categories is applied to the splitting criterion gain of C4.5. The results of empirical comparisons show that the proposed modification of C4.5 reduces the size of classification trees.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.177-183
• /
• 1997

A data-adaptive order selection procedure is proposed for local polynomial nonparametric regression. For each given polynomial order, bias and variance are estimated and the adaptive polynomial order that has the smallest estimated mean squared error is selected locally at each location point. To estimate mean squared error, empirical bias estimate of Ruppert (1995) and local polynomial variance estimate of Ruppert, Wand, Wand, Holst and Hossjer (1995) are used. Since the proposed method does not require fitting polynomial model of order higher than the model order, it is simpler than the order selection method proposed by Fan and Gijbels (1995b).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1047-1054
• /
• 2009

Local smoothing jump detection procedure is a popular method for detecting jump locations and the performance of the jump detector heavily depends on the choice of the bandwidth. However, little work has been done on this issue. In this paper, we propose the bootstrap bandwidth selection method which can be used for any kernel-based or local polynomial-based jump detector. The proposed bandwidth selection method is fully data-adaptive and its performance is evaluated through a simulation study and a real data example.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1297-1304
• /
• 2008

This paper proposes a machine learning approach for language-independent sentence boundary detection. The proposed method requires no heuristic rules and language-specific features, such as part-of-speech information, a list of abbreviations or proper names. With only the language-independent features, we perform experiments on not only an inflectional language but also an agglutinative language, having fairly different characteristics (in this paper, English and Korean, respectively). In addition, we obtain good performances in both languages. We have also experimented with the methods under a wide range of experimental conditions, especially for the selection of useful features.

• Communications for Statistical Applications and Methods
• /
• v.1 no.1
• /
• pp.41-51
• /
• 1994

We consider nonparametric procedures for the selection and ranking problems. Tukey's generalized lambda distribution is condidered as the distribution for the score function because the distribution can approximate many well-known contionuous distributions. Also we compare these procedures in terms of efficiency, defined by the ratio of a probability of a correct selection divided by the expected selected subset size.