• Structural Engineering and Mechanics
• /
• v.53 no.4
• /
• pp.833-845
• /
• 2015

Natural frequencies of the structural systems should be far away from the excitation frequency in order to avoid or reduce the destructive effects of dynamic loads on structures. To accomplish this goal, a structural optimization on size and shape has been performed considering frequency constraints. Such an optimization problem has highly nonlinear property. Thus, the quality of the solution is not independent of the optimization technique to be applied. This study presents the performance evaluation of the recently proposed meta-heuristic algorithm called Teaching Learning Based Optimization (TLBO) as an optimization engine in the weight optimization of the truss structures under frequency constraints. Some examples regarding the optimization of trusses on shape and size with frequency constraints are solved. Also, the results obtained are tabulated for comparison. The results demonstrated that the performance of the TLBO is satisfactory. Additionally, TLBO is better than other methods in some cases.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.731-739
• /
• 1998

The probabilistic relaxation(PR) scheme based on the conditional probability and probability space partition has the important property that when its compatibility coefficient matrix (CCM) has uniform components it can classify m-dimensional probabilistic distribution vectors into different classes. When consistency or inconsistency measures have been defined, the properties of PRs are completely determined by the compatibility coefficients among labels of labeled objects and influence weight among labeled objects. In this paper we study the properties of PR in which both compatibility coefficients and influence weights are uniform, and then a learning rule for such PR system is derived. Experiments have been performed to verify the effectiveness of the learning rule.

• Journal of Computing Science and Engineering
• /
• v.5 no.2
• /
• pp.150-160
• /
• 2011

Automatic text classification has a long history and many studies have been conducted in this field. In particular, many machine learning algorithms and information retrieval techniques have been applied to text classification tasks. Even though much technical progress has been made in text classification, there is still room for improvement in text classification. In this paper, we will discuss remaining issues in improving text classification. In this paper, three improvement issues are presented including automatic training data generation, noisy data treatment and term weighting and indexing, and four actual studies and their empirical results for those issues are introduced. First, the semi-supervised learning technique is applied to text classification to efficiently create training data. For effective noisy data treatment, a noisy data reduction method and a robust text classifier from noisy data are developed as a solution. Finally, the term weighting and indexing technique is revised by reflecting the importance of sentences into term weight calculation using summarization techniques.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.3
• /
• pp.170-177
• /
• 2010

Poker is a game of imperfect information where competing players must deal with multiple risk factors stemming from unknown information while making the best decision to win, and this makes it an interesting test-bed for artificial intelligence research. This paper introduces a new learning AI algorithm with embedded opponent modeling that can be used for these types of situations and we use this AI and apply it to a poker program. The new AI will be based on several graphs with each of its nodes representing inputs, and the algorithm will learn the optimal decision to make by updating the weight of the edges connecting these nodes and returning a probability for each action the graphs represent.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.168-171
• /
• 1997

The purpose of this study is the development of PBL(problem-based learning) system using visual C++5.0 as a window-based application program. A patient who complains of weight loss was used in PBL case. Initial frame is made by dialog-based in MFC(microsoft foundation class). Also, sample medical images are composed of ultra-sound, chest PA, Thyroid scan, otherwise. we will make this program as CD-ROM and the internet application or computer assisted learning and continuous medical education.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.5
• /
• pp.394-403
• /
• 1991

This paper described the development of input driven multilayer perceptron(IDMLP) neural network and it's application to the Korean spoken digit recognition. The IDMPLP neural network used here and the learning algorithm for this network was proposed newly. In this model, weight value is integer and transfer function in the neuron is hard limit function. According to the result of the network learning for the some kinds of input data, the number of network layers is one or more by the difficulties of classifying the inputs. We tested the recognition of binaried data for the spoken digit 0 to 9 by means of the proposed network. The experimental results are 100% and 96% for the learning data and test data, respectively.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.1
• /
• pp.74-82
• /
• 2015

Two key challenges in statistical relational learning are uncertainty and complexity. Standard frameworks for handling uncertainty are probability and first-order logic respectively. A Markov logic network (MLN) is a first-order knowledge base with weights attached to each formula and is suitable for classification of dataset which have variables correlated with each other. But we need domain knowledge to construct first-order logics and a computational complexity problem arises when calculating weights of first-order logics. To overcome these problems we suggest a method to generate first-order logics and learn weights using association analysis in this study.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.6
• /
• pp.71-78
• /
• 1997

In this paper, a new neural network training algorithm will be devised for function approximator with good generalization characteristics and tested with the time series prediction problem using santaFe competition data sets. To enhance the generalization ability a constraint term of hidden neuraon activations is added to the conventional output error, which gives the curvature smoothing characteristics to multi-layer neural networks. A hybrid learning algorithm of the error-back propagation and Hebbian learning algorithm with weight decay constraint will be naturally developed by the steepest decent algorithm minimizing the proposed cost function without much increase of computational requriements.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.5
• /
• pp.277-282
• /
• 2003

In this paper we propose Using Higher Order Neuron on the Supervised Learning Machine of the Kohonen Feature Map. The architecture of proposed model adopts the higher order neuron in the input layer of Kohonen Feature Map as a Supervised Learning Machine. It is able to estimate boundary on input pattern space because or the higher order neuron. However, it suffers from a problem that the number of neuron weight increases because of the higher order neuron in the input layer. In this time, we solved this problem by placing the second order neuron among the higher order neuron. The feature of the higher order neuron can be mapped similar inputs on the Kohonen Feature Map. It also is the network with topological mapping. We have simulated the proposed model in respect of the recognition rate by XOR problem, discrimination of 20 alphabet patterns, Mirror Symmetry problem, and numerical letters Pattern Problem.

• Journal of the Korean Society of Industry Convergence
• /
• v.24 no.1
• /
• pp.1-7
• /
• 2021

In this paper, we presented the experimental basis for the theoretical background and robustness of the Convolutional Neural Network for object recognition based on artificial intelligence. An experimental result was performed to visualize the weighting filters and feature maps for each layer to determine what characteristics CNN is automatically generating. experimental results were presented on the trend of learning error and identification error rate by checking the relevance of the weight filter and feature map for learning error and identification error. The weighting filter and characteristic map are presented as experimental results. The automatically generated characteristic quantities presented the results of error rates for moving and rotating robustness to geometric changes.