• Transactions of the Korean Society of Mechanical Engineers
• /
• v.14 no.5
• /
• pp.1059-1068
• /
• 1990

The minimum weight design for the simply-supported eccentrically stiffened plates subjected to combined loads is studied according to the stiffening configuration. The optimal programming is accomplished by formulating the design requirements in terms of a mathematical programming problem, and by using the gradient projection algorithm. The Huber type equilibrium equation is used as the governing equation for the overall buckling. The overall buckling of stiffened plates and the local buckling of the unstiffened plate between stiffeners and the stiffeners themselves are used as behavior constraints. Results of design examples for the orthogonally stiffening case compared with those of the other study support that the present study is feasible. Design examples for the symmetrically oblique stiffening case are presented and the results indicate that a significant improvement in design efficiency may be achieved through symmetrically oblique stiffening compared to the orthogonal stiffening under the combined loading condition.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.9
• /
• pp.783-790
• /
• 2016

One of the main factors related to the deterioration of estimation accuracy in inertial measurement unit (IMU)-based orientation determination is the object's acceleration. This is because accelerometer signals under accelerated motion conditions cannot be longer reference vectors along the vertical axis. In order to deal with this issue, some orientation estimation algorithms adopt acceleration-compensating mechanisms. Such mechanisms include the simple switching techniques, mechanisms with adaptive estimation of acceleration, and acceleration model-based mechanisms. This paper compares these three mechanisms in terms of estimation accuracy. From experimental results under accelerated dynamic conditions, the following can be concluded. (1) A compensating mechanism is essential for an estimation algorithm to maintain accuracy under accelerated conditions. (2) Although the simple switching mechanism is effective to some extent, the other two mechanisms showed much higher accuracies, particularly when test conditions were severe.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2019

In this paper, the classification performance of learning algorithms is compared for TAB digit recognition. The TAB digits that are segmented from TAB musical notes contain TAB lines and musical symbols. The labeling method and non-linear filter are designed and applied to extract fret digits only. The shift operation of the 4 directions is applied to generate more data. The selected models are Bayesian classifier, support vector machine, prototype based learning, multi-layer perceptron, and convolutional neural network. The result shows that the mean accuracy of the Bayesian classifier is about 85.0% while that of the others reaches more than 99.0%. In addition, the convolutional neural network outperforms the others in terms of generalization and the step of the data preprocessing.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.367-378
• /
• 2015

This study was directed at the design of a hybrid algorithm for competition relation extraction. Previous works on relation extraction have relied on various lexical and deep parsing indicators and mostly utilize only the machine learning method. We present a new algorithm integrating machine learning with various filtering methods. Some simple but useful features for competition relation extraction are also introduced, and an optimum feature set is proposed. The goal of this paper was to increase the precision of competition relation extraction by combining supervised learning with various filtering methods. Filtering methods were employed for classifying compete relation occurrence, using distance restriction for the filtering of feature pairs, and classifying whether or not the candidate entity pair is spam. For evaluation, a test set consisting of 2,565 sentences was examined. The proposed method was compared with the rule-based method and general relation extraction method. As a result, the rule-based method achieved positive precision of 0.812 and accuracy of 0.568, while the general relation extraction method achieved 0.612 and 0.563, respectively. The proposed system obtained positive precision of 0.922 and accuracy of 0.713. These results demonstrate that the developed method is effective for competition relation extraction.

• Journal of KIISE
• /
• v.43 no.10
• /
• pp.1085-1093
• /
• 2016

