• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.703-705
• /
• 2004

Conventional support vector machines (SVMs) find optimal hyperplanes that have maximal margins by treating all data equivalently. In the real world, however, the data within a data set may differ in degree of uncertainty or importance due to noise, inaccuracies or missing values in the data. Hence, if all data are treated as equivalent, without considering such differences, the optimal hyperplanes identified are likely to be less optimal. In this paper, to more accurately identify the optimal hyperplane in a given uncertain data set, we propose a membership-induced distance from a hyperplane using membership values, and formulate three kinds of membership-induced SVMs.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.8
• /
• pp.1985-1996
• /
• 1994

A new design method of sliding hyperplanes is proposed in the synthesis of a variable structure controller for robust tracking of general nonlinear multi-input-output(MIMO) uncertain systems of relative degree higher than two. Input/ output(I/O) linearzation is firstly undertaken by employing the concept of relative degree and minimum phase followed by the construction of sliding mode controllers. Sliding hyperplanes are then derived from the inherent properties of companion matrix and ideal sliding mode characterized in I/O linearized system. Subsequently, the gradient magnitudes of the sling hyperplanes are determined in an optimal manner by considering a quadratic performance index to be evaluated at two phases; a reaching phase and a sliding phase. The proposed design methodology is relatively straightforward and systematic compared with conventional strategies such as geometric approach or pole assignment technique. A nonlinear governor and exciter control problem for a power system is adopted herein in order to demonstrate the design efficiency and also favorable and robust control performances.

• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.20-24
• /
• 2003

The analysis of DNA microarry data is one of the most important things for functional genomics research. The matrix representation of microarray data and its successive 'optimal' incisional hyperplanes is a useful platform for developing optimization algorithms to determine the optimal partitioning of pairwise proximity matrix representing completely connected and weighted graph. We developed Deterministic Annealing (DA) approach to determine the successive optimal binary partitioning. DA algorithm demonstrated good performance with the ability to find the 'globally optimal' binary partitions. In addition, the objects that have not been clustered at small non­zero temperature, are considered to be very sensitive to even small randomness, and can be used to estimate the reliability of the clustering.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.1
• /
• pp.59-64
• /
• 2010

To improve system performance, we apply the concept of membership function to Variance Considered Machines (VCMs) which is a modified algorithm of Support Vector Machines (SVMs) proposed in our previous studies. Many classification algorithms separate nonlinear data well. However, existing algorithms have ignored the fact that probabilities of error are very high in the data-mixed area. Therefore, we make our algorithm ignore data which has high error probabilities and consider data importantly which has low error probabilities to generate system output according to the probabilities of error. To get membership function, we calculate sigmoid function from the dataset by considering means and variances. After computation, this membership function is applied to the VCMs.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.71-77
• /
• 2019

This paper defines a multi-selection knapsack problem and presents an algorithm for seeking its optimal solution. Multi-selection means that all members of the particular group be selected or excluded. Our branch-and-bound algorithm introduces a simplex containing the feasible region of the original problem to exploit the fact that the most tightly underestimating function on the simplex is linear. In bounding operation, the subproblem defined over the candidate simplex is minimized. During the branching process the candidate simplex is splitted into two one-less dimensional subsimplices by being projected onto two hyperplanes. The approach of this paper can be applied to solving the global minimization problems under various types of the knapsack constraints.