• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.113-122
• /
• 2015

Feature subset selection is as a pre-processing step in learning algorithms. In this paper, we propose an efficient algorithm, ModifiedFAST, for feature subset selection. This algorithm is suitable for text datasets, and uses the concept of information gain to remove irrelevant and redundant features. A new optimal value of the threshold for symmetric uncertainty, used to identify relevant features, is found. The thresholds used by previous feature selection algorithms such as FAST, Relief, and CFS were not optimal. It has been proven that the threshold value greatly affects the percentage of selected features and the classification accuracy. A new performance unified metric that combines accuracy and the number of features selected has been proposed and applied in the proposed algorithm. It was experimentally shown that the percentage of selected features obtained by the proposed algorithm was lower than that obtained using existing algorithms in most of the datasets. The effectiveness of our algorithm on the optimal threshold was statistically validated with other algorithms.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1285-1288
• /
• 1998

In this paper, we propose a new learning algorithm for multilayer neural networks. In the error backpropagation that is widely used for training multilayer neural networks, weights are adjusted to reduce the error function that is sum of squared error for all the neurons in the output layer of the network. In the proposed learning algorithm, we consider each output of the output layer as a function of weights and adjust the weights directly so that the output neurons produce the desired outputs. Experiments show that the proposed algorithm outperforms the backpropagation learning algorithm.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1191-1194
• /
• 1998

This paper presents a new computationally efficient adaptive algorithm for blind signal separation, which is able to recover the narrowband source signals in the presence of cochannel interference without a prior knowledge of array manifold. We derive a new blind signal separation algorithm using the Natural gradient 〔1〕from an information-theoretic approach. The resulting algorithm has the Bussgang property which has been widely used in blind equalization 〔12〕. Extensive computer simulation results comfirm the validity and high performance of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.785-794
• /
• 2013

Soon after Lee and O'Sullivan proposed a new interpolation algorithm for algebraic soft-decision decoding of Reed-Solomon codes, there have been some attempts to apply a coordinate transformation technique to the new algorithm, with a remarkable complexity reducing effect. In this paper, a conceptually simple way of applying the transformation technique to the interpolation algorithm is proposed.

• Communications for Statistical Applications and Methods
• /
• v.6 no.1
• /
• pp.53-68
• /
• 1999

To improve the slow convergence property of the steepest ascent type algorithm for continuous D-optimal design problems. we develop a new algorithm. We apply the nonlinear system of equations as the necessary condition of optimality and develop the two-point algorithm that solves the problem of clustering. Because of the nature of the steepest coordinate ascent algorithm avoiding the problem of clustering itself helps the improvement of convergence speed. The numerical examples show the performances of the new method is better than those of various steepest ascent algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.7
• /
• pp.627-632
• /
• 2005

RAIM techniques based on TLS have rarely been addressed because TLS requires a great number of computations. In this paper, the particular form of the observation matrix H, is exploited so as to develop a new TLS-based sequential algorithm to identify an errant satellite. The algorithm allows us to enjoy the advantages of TLS with less computational burden. The proposed algorithm is verified through a numerical simulation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1420-1427
• /
• 1989

A new block matching algorithm that improved the existing block matching algorithm in terms of image quality is proposed in this paper. The subblock of image including the vertical edge of object is subdivided into new two subblocks, and the moving vector found. The result of computer simulation shows on real image that the image quality by the algorithm becomes higher than that of the three step search algorithm by 1.1dB.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.360-362
• /
• 1998

In the original mixtures of experts framework, the parameters of the network are determined by gradient descent, which is naturally slow. In [2], the Expectation-Maximization(EM) algorithm is used instead, to obtain the network parameters, resulting in substantially reduced training times. This paper presents the new EM algorithm for prediction. We show that an Efficient training algorithm may be derived for the HME network. To verify the utility of the algorithm we look at specific examples in time series prediction. The application of the new EM algorithm to time series prediction has been quiet successful.

• Proceedings of the KIEE Conference
• /
• 1997.07c
• /
• pp.941-944
• /
• 1997

In this paper, new algorithm is proposed to transform the heuristically approximated eigenvalue calculation procedure of the AESOPS algorithm to the Newton Rahpson method. The new algorithm is directly calculated from the original eigenvalue calculation of the AESOPS and thus a large number of the same data of the AESOPS algorithm can be used efficiently in this method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.51
• /
• pp.21-28
• /
• 1999

The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.