• Journal of KIISE
• /
• v.44 no.7
• /
• pp.686-691
• /
• 2017

Telemarketing has become the center of marketing action of the industry in the information society. Recently, machine learning has emerged in many areas, especially, financial prediction. Financial data consists of lots of unlabeled data in most parts, and therefore, it is difficult for humans to perform their labeling. In this paper, we propose a fusion method of semi-supervised learning for automatic labeling of unlabeled data to predict telemarketing. Specifically, we integrate labeling results of label propagation and co-training with a decision tree. The data with lower reliabilities are removed, and the data are extracted that have consistent label from two labeling methods. After adding them to the training set, a decision tree is learned with all of them. To confirm the usefulness of the proposed method, we conduct the experiments with a real telemarketing dataset in a Portugal bank. Accuracy of the proposed method is 83.39%, which is 1.82% higher than that of the conventional method, and precision of the proposed method is 19.37%, which is 2.67% higher than that of the conventional method. As a result, we have shown that the proposed method has a better performance as assessed by the t-test.

• The Journal of the Korea Contents Association
• /
• v.12 no.9
• /
• pp.9-15
• /
• 2012

A conventional event sentence extraction research doesn't learn the 3W features in the learning step and applies the rule on whether the 3W feature exists in the extraction step. This paper presents a sentence weight based event sentence extraction method that calculates the weight of the 3W features in the learning step and applies the weight of the 3W features in the extraction step. In the experimental result, we show that top 30% features by the $TF{\times}IDF$ weighting method is good in the feature filtering. In the real estate domain of the public issue, the performance of sentence weight based event sentence extraction method is improved by who and when of 3W features. Moreover, In the real estate domain of the public issue, the sentence weight based event sentence extraction method is better than the other machine learning based extraction method.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1034-1042
• /
• 2016

Together with machine-learning frameworks, area-based imagery registration techniques can be easily applied to diverse types of image pairs without predefined features and feature descriptors. However, feature detectors are often used to quickly identify candidate image patch pairs, limiting the applicability of these registration techniques. In this paper, we propose a ConvNet (Convolutional Network) "Dart" that provides not only the matching metric between patches, but also information about their distance, which are helpful in reducing the search space of the corresponding patch pairs. In addition, we propose a ConvNet "Fad" to identify the patches that are difficult for Dart to improve the accuracy of registration. These two networks were successfully implemented using Deep Learning with the help of a number of training instances generated from a few registered image pairs, and were successfully applied to solve a simple image registration problem, suggesting that this line of research is promising.

• Journal of the Korea Society for Simulation
• /
• v.24 no.4
• /
• pp.77-88
• /
• 2015

In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.23 no.3
• /
• pp.5-17
• /
• 2012

In citation analysis, author names are often used as the unit of analysis and some authors are indexed under the same name in bibliographic databases where the citation counts are obtained from. There are many techniques for author name disambiguation, using supervised, unsupervised, or semisupervised learning algorithms. Unsupervised approach uses machine learning algorithms to extract necessary bibliographic information from large-scale databases and digital libraries, while supervised approaches use manually built training datasets for clustering author groups for combining them with learning algorithms for author name disambiguation. The study examines various techniques for author name disambiguation in the hope for finding an aid to improve the precision of citation counts in citation analysis, as well as for better results in information retrieval.

• The KIPS Transactions:PartD
• /
• v.11D no.3
• /
• pp.731-740
• /
• 2004

In this paper we propose a fast negotiation agent system that guarantees the reciprocity of the attendants in a bilateral negotiation on the e-commerce. The proposednegotiation agent system exploits the incremental learning method based on an artificial neural network in generating a counter-offer and is trained by the previous offer that has been rejected by the other party. During a negotiation, the software agents on behalf of a buyer and a seller negotiate each other by considering the multi-attributes of a product. The experimental results show that the proposed negotiation system achieves better agreements than other negotiation agent systems that are operated under the realistic and practical environment. Furthermore, the proposed system carries out negotiations about twenty times faster than the previous negotiation systems on the average.

• The KIPS Transactions:PartB
• /
• v.16B no.6
• /
• pp.479-488
• /
• 2009

This paper shows a reinforced construction scheme of training data for improvement of text classification by automatic search of boundary category. The documents laid on boundary area are usually misclassified as they are including multiple topics and features. which is the main factor that we focus on. In this paper, we propose an automated exploring methodology of optimal boundary category based on previous research. We consider the boundary area among target categories to new category to be required training, which are then added to the target category sementically. In experiments, we applied our method to complex documents by intentionally making errors in training process. The experimental results show that our system has high accuracy and reliability in noisy environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.8
• /
• pp.1743-1750
• /
• 2003

DC motor requires a rotor speed sensor for accurate speed control. The speed sensors such as resolvers and encoders are used as a speed detector, but they increase cost and size of the motor and restrict the industrial drive applications. So in these days, many papers have reported in the sensorless operation of DC motor〔3­5〕. This paper presents a new sensorless strategy using neural networks〔6­8〕. Neural network has three layers which are input layer, hidden layer and output layer. The optimal neural network structure was tracked down by trial and error, and it was found that 4­16­1 neural network structure has given suitable results for the instantaneous rotor speed. Also, learning method is very important in neural network. Supervised learning methods〔8〕 are typically used to train the neural network for learning the input/output pattern presented. The back­propagation technique adjusts the neural network weights during training. The rotor speed is gained by weights and four inputs to the neural network. The experimental results were found satisfactory in both the independency on machine parameters and the insensitivity to the load condition.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.1-11
• /
• 2001

This paper presents a learning-based approach for the construction of license Plate recognition system. The system consist of three modules. They are respectively, car detection module, license plate recognition module and recognition module. Car detection module detects a car in the given image sequence obtained from the camera with simple color-based approach. Segmentation module extracts the license plate in detect car image using neural network as filters for analyzing the color and texture properties of license plate. Recognition module then reads characters in detected license plate with support vector machine (SVM)-based characters recognizer. The system has been tested from parking lot and tollgate, etc. and have show the following performances on average: Car detect rate 100%, segmentation rate 97.5%, and character recognition rate about 97.2%. Overall system performances is 94.7% and processing time is one sec. Then our propose system does well using real world.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.387-394
• /
• 2004

In this paper, we propose a modified unsupervised linear alignment algorithm for building an aligned corpus. The original algorithm inserts null characters into both of two aligned strings (source string and target string), because the two strings are different from each other in length. This can cause some difficulties like the search space explosion for applications using the aligned corpus with null characters and no possibility of applying to several machine learning algorithms. To alleviate these difficulties, we modify the algorithm not to contain null characters in the aligned source strings. We have shown the usability of our approach by applying it to different areas such as Korean-English back-trans literation, English grapheme-phoneme conversion, and Korean morphological analysis.