• Journal of the Korean Statistical Society
• /
• 제33권1호
• /
• pp.25-34
• /
• 2004

In this paper we propose a prediction method on the regression model with randomly censored observations of the training data set. The least squares support vector machine regression is applied for the regression function prediction by incorporating the weights assessed upon each observation in the optimization problem. Numerical examples are given to show the performance of the proposed prediction method.

• Earthquakes and Structures
• /
• 제17권1호
• /
• pp.63-73
• /
• 2019

This paper studies damage detection as an optimization problem. A new objective function based on changes in natural frequencies, and Natural Frequency Vector Assurance Criterion (NFVAC) was developed. Due to their easy and fast acquisition, natural frequencies were utilized to detect structural damages. Moreover, they are sensitive to stiffness reduction. The method presented here consists of two stages. Firstly, Finite Element Model (FEM) is updated. Secondly, damage severities and locations are determined. To minimize the proposed objective function, a new bio-inspired optimization algorithm called salp swarm was employed. Efficiency of the method presented here is validated by three experimental examples. The first example relates to three-story shear frame with two single damage cases in the first story. The second relates to a five-story shear frame with single and multiple damage cases in the first and third stories. The last one relates to a large-scale eight-story shear frame with minor damage case in the first and third stories. Moreover, the performance of Salp Swarm Algorithm (SSA) was compared with Particle Swarm Optimization (PSO). The results show that better accuracy is obtained using SSA than using PSO. The obtained results clearly indicate that the proposed method can be used to determine accurately and efficiently both damage location and severity in multi-story shear frames.

• Geomechanics and Engineering
• /
• 제32권3호
• /
• pp.271-291
• /
• 2023

Settlement estimation in cohesion materials is a crucial topic to tackle because of the complexity of the cohesion soil texture, which could be solved roughly by substituted solutions. The goal of this research was to implement recently developed machine learning features as effective methods to predict settlement (S_m) of shallow foundations over cohesion soil properties. These models include hybridized support vector regression (SVR), random forests (RF), and coot optimization algorithm (COM), and black widow optimization algorithm (BWOA). The results indicate that all created systems accurately simulated the S_m, with an R² of better than 0.979 and 0.9765 for the train and test data phases, respectively. This indicates extraordinary efficiency and a good correlation between the experimental and simulated S_m. The model's results outperformed those of ANFIS - PSO, and COM - RF findings were much outstanding to those of the literature. By analyzing established designs utilizing different analysis aspects, such as various error criteria, Taylor diagrams, uncertainty analyses, and error distribution, it was feasible to arrive at the final result that the recommended COM - RF was the outperformed approach in the forecasting process of S_m of shallow foundation, while other techniques were also reliable.

• East Asian mathematical journal
• /
• 제26권3호
• /
• pp.415-421
• /
• 2010

Many kinds of Minty's lemmas show that Minty-type variational inequality problems are very closely related to Stampacchia-type variational inequality problems. Particularly, Minty-type vector variational inequality problems are deeply connected with vector optimization problems. Liu et al. [10] considered vector variational inequalities for setvalued mappings by using scalarization approaches considered by Konnov [8]. Lee et al. [9] considered two kinds of Stampacchia-type vector variational inequalities by using four kinds of Stampacchia-type scalar variational inequalities and obtain the relations of the solution sets between the six variational inequalities, which are more generalized results than those considered in [10]. In this paper, the author considers the Minty-type case corresponding to the Stampacchia-type case considered in [9].

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제8권3호
• /
• pp.196-201
• /
• 2008

Statistical learning theory has three analytical tools which are support vector machine, support vector regression, and support vector clustering for classification, regression, and clustering respectively. In general, their performances are good because they are constructed by convex optimization. But, there are some problems in the methods. One of the problems is the subjective determination of the parameters for kernel function and regularization by the arts of researchers. Also, the results of the learning machines are depended on the selected parameters. In this paper, we propose an efficient method for objective determination of the parameters of support vector clustering which is the clustering method of statistical learning theory. Using evolutionary algorithm and bootstrap method, we select the parameters of kernel function and regularization constant objectively. To verify improved performances of proposed research, we compare our method with established learning algorithms using the data sets form ucr machine learning repository and synthetic data.