Community-based Question Answering system is a system which provides answers for each question from the documents uploaded on web communities. In order to enhance the capacity of question analysis, former methods have developed specific rules suitable for a target region or have applied machine learning to partial processes. However, these methods incur an excessive cost for expanding fields or lead to cases in which system is overfitted for a specific field. This paper proposes a multiple machine learning method which automates the overall process by adapting appropriate machine learning in each procedure for efficient processing of community-based Question Answering system. This system can be divided into question analysis part and answer selection part. The question analysis part consists of the question focus extractor, which analyzes the focused phrases in questions and uses conditional random fields, and the question type classifier, which classifies topics of questions and uses support vector machine. In the answer selection part, the we trains weights that are used by the similarity estimation models through an artificial neural network. Also these are a number of cases in which the results of morphological analysis are not reliable for the data uploaded on web communities. Therefore, we suggest a method that minimizes the impact of morphological analysis by using character features in the stage of question analysis. The proposed system outperforms the former system by showing a Mean Average Precision criteria of 0.765 and R-Precision criteria of 0.872.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.11-19
• /
• 2008

In this paper, we propose a prediction method of lung cancer susceptibility using an importance evaluation of SNP data and the SVM learning, a gene data concerning getting sick with the lung cancer. Since the number of negative data is much larger that of positive data, which are to be used in the SVM learning, for each positive data, a negative data is first searched which has the same sex and the minimum age difference with the positive data. The searched negative data is then coupled with the positive data. For the importance evaluation of each SNP data, an equation which calculates the influence of each SNP data on the prediction of getting sick is adopted. The SNP data are sorted according to the evaluated importance. In experiments, we observed the prediction accuracy which varies according to the number of sorted SNP data used in the learning. LOOCV test results showed that the proposed method yields the prediction accuracy of maximum 65.0% for test data.

• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.85-92
• /
• 2010

A shallow semantic parsing system analyzes the relationship that a syntactic constituent of the sentence has with a predicate. It identifies semantic arguments representing agent, patient, instrument, etc. of the predicate. In this study, we propose a two-phase shallow semantic parsing model which consists of the identification phase and the classification phase. We first find the boundary of semantic arguments from partial syntactic parsing results, and then assign appropriate semantic roles to the identified semantic arguments. By taking the sequential two-phase approach, we can alleviate the unbalanced class distribution problem, and select the features appropriate for each task. Experiments show the relative contribution of each phase on the test data.

• The KIPS Transactions:PartB
• /
• v.11B no.4
• /
• pp.501-508
• /
• 2004

This paper proposes a virtual relevant document technique in the teaming phase for text categorization. The method uses a simple transformation of relevant documents, i.e. making virtual documents by combining document pairs in the training set. The virtual document produced by this method has the enriched term vector space, with greater weights for the terms that co-occur in two relevant documents. The experimental results showed a significant improvement over the baseline, which proves the usefulness of the proposed method: 71% improvement on TREC-11 filtering test collection and 11% improvement on Routers-21578 test set for the topics with less than 100 relevant documents in the micro average F1. The result analysis indicates that the addition of virtual relevant documents contributes to the steady improvement of the performance.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2015.07a
• /
• pp.310-311
• /
• 2015

Ships' tracking data are being monitored and collected by vessel traffic service center in real time. In this paper, we intend to contribute to vessel traffic service operators' decision making through extracting ships' tracking patterns and models based on these data. Support Vector Machine algorithm was used for vessel track modeling to handle and process the data sets and k-fold cross validation was used to select the proper parameters. Proposed data processing methods could support vessel traffic service operators' decision making on case of anomaly detection, calculation ships' dead reckoning positions and etc.

• The KIPS Transactions:PartB
• /
• v.18B no.2
• /
• pp.67-72
• /
• 2011

Single nucleotide polymorphisms (SNPs) are a very important tool for the study of human genome structure. Cluster analysis of the large amount of gene expression data is useful for identifying biologically relevant groups of genes and for generating networks of gene-gene interactions. In this paper we compared the clusters of SNPs within asthma group and normal control group obtained by using hierarchical cluster analysis method with entropy distance. It appears that the 5-cluster collections of the two groups are significantly different. We searched the best set of SNPs that are useful for diagnosing the two types of asthma using representative SNPs of the clusters of the asthma group. Here support vector machines are used to evaluate the prediction accuracy of the selected combinations. The best combination model turns out to be the five-locus SNPs including one on the gene ALOX12 and their accuracy in predicting aspirin tolerant asthma disease risk among asthmatic patients is 66.41%.