• Proceedings of the KIEE Conference
• /
• 2006.07b
• /
• pp.925-926
• /
• 2006

This paper presents a sensorless speed control of an interior permanent magnet synchronous motor using an adaptive integral binary observer and fuzzy logic controller. In view of composition with a main loop regulator and an auxiliary loop regulator, the binary observer has a property of the chattering alleviation in the constant boundary layer. However, the steady state estimation accuracy and robustness are dependent upon the width of the constant boundary. In order to improve the steady state performance of the binary observer, the binary observer is formed by adding extra integral dynamics to the switching hyperplane equation. Also, because the conventional fixed gain PI controller are very sensitive to step change of command speed, parameter variations and load disturbance, the fuzzy logic controller is used to compensate a fixed gain PI controller. Therefore, a gain PI is fixed and the IPMSM is drived at another speed region. The effectiveness of the proposed the adaptive integral observer and the fuzzy logic controller are confirmed by experimental results.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.5
• /
• pp.629-637
• /
• 2016

This paper presents a ballistic limit velocity measurement using the support vector machine that classifies two classes, the partial penetration and the complete penetration, by generating a linear separating hyperplane that equally divides the classes. For the ballistic limit velocity measurement, the previous methods(MIL-STD-662F and NIJ-STD-0101.06) have required a large number of experiments that caused high cost and time. However, the proposed method is not only flexible, requiring 0.85 ~ 4.8 times fewer experiments but also reliable, providing less than 2 % difference in results compared to the previous methods. For its validation, live fire experiments were conducted using various thickness SS400 iron plates as a target and two different types of live bullets such as 5.56 mm M193 and 7.62 mm M80.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.715-717
• /
• 2005

Support vector machine(SVM)은 최근 각광받는 기계학습 방법 중 하나로서, kernel function 이라는 사상(mapping)을 이용하여 입력 공간의 벡터를 classification이 용이한 특징 (feature) 공간의 벡터로 변환하는 것을 근간으로 한다. SVM은 이러한 특징 공간에서 두 클래스를 구분 짓는 hyperplane을 일련의 최적화 방법론을 사용하여 찾아내며, 주어진 문제가 convex problem 인 경우 항상 global optimal solution 을 보장하는 등의 장점을 지닌다. 한편 bioinformatics 연구에서 주로 사용되는 데이터는 측정 오류 등 일련의 오류를 포함하고 있으며, 이러한 오류는 기계학습 방법론이 어떤 decision boundary를 찾아내는가에 영향을 끼치게 된다. 특히 SVM의 경우 이러한 오류는 특징 공간 벡터간의 관계를 나타내는 Gram matrix를 변화로 나타나게 된다. 본 연구에서는 입력 공간에 오류가 발생할 때 그것이 SVM 의 decision boundary를 어떻게 변화시키는가를 대표적인 두 가지 kernel function, 즉 linear kernel과 Gaussian kernel에 대해 분석하였다. Wisconsin대학의 유방암(breast cancer) 데이터에 대해 실험한 결과, 데이터의 오류에 따른 SVM 의 classification 성능 변화 양상을 관찰하여 커널의 종류에 따라 SVM이 어떠한 특성을 보이는가를 밝혀낼 수 있었다. 또 흥미롭게도 어떤 조건 하에서는 오류가 크더라도 오히려 SVM 의 성능이 향상되는 것을 발견했는데, 이것은 바꾸어 생각하면 Gram matrix 의 일부를 변경하여 SVM 의 성능 향상을 꾀할 수 있음을 나타낸다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.3
• /
• pp.375-379
• /
• 2010

The support vector machine (SVM) has been widely used in variety pattern recognition problems applicable to recommendation systems due to its strong theoretical foundation and excellent empirical successes. However, SVM is sensitive to the presence of outliers since outlier points can have the largest margin loss and play a critical role in determining the decision hyperplane. For robust SVM, we limit the maximum value of margin loss which includes the non-convex optimization problem. Therefore, we proposed the design method of robust SVM using genetic algorithm (GA) which can solve the non-convex optimization problem. To demonstrate the performance of the proposed method, we perform experiments on various databases selected in UCI repository.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1110-1127
• /
• 2022