• Communications for Statistical Applications and Methods
• /
• 제30권3호
• /
• pp.245-258
• /
• 2023

This study proposes a modification to the objective function of the support vector machine for the linearly non-separable case of a binary classifier y_i ∈ {-1, 1}. The modification takes into account the position of each data item x_i from its corresponding class centroid. The resulting optimization function involves the centroid mean vector, and the spread of data besides the support vectors, which should be minimized by the choice of hyper-plane β. Theoretical assumptions have been tested to derive an optimal separable hyperplane that yields the minimal misclassification rate. The proposed method has been evaluated using simulation studies and real-life COVID-19 patient outcome hospitalization data. Results show that the proposed method performs better than the classical linear SVM classifier as the sample size increases and is preferred in the presence of correlations among predictors as well as among extreme values.

• 제어로봇시스템학회논문지
• /
• 제19권6호
• /
• pp.527-533
• /
• 2013

BCI (Brain-Computer Interface) is a system that transforms a subject's brain signal related to their intention into a control signal by classifying EEG (electroencephalograph) signals obtained during the imagination of movement of a subject's limbs. The BCI system allows us to control machines such as robot arms or wheelchairs only by imaging limbs. With the exact same experiment environment, activated brain regions of each subjects are totally different. In that case, a simple approach is to use as many channels as possible when measuring brain signals. However the problem is that using many channels also causes other problems. When applying a CSP (Common Spatial Pattern), which is an EEG extraction method, many channels cause an overfitting problem, and in addition there is difficulty using this technique for medical analysis. To overcome these problems, we suggest an optimal channel selection method using a BPSO (Binary Particle Swarm Optimization), BPSO with channel impact factor, and GA. This paper examined optimal selected channels among all channels using three optimization methods and compared the classification accuracy and the number of selected channels between BPSO, BPSO with channel impact factor, and GA by SVM (Support Vector Machine). The result showed that BPSO with channel impact factor selected 2 fewer channels and even improved accuracy by 10.17~11.34% compared with BPSO and GA.

• 한국가스학회지
• /
• 제16권1호
• /
• pp.26-32
• /
• 2012

화학물질의 화재위험을 나타내는 가장 중요한 물성의 하나인 자연발화점의 실험 데이터는 그 필요에도 불구하고 데이터를 얻는 것이 어려운 경우가 많다. 이 연구에서는 DIPPR 801에서 얻은 503개 유기물의 자연발화점 실험데이터로부터 자연발화점을 예측하는 부분최소자승법(PLS) 및 support vector machine(SVM) 모델을 만들고 비교하였다. 그룹기여법을 이용하여 59개 작용기가 이 예측모델의 독립변수가 되었다. 두 모델에서 결정해야 할 매개변수는 교차검증으로 계산된 오차를 이용하여 결정되었고, SVM모델은 그 매개변수가 많아 particle swarm optimization을 이용한 최적화를 이용하였다. 전체 데이터에 대해 계산된 평균절대오차는 PLS가 58.59K였고, SVM이 29.11K여서 SVM이 PLS에 비해 매우 우수한 예측성능을 보였다.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 추계학술발표회 논문집
• /
• pp.341-345
• /
• 2003

This study develops modeling processes for alignment optimization considering characteristics of intersections using genetic algorithms and GIS for road alignment optimization. Since existing highway alignment optimization models have neglected the characteristics of intersections, they have shown serious weaknesses for real applications. In this paper, intersection costs include earthwork, right-of-way, pavement, accident, delay and fuel consumption costs that are sensitive and dominating to alignments. Also, local optimization of intersections for saving good alignment alternatives is developed and embedded. A highway alignment is described by parametric representation in space and vector manipulation is used to find the coordinates of intersections and other interesting points. The developed intersection cost estimation model is sufficiently precise for estimating intersection costs and eventually enhancing the performance of highway alignment optimization models. Also, local optimization of intersections can be used for improving search flexibility, thus allowing more effective intersections. It also provides a basis for extending the alignment optimization from single highways to networks. The presented two artificial examples show that the total intersection costs are substantial and sensitive to highway alignments.

• East Asian mathematical journal
• /
• 제6권2호
• /
• pp.159-165
• /
• 1990