• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1431-1434
• /
• 2005

In the steel production line, the molten metal of a furnace is transformed into billet and then moves to the heating furnace of the hot rolling mill. This paper describes about the development of recognition system for the characters, which was marked at the billet material by use template-marking plate and hand written method, in the steel plant. For the recognition of template-marked characters, we propose PSVM algorithm. And for the recognition of hand written character, we propose combination methods of CCD algorithm and PSVM algorithm. The PSVM algorithm need some more time than the conventional KLT or SVM algorithm. The CCD algorithm makes shorter classification time than the PSVM algorithm and good for the classification of closed curve characters from Arabic numerals. For the confirmation of algorithm, we have compared our algorithm with conventional methods such as KLT classifier and one-to-one SVM. The recognition rate of experimented billet characters shows that the proposing PSVM algorithm is 97 % for the template-marked characters and combinational algorithm of CCD & PSVM is 95.5 % for the hand written characters. The experimental results show that our proposing method has higher recognition rate than that of the conventional methods for the template-marked characters and hand written characters. By using our algorithm, we have installed real time character recognition system at the billet processing line of the steel-iron plant.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.22-27
• /
• 2006

압타머칩은 혈청(serum) 내의 지정된 단백질의 상대적 양을 직접 측정할 수 있는 바이오칩으로서, 의학적 질병 진단에 유용하게 사용할 수 있는 툴이다. 압타머칩 데이터 분석에는 기존의 마이크로어레이 분석기법을 그대로 적용할 수 있다. 본 논문에서는 Potential SVM(PSVM)을 이용하여, 심혈관질환 샘플 기반의 압타머칩 데이터에서 바이오마커 후보 단백질을 선정한 결과를 정리한다. PSVM은 분류 알고리즘으로서 뿐만 아니라 자질 선택(feature selection)에서도 우수한 성능을 보이는 알고리즘으로 알려져 있다. 심혈관 질환의 단계에 따라 구분한 4개 클래스, 135개 샘플로 구성된 3K 압타머칩 데이터에 대해 PSVM을 적용하여 자질을 선택하고 분류성능을 측정한 결과, 마이크로어레이에서의 자질 선택에 많이 사용되는 Gain Ratio 기법과 비교하여 보다 적은 수의 단백질 정보로 보다 나은 분류 성능을 보임을 확인하였다. 더불어, PSVM을 이용해 선택한 단백질군을 심혈관 질환 진단을 위한 바이오마커 후보로 제시한다.

• ETRI Journal
• /
• v.33 no.6
• /
• pp.924-934
• /
• 2011

Sensor networks play an important role in making the dream of ubiquitous computing a reality. With a variety of applications, sensor networks have the potential to influence everyone's life in the near future. However, there are a number of issues in deployment and exploitation of these networks that must be dealt with for sensor network applications to realize such potential. Localization of the sensor nodes, which is the subject of this paper, is one of the basic problems that must be solved for sensor networks to be effectively used. This paper proposes a probabilistic support vector machine (SVM)-based method to gain a fairly accurate localization of sensor nodes. As opposed to many existing methods, our method assumes almost no extra equipment on the sensor nodes. Our experiments demonstrate that the probabilistic SVM method (PSVM) provides a significant improvement over existing localization methods, particularly in sparse networks and rough environments. In addition, a post processing step for PSVM, called attractive/repulsive potential field localization, is proposed, which provides even more improvement on the accuracy of the sensor node locations.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.709-711
• /
• 2004

최근 단백질간의 상호작용의 중요성의 이해와 함께 축적되어 가는 단백질 정보들 간의 상호작용을 예측하기 위하여 통계학적 모델인 Support Vector Machine(SVM)을 사용한 예측 실험이 활발하다. 하지만 이는 거대한 생물 데이터를 처리하기 위해 많은 연산시간을 필요로 한다. 즉, 방대하게 존재하는 데이터를 처리하기 위해 SVM을 통한 실험은 정확한 결과뿐만 아니라 빠른 처리속도를 요구하게 되었다. 따라서 본 논문에서는 SVM의 개선을 통해 빠른 처리속도로 데이터를 처리하는 incremental SVM과 이를 병렬화 하여 더욱 빠른 처리시간을 가지는 Parallel SVM(PSVM)을 소개하고 실험해 본다. 즉, 단백질 상호작용에 사용되어지는 데이터를 PSVM을 사용한 실험을 통하여 정확성과 처리속도를 측정, 비교함으로써 단백질 상호작용 예측에 적합한지를 검증해본다.