To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.209-216
• /
• 2009

The accurate estimation of software development cost is important to a successful development in software engineering. This paper presents a software cost estimation method using a support vector machine. Support vector machine is one of the efficient techniques for classification, and it is the classification method of input data based on Maximum-Margin Hyperplane. But SVM has the problem of the selection of optimal parameters, because it is dependent on user's parameters. This paper selects optimized SVM parameters using advanced method, and estimates software development cost. The proposed approach outperform some recent results reported in the literature.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.217-223
• /
• 2024

The current study aimed to evaluate the effectiveness of using Support Vector Machine (SVM) for political affiliation classification. The system was designed to analyze the political tweets collected from Twitter and classify them as positive, negative, and neutral. The performance analysis of the SVM classifier was based on the calculation of metrics such as accuracy, precision, recall, and f1-score. The results showed that the classifier had high accuracy and f1-score, indicating its effectiveness in classifying the political tweets. The implementation of SVM in this study is based on the principle of Structural Risk Minimization (SRM), which endeavors to identify the maximum margin hyperplane between two classes of data. The results indicate that SVM can be a reliable classification approach for the analysis of political affiliations, possessing the capability to accurately categorize both linear and non-linear information using linear, polynomial or radial basis kernels. This paper provides a comprehensive overview of using SVM for political affiliation analysis and highlights the importance of using accurate classification methods in the field of political analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3378-3393
• /
• 2014

We have witnessed the rapid development of information technology in recent years. One of the key phenomena is the fast, near-exponential increase of data. Consequently, most of the traditional data classification methods fail to meet the dynamic and real-time demands of today's data processing and analyzing needs--especially for continuous data streams. This paper proposes an improved incremental learning algorithm for a large-scale data stream, which is based on SVM (Support Vector Machine) and is named DS-IILS. The DS-IILS takes the load condition of the entire system and the node performance into consideration to improve efficiency. The threshold of the distance to the optimal separating hyperplane is given in the DS-IILS algorithm. The samples of the history sample set and the incremental sample set that are within the scope of the threshold are all reserved. These reserved samples are treated as the training sample set. To design a more accurate classifier, the effects of the data volumes of the history sample set and the incremental sample set are handled by weighted processing. Finally, the algorithm is implemented in a cloud computing system and is applied to study user behaviors. The results of the experiment are provided and compared with other incremental learning algorithms. The results show that the DS-IILS can improve training efficiency and guarantee relatively high classification accuracy at the same time, which is consistent with the theoretical analysis.

• Journal of KIISE:Software and Applications
• /
• v.36 no.10
• /
• pp.786-792
• /
• 2009

A kernel in support vector machines can be described as a similarity measure between data, and this measure is used to find an optimal hyperplane that classifies patterns. It is therefore important to effectively incorporate the characteristics of data into the similarity measure. To find an optimal similarity between amino acid sequences, we propose a real exponent exponential form of the two metrices, which are derived from the evolutionary relationships of amino acids and the hydrophobicity of amino acids. We prove that the proposed metric satisfies the conditions to be a metric, and we find a relation between the proposed metric and the metrics in the string kernels which are widely used for the processing of amino acid sequences and DNA sequences. In the prediction experiments on the cleavage site of the signal peptide, the optimal metric can be found in the proposed metrics.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.421-434
• /
• 2005

Machine learning has been extensively studied in recent years as effective tools in pattern classification problem. Although there have been several approaches to machine learning, we focus on the mathematical programming (in particular, multi-objective and goal programming; MOP/GP) approaches in this paper. Among them, Support Vector Machine (SVM) is gaining much popularity recently. In pattern classification problem with two class sets, the idea is to find a maximal margin separating hyperplane which gives the greatest separation between the classes in a high dimensional feature space. However, the idea of maximal margin separation is not quite new: in 1960's the multi-surface method (MSM) was suggested by Mangasarian. In 1980's, linear classifiers using goal programming were developed extensively. This paper proposes a new family of SVM using MOP/GP techniques, and discusses its effectiveness throughout several numerical experiments.