• Journal of the Korean Society for information Management
• /
• 제19권4호
• /
• pp.35-51
• /
• 2002

Inductive learning and classification techniques have been employed in various research and applications that organize textual data to solve the problem of information access. In this study, we develop hybrid model combination methods which incorporate the concepts and techniques for multiple modeling algorithms to improve the accuracy of text classification, and conduct experiments to evaluate the performances of proposed schemes. Boosted stacking, one of the extended stacking schemes proposed in this study yields higher accuracy relative to the conventional model combination methods and single classifiers.

• Journal of Information Technology Applications and Management
• /
• 제23권1호
• /
• pp.45-59
• /
• 2016

An ensemble classifier is a method that combines output of multiple classifiers. It has been widely accepted that ensemble classifiers can improve the prediction accuracy. Recently, ensemble techniques have been successfully applied to the bankruptcy prediction. Bagging and random subspace are the most popular ensemble techniques. Bagging and random subspace have proved to be very effective in improving the generalization ability respectively. However, there are few studies which have focused on the integration of bagging and random subspace. In this study, we proposed a new hybrid ensemble model to integrate bagging and random subspace method using genetic algorithm for improving the performance of the model. The proposed model is applied to the bankruptcy prediction for Korean companies and compared with other models in this study. The experimental results showed that the proposed model performs better than the other models such as the single classifier, the original ensemble model and the simple hybrid model.

• IEMEK Journal of Embedded Systems and Applications
• /
• 제11권4호
• /
• pp.209-218
• /
• 2016

This paper proposes a new lifetime aware buffer mapping method of a synchronous dataflow (SDF) graph on a hybrid memory system with DRAM and PRAM. Since the number of write operations on PRAM is limited, the number of written samples on PRAM is minimized to maximize the lifetime of PRAM. We improve the utilization of DRAM by mapping more buffers on DRAM through buffer sharing. The problem is formulated formally and solved by an optimal approach of an answer set programming. In experiment, the buffer mapping method with buffer sharing improves the PRAM lifetime by 63%.

• Journal of applied mathematics & informatics
• /
• 제35권3_4호
• /
• pp.313-321
• /
• 2017

In this note we establish a new non-convex hybrid iteration algorithm corresponding to Khan iterative process [4] and prove strong convergence theorems of common fixed points for a uniformly closed asymptotically family of countable quasi-Lipschitz mappings in Hilbert spaces. Moreover, the main results are applied to get the common fixed points of finite family of quasi-asymptotically nonexpansive mappings. The results presented in this article are interesting extensions of some current results.

• Journal of Korean Society of Transportation
• /
• 제14권4호
• /
• pp.49-76
• /
• 1996

Until recently, the inductive loop detecters(ILD) have been used to collect a traffic information in a part of traffic manangment and control. The ILD is able to collect a various traffic data such as a occupancy time and non-occupancy time, traffic volume, etc. The occupancy time of these is very important information for traffic control algorithms, which is required a high accuracy. This accuracy may be improved by classifying a vehicle type with ILD. To classify a vehicle type based on a Analog Digital Converted data collect form ILD, this study used a typical and modifyed statistic method and General Learning Vector Quantization unsuperviser neural network model and a hybrid model of GLVQ and statistic method, As a result, the hybrid model of GLVQ neural network model is superior to the other methods.

• Korean Management Science Review
• /
• 제23권1호
• /
• pp.75-85
• /
• 2006

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree(MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed. A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolutionary strategy on RSTP based upon nodes set is presented. The computational results show that the hybrid evolutionary strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolutionary strategy is about 11.14%, which is almost similar to that of optimal solutions.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.225-228
• /
• 2004

This paper presents a hybrid decimal division algorithm to improve division speed. In a binary number system, non-restoring algorithm has a smaller number of operations than restoring algorithm. In decimal number system, however, the number of operations differs with respect to quotient values. Since one digit ranges 0 to 9 in decimal, the proposed hybrid algorithm employ either non-restoring or restoring algorithm on each digit to reduce iterative operations. The selection of the algorithm is based on the remainder values. The proposed algorithm improves computation speed substantially over conventional algorithms by decreasing the number of operations.

• Journal of Computational Design and Engineering
• /
• 제3권2호
• /
• pp.121-131
• /
• 2016

Organic modeling of 3D characters is a challenging task when it comes to correctly modeling the anatomy of the human body. Most sketch based modeling tools available today for modeling organic models (humans, animals, creatures etc) are focused towards modeling base mesh models only and provide little or no support to add details to the base mesh. We propose a hybrid approach which combines geometrical primitives such as generalized cylinders and cube with Shape-from-Shading (SFS) algorithms to create plausible human character models from sketches. The results show that an artist can quickly create detailed character models from sketches by using this hybrid approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제21권9호
• /
• pp.2317-2327
• /
• 1996

Original binary image can be reconstructed without any distortion by MS(morphological skeleton) image. Though we reduce some points in a MS image, there is no problem to reconstruct original image by it. And then, there are two methods of LMS and GMS which reduce the redundant points of a MS image. The redundancy degree of a GMS image is zero and it is less than that of LMS. And then, GMS image is the best thing of the three kinds of morphological skeleton image to enhance the compression efficienty by the Elias code. But there are continous SKF=1 points in a GMS image whenever using 2 dimensional structureing element. Those points in a GMS image gives rise to a bad compression efficiency. And then, solving this problem, this paper proposes hybrid structuring elements algorithms for binary image compression.

• The Journal of Information Systems
• /
• 제17권3호
• /
• pp.39-58
• /
• 2008

Mixed Chinese Postman Problem (MCPP) is a practical generalization of the classical Chinese Postman Problem (CPP) and it could be applied in many real world. Although MCPP is useful in terms of reality, MCPP has been proved to be a NP-complete problem. To find optimal solutions efficiently in MCPP, we can reduce searching space to be small effective searching space containing optimal solutions. We propose GENIIS methodology, which is a kind of hybrid algorithm combines the approximate algorithms and genetic algorithm. To get good solutions in the effective searching space, GENIIS uses approximate algorithm and genetic algorithm. This paper validates the usefulness of the proposed approach in a simulation. The results of our paper could be utilized to increase the efficiencies of network and transportation in business.