• Communications for Statistical Applications and Methods
• /
• v.31 no.2
• /
• pp.235-246
• /
• 2024

In high-dimensional data analysis, sufficient dimension reduction (SDR) has been considered as an attractive tool for reducing the dimensionality of predictors while preserving regression information. The principal support vector machine (PSVM) (Li et al., 2011) offers a unified approach for both linear and nonlinear SDR. This article comprehensively explores a variety of SDR methods based on the PSVM, which we call principal machines (PM) for SDR. The PM achieves SDR by solving a sequence of convex optimizations akin to popular supervised learning methods, such as the support vector machine, logistic regression, and quantile regression, to name a few. This makes the PM straightforward to handle and extend in both theoretical and computational aspects, as we will see throughout this article.

• Bioinformatics and Biosystems
• /
• v.1 no.2
• /
• pp.134-138
• /
• 2006

Depression is the most common and widespread mood disorder. About 20% of the population might suffer a major, incapacitating episode of depression during their lifetime. This disorder can be classified into two types: major depressive disorders and bipolar disorder. Since pharmaceutical treatments are different according to types of depression disorders, correct and fast classification is quite critical for depression patients. Yet, classical statistical method, such as minnesota multiphasic personality inventory (MMPI), have some difficulties in applying to depression patients, because the patients suffer from concentration. We used electroencephalogram (EEG) analysis method fer classification of depression. We extracted nonlinearity of information flows between channels and estimated approximate entropy (ApEn) for the EEG at each channel. Using these attributes, we applied two types of data mining classification methods: decision tree and possibilistic support vector machines (PSVM). We found that decision tree showed 85.19% accuracy and PSVM exhibited 77.78% accuracy for classification of depression, 30 patients with major depressive disorder and 24 patients having bipolar disorder.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.241-254
• /
• 2011

Financial time-series forecasting is one of the most important issues because it is essential for the risk management of financial institutions. Therefore, researchers have tried to forecast financial time-series using various data mining techniques such as regression, artificial neural networks, decision trees, k-nearest neighbor etc. Recently, support vector machines (SVMs) are popularly applied to this research area because they have advantages that they don't require huge training data and have low possibility of overfitting. However, a user must determine several design factors by heuristics in order to use SVM. For example, the selection of appropriate kernel function and its parameters and proper feature subset selection are major design factors of SVM. Other than these factors, the proper selection of instance subset may also improve the forecasting performance of SVM by eliminating irrelevant and distorting training instances. Nonetheless, there have been few studies that have applied instance selection to SVM, especially in the domain of stock market prediction. Instance selection tries to choose proper instance subsets from original training data. It may be considered as a method of knowledge refinement and it maintains the instance-base. This study proposes the novel instance selection algorithm for SVMs. The proposed technique in this study uses genetic algorithm (GA) to optimize instance selection process with parameter optimization simultaneously. We call the model as ISVM (SVM with Instance selection) in this study. Experiments on stock market data are implemented using ISVM. In this study, the GA searches for optimal or near-optimal values of kernel parameters and relevant instances for SVMs. This study needs two sets of parameters in chromosomes in GA setting : The codes for kernel parameters and for instance selection. For the controlling parameters of the GA search, the population size is set at 50 organisms and the value of the crossover rate is set at 0.7 while the mutation rate is 0.1. As the stopping condition, 50 generations are permitted. The application data used in this study consists of technical indicators and the direction of change in the daily Korea stock price index (KOSPI). The total number of samples is 2218 trading days. We separate the whole data into three subsets as training, test, hold-out data set. The number of data in each subset is 1056, 581, 581 respectively. This study compares ISVM to several comparative models including logistic regression (logit), backpropagation neural networks (ANN), nearest neighbor (1-NN), conventional SVM (SVM) and SVM with the optimized parameters (PSVM). In especial, PSVM uses optimized kernel parameters by the genetic algorithm. The experimental results show that ISVM outperforms 1-NN by 15.32%, ANN by 6.89%, Logit and SVM by 5.34%, and PSVM by 4.82% for the holdout data. For ISVM, only 556 data from 1056 original training data are used to produce the result. In addition, the two-sample test for proportions is used to examine whether ISVM significantly outperforms other comparative models. The results indicate that ISVM outperforms ANN and 1-NN at the 1% statistical significance level. In addition, ISVM performs better than Logit, SVM and PSVM at the 5% statistical significance level.