• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.9-21
• /
• 2015

The support vector machine has been successfully applied to various classification areas due to its flexibility and a high level of classification accuracy. However, when analyzing imbalanced data with uneven class sizes, the classification accuracy of SVM may drop significantly in predicting minority class because the SVM classifiers are undesirably biased toward the majority class. The weighted $L_2$-norm SVM was developed for the analysis of imbalanced data; however, it cannot identify irrelevant input variables due to the characteristics of the ridge penalty. Therefore, we propose the weighted $L_1$-norm SVM, which uses lasso penalty to select important input variables and weights to differentiate the misclassification of data points between classes. We demonstrate the satisfactory performance of the proposed method through simulation studies and a real data analysis.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

• Korean Journal of Cognitive Science
• /
• v.3 no.1
• /
• pp.1-24
• /
• 1991

This paper presents the Lexical Ambiguity Resolution System of Korean Language. This system uses Dependency grammar and Collative Semantics. Dependency grammar is used to analyze Korean syntactic dependency. A robust way to analyze a sentence is to establish links between individual words. Collative Semantics investigates the interplay between lexical ambiguity and semantics relations. Collative Semantics consists of sense-frame, semantic vector, collation, and screening. Our system was implemented by C programming language. This system analyzes sentences, discriminates the kinds of semantic relation between pairs of words senses in those sentences, and resolves lexical ambiguity.

• IE interfaces
• /
• v.24 no.2
• /
• pp.151-155
• /
• 2011

In this study, we propose a signomial classification method with ₀-regularization (₀-)which seeks a sparse signomial function by solving a mixed-integer program to minimize the weighted sum of the ₀-norm of the coefficient vector of the resulting function and the $L_1$-norm of loss caused by the function. $SC_0$ gives an explicit description of the resulting function with a small number of terms in the original input space, which can be used for prediction purposes as well as interpretation purposes. We present a practical implementation of $SC_0$ based on the mixed-integer programming and the column generation procedure previously proposed for the signomial classification method with $SL_1$-regularization. Computational study shows that $SC_0$ gives competitive performance compared to other widely used learning methods for classification.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.9
• /
• pp.451-458
• /
• 2000

This paper addresses the issues of the parameter error detection and identification in electric power systems. In this paper, the parameter error identification and estimation is carried out as part of the state estimation. A two stage estimation procedure is used to detect and identify the parameter errors. The suspected parameters are identified by the WLAV state estimator as the first stage. A new WLAV state estimator adding the suspected system parameters in the state vector is used to estimate the exact value of parameter errors. Supporting examples are given by using IEEE 14 bus system.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.481-485
• /
• 1989

The object of this parer is on the design of an broad board classifier for connected. Korean digit. Many approaches have been applied in speech recognition systems: parametric vector quantization, dynamic programming and hiden Markov model. In the 80's the neural network method, which is expected to solve complex speech recognition problems, came bach. We have chosen the rule based system for our model. The phoneme-groups that we wish to classify are vowel_like, plosive_like fricative_like, and stop_like.The data used are 1380 connected digits spoken by three untrained male speakers. We have seen 91.5% classification rate.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.92.2-92
• /
• 2001

This paper presents the time optimal reorientation solution of three-axis spacecraft which has only three magnetic torquers. It has been very difficult problem because the magnetic torquer generates only perpendicular to Earth magnetic field vector. In this paper, minimum-time solution using only magnetic torquer is solved using collocation method and nonlinear programming solver NPSOL. IGRF Earth magnetic field model used to simulate magnetic field. The result is verified by comparing to the result of numerical integration. The solution is obtained for the various reorientation maneuver of three axes rigid spacecraft. And the results show that all three axes of rigid spacecraft are controlled effectively only by magnetic torqure.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.23-29
• /
• 1996

The purpose of this study is to develope an Object-Oriented Graphic database management system to handle geographic data of geographic information systems. As the result of this study, unstructured vector model was developed to handle geographic data and graphic database management was implemented by object-oriented programming. This study was focused on liking function between graphic data and attribute data, and not focused on network analysis function.

• Journal of Power System Engineering
• /
• v.5 no.2
• /
• pp.43-49
• /
• 2001

For machining auto-mobile cam, the developed biarcs-fitting method eliminates the ridge problems in conventional straight-line fitting approximation or single-arc fitting of curve tool path where it leaves ridges of tool marks on the machined surface of the workpiece. The powerful advantage of this biarc method is demonstrated by applying it to the numerically controlled machining of a curved cam profile, also verified by using a CNC simulating program for auto-mobile cam profile. As a result, this algorithm may be used in CNC milling and turning for cam profile machining with short block line.