• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.563-568
• /
• 2016

The word sense disambiguation problem is to find the correct sense of an ambiguous word having multiple senses in a dictionary in a sentence. We regard this problem as a multi-class classification problem and classify the ambiguous word by using Support Vector Machines. Context words of the ambiguous word, which are extracted from Sejong sense tagged corpus, are represented to two kinds of vector space. One vector space is composed of context words vectors having binary weights. The other vector space has vectors where the context words are mapped by word embedding model. After experiments, we acquired accuracy of 87.0% with context word vectors and 86.0% with word embedding model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1177-1183
• /
• 2009

In this paper, support vector machines (SVM) are applied to multi-user detector (MUD) for direct sequence (DS)-CDMA system. This work shows an analytical performance of SVM based multi-user detector with some of kernel functions, such as linear, sigmoid, and Gaussian. The basic idea in SVM based training is to select the proper number of support vectors by maximizing the margin between two different classes. In simulation studies, the performance of SVM based MUD with different kernel functions is compared in terms of the number of selected support vectors, their corresponding decision boundary, and finally the bit error rate. It was found that controlling parameter, in SVM training have an effect, in some degree, to SVM based MUD with both sigmoid and Gaussian kernel. It is shown that SVM based MUD with Gaussian kernels outperforms those with other kernels.

• Journal of Korean Medical classics
• /
• v.37 no.1
• /
• pp.41-56
• /
• 2024

Objectives : The purpose of this paper is to model each Xíng(行) of the Yīnyáng Wǔxíng(陰陽五行) theory as a vector, to interpret the Xiāngshēng Xiāngkè(相生相剋) theory as a vector sum, and argue the objectivity and universal applicability of the Xiāngshēng Xiāngkè(相生相剋) theory. Methods : The five xíngs of the Wǔxíng were modeled and expressed as vectors, and the Xiāngshēng Xiāngkè theories were quantitatively explained by vector summation. Results : We calculated the Wǔxíng vectors using the vector sum formula, and found that the Xíng vectors that received mutual support increased in size by about 62%, and the Xíng vectors that received opposition decreased in size by about 38%. Conclusions : This result could be considered as quantitative interpretation of the contents of the Xiāngshēng Xiāngkè(相生相剋) theory which has mostly been explained qualitatively. The results of this study could hopefully provide ideas to quantify various theories based on the Yinyangwuxing theory such as Korean Medicine and other traditional fields in East Asian culture.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.5
• /
• pp.31-36
• /
• 2011

In this paper, Mel-Frequency Cepstral Coefficient (MFCC), Decorrelated Filter Bank (DFB), Octave-based Spectral Contrast (OSC), Zero-Crossing Rate (ZCR), and Spectral Contract/Roll-Off are combined as a set of multiple feature-vectors for the music genre classification system based on the Support Vector Machine (SVM) classifier. In the conventional system, feature vectors for the entire genre classes are normalized for the SVM model training and classification. However, in this paper, selected feature vectors that are compared based on the One-Against-One (OAO) SVM classifier are only used for normalization. Using OSC as a single feature-vector and the multiple feature-vectors, we obtain the genre classification rates of 60.8% and 77.4%, respectively, with the conventional normalization method. Using the proposed normalization method, we obtain the increased classification rates by 8.2% and 3.3% for OSC and the multiple feature-vectors, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.59-66
• /
• 2022

This research conducted a study classifying gender of speakers by analyzing feature vectors extracted from the voice data. The study provides convenience in automatically recognizing gender of customers without manual classification process when they request any service via voice such as phone call. Furthermore, it is significant that this study can analyze frequently requested services for each gender after gender classification using a learning model and offer customized recommendation services according to the analysis. Based on the voice data of males and females excluding blank spaces, the study extracts feature vectors from each data using MFCC(Mel Frequency Cepstral Coefficient) and utilizes SVM(Support Vector Machine) models to conduct machine learning. As a result of gender classification of voice data using a learning model, the gender recognition rate was 94%.

• Journal of Korea Multimedia Society
• /
• v.10 no.7
• /
• pp.923-933
• /
• 2007

In this paper, we present a method for performance enhancement of the marker detection system by using SVM(Support Vector Machine) and LDA(Linear Discriminant Analysis). It converts the input image to a binary image and extracts contours of objects in the binary image. After that, it approximates the contours to a list of line segments. It finds quadrangle by using geometrical features which are extracted from the approximated line segments. It normalizes the shape of extracted quadrangle into exact squares by using the warping technique and scale transformation. It extracts feature vectors from the square image by using principal component analysis. It then checks if the square image is a marker image or a non-marker image by using a SVM classifier. After that, it computes feature vectors by using LDA for the extracted marker images. And it calculates the distance between feature vector of input marker image and those of standard markers. Finally, it recognizes the marker by using minimum distance method. Experimental results show that the proposed method achieves enhancement of recognition rate with smaller feature vectors by using LDA and it can decrease false detection errors by using SVM.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.67-76
• /
• 2012

Traffic classification plays an important role in traffic management. To traditional methods, P2P and encryption traffic may become a problem. Support Vector Machine (SVM) is a useful classification tool which is able to overcome the traditional bottleneck. The main disadvantage of SVM algorithms is that it's time-consuming to train large data set because of the quadratic programming (QP) problem. However, the useful support vectors are only a small part of the whole data. If we can discard the useless vectors before training, we are able to save time and keep accuracy. In this article, we discussed the feasibility to remove the useless vectors through a sequential method to accelerate training speed when dealing with large scale data.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.87-100
• /
• 2011

In this paper, we address a video summarization task as generating both visually salient and semantically important video segments. In order to find salient data points, one can use the OC-SVM (One-class Support Vector Machine), which is well known for novelty detection problems. It is, however, hard to incorporate into the OC-SVM process the importance measure of data points, which is crucial for video summarization. In order to integrate the importance of each point in the OC-SVM process, we propose a fuzzy version of OC-SVM. The Importance-based Fuzzy OC-SVM weights data points according to the importance measure of the video segments and then estimates the support of a distribution of the weighted feature vectors. The estimated support vectors form the descriptive segments that best delineate the underlying video content in terms of the importance and salience of video segments. We demonstrate the performance of our algorithm on several synthesized data sets and different types of videos in order to show the efficacy of the proposed algorithm. Experimental results showed that our approach outperformed the well known traditional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.142-147
• /
• 2008

In this paper, we propose a novel a roach to improve the performance of speech/music classification for the selectable mode vocoder (SMV) of 3GPP2 using the support vector machine (SVM). The SVM makes it possible to build on an optimal hyperplane that is separated without the error where the distance between the closest vectors and the hyperplane is maximal. We first present an effective analysis of the features and the classification method adopted in the conventional SMV. And then feature vectors which are a lied to the SVM are selected from relevant parameters of the SMV for the efficient speech/music classification. The performance of the proposed algorithm is evaluated under various conditions and yields better results compared with the conventional scheme of the SMV.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.4
• /
• pp.749-755
• /
• 2009

Support vector classification (SVC) provides more complete description of the lin-ear and nonlinear relationships between input vectors and classifiers. In this paper. we propose the sparse kernel classifier to solve the optimization problem of classification with a modified hinge loss function and absolute loss function, which provides the efficient computation and the sparsity. We also introduce the generalized cross validation function to select the hyper-parameters which affects the classification performance of the proposed method. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.