• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.420-427
• /
• 2017

This paper proposes a new method using Wide Line Detector based statistical shape Feature (WLDF) to identify whether or not a tongue is cracked; a cracked tongue is one of the most frequently used visible features for diagnosis in traditional Chinese Medicine (TCM). We first detected a wide line in the tongue image, and then extracted WLDF, such as the maximum length of each detected region, and the ratio between maximum length and the area of the detected region. We trained a binary support vector machine (SVM) based on the WLDF to build a classifier for cracked tongues. We conducted an experiment based on our proposed scheme, using 196 samples of cracked tongues and 245 samples of non-cracked tongues. The results of the experiment indicate that the recognition accuracy of the proposed method is greater than 95%. In addition, we provide an analysis of the results of this experiment with different parameters, demonstrating the feasibility and effectiveness of the proposed scheme.

• Communications for Statistical Applications and Methods
• /
• v.10 no.2
• /
• pp.595-601
• /
• 2003

In this paper we propose an on line training method for classification based on least squares support vector machine. Proposed method enables the computation cost to be reduced and the training to be peformed incrementally, With the incremental formulation of an inverse matrix in optimization problem, current information and new input data can be used for building the new inverse matrix for the estimation of the optimal bias and Lagrange multipliers, so the large scale matrix inversion operation can be avoided. Numerical examples are included which indicate the performance of proposed algorithm.

• Annual Conference on Human and Language Technology
• /
• 2003.10d
• /
• pp.267-272
• /
• 2003

음성 합성 시스템 구축에 있어서 입력 텍스트를 정확한 발음 표기로 변환하는 것은 매우 중요하다. 중국어에는 하나의 한자가 의미나 사용에 따라 다르게 발음되는 다음자(polyphony)들이 존재한다. 다음자의 처리는 상당히 복잡한 문제이기 때문에 본 논문에서는 그 중 가장 발음에 영향을 미치는 요소인 인명과 지명에 대한 미등록어 처리를 수행했다. 무엇보다 실시간 음성 합성 시스템을 위해서는 처리 속도의 향상이 요구된다. 따라서 본 연구에서는 미등록어 후보 구간 선정을 선행하고, 선정된 후보에 대해 추정하는 두 단계로 진행하였다. 후보 구간 선정은 단일 한자 단어(monosyllable word)의 확률과 간단한 패턴들을 이용한다. 최종 선정된 후보의 미등록어 추정은 SVM(Support Vector Machine)을 기반으로 실시하였다.

• Annual Conference on Human and Language Technology
• /
• 2003.10d
• /
• pp.261-266
• /
• 2003

문장이 길면 구문분석의 정확률이 크게 낮아진다. 따라서 장문을 분할하여 분석하면 구문분석의 복잡도를 크게 줄일 수 있어 정확률 향상에 크게 기여할 수 있다. 특히, 중국어는 고립어로서, 교착어나 융합어와 비교할 때 자연어처리에 도움을 줄 수 있는 굴절이나 어미정보가 없어 구문분석에 어려움이 더욱 많다. 반면, 중국어 문자에서는 쉼표를 비교적 많이 사용하고 있고 또한 쉼표의 쓰임이 정확하므로 구문 분석에 도움을 줄 수 있다. 본 논문에서는 쉼표가 많이 쓰이고 있는 중국어 문장에서 해당 쉼표위치 문장 분할가능여부를 Support Vector Machine을 이용 판단하여 정확률 88.61%의 높은 분할 성능을 보였다.

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.5
• /
• pp.1167-1177
• /
• 2017

The censored regression using the pseudo-response variable proposed by Buckley and James has been one of the most well-known models. Recently, the varying coefficient regression model has received a great deal of attention as an important tool for modeling. In this paper we propose a censored varying coefficient regression model using Buckley-James method to consider situations where the regression coefficients of the model are not constant but change as the smoothing variables change. By using the formulation of least squares support vector machine (LS-SVM), the coefficient estimators of the proposed model can be easily obtained from simple linear equations. Furthermore, a generalized cross validation function can be easily derived. In this paper, we evaluated the proposed method and demonstrated the adequacy through simulate data sets and real data sets.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.2
• /
• pp.609-617
• /
• 2006

A new fuzzy c-regression algorithm for switching regression analysis is presented, which combines fuzzy c-means clustering and least squares support vector machine. This algorithm can detect outliers in switching regression models while yielding the simultaneous estimates of the associated parameters together with a fuzzy c-partitions of data. It can be employed for the model-free nonlinear regression which does not assume the underlying form of the regression function. We illustrate the new approach with some numerical examples that show how it can be used to fit switching regression models to almost all types of mixed data.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10c
• /
• pp.240-245
• /
• 2006

본 논문에서는 의상에 대한 사용자 선호도를 찾아내는 기법에 대하여 기술한다. 의상에 대한 사용자 선호도를 찾기 위해서 의상 데이터에 대해 데이터 모델을 새롭게 제안한다. 이 데이터 모델을 기반으로 사용자의 의상관련 히스토리를 저장한다. 이렇게 저장된 히스토리 정보에 기계 학습 기법 중 최근 각광받고 있는 SVM 기법을 적용하여 사용자 선호도를 찾아내도록 하였다. 이 결과를 다른 학습 기법인 Naive Bayes 기법을 사용하여 의상에 대한 사용자 선호도를 검색한 성능과 비교하여 우리 모델이 더 좋다는 것을 확인하였다. 우리는 5명의 사용자에 대해서 동일한 취향을 갖는 사용자가 몇 명인지에 따라 A(모두 다름), B(2명), C(3명), D(4명), E(모두 같음) 형태별, 사용자별 1000건의 히스토리를 일정한 기준에 따라 생성했다. 그리고 이 중에서 900건을 학습용 데이터, 100건을 검증용 데이터로 선정하여 실험이 진행되었다.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.826-836
• /
• 2016

Mastering a musical instrument for an unskilled beginning learner is not an easy task. It requires playing every note correctly and maintaining the tempo accurately. Any music comes in two forms, a music score and it rendition into an audio music. The proposed method of assisting beginning music players in both aspects employs two popular pattern recognition methods for audio-visual analysis; they are support vector machine (SVM) for music score recognition and hidden Markov model (HMM) for audio music performance tracking. With proper synchronization of the two results, the proposed music learning assistant system can give useful feedback to self-training beginners.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.351-361
• /
• 2010

The solution of large sparse linear systems is one of the most important problems in large scale scientific computing. Among the many methods developed, the preconditioned Krylov subspace methods are considered the preferred methods. Selecting a suitable preconditioner with appropriate parameters for a specific sparse linear system presents a challenging task for many application scientists and engineers who have little knowledge of preconditioned iterative methods. The prediction of ILU type preconditioners was considered in [27] where support vector machine(SVM), as a data mining technique, is used to classify large sparse linear systems and predict best preconditioners. In this paper, we apply the data mining approach to the sparse approximate inverse(SAI) type preconditioners to find some parameters with which the preconditioned Krylov subspace method on the linear systems shows best performance.

• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.