• Information Systems Review
• /
• v.12 no.2
• /
• pp.75-88
• /
• 2010

This paper proposed a method that segmented customers utilizing SOM(Self-organizing Map) and predicted the customers' response of a marketing promotion for each customer's segments. Our proposed method focused on predicting the response of customers dividing into customers' segment whereas most studies have predicted the response of customers all at once. We deployed logistic regression, neural networks, and support vector machines to predict customers' response that is a kind of dichotomous classification while the integrated approach was utilized to improve the performance of the prediction model. Sample data including 45 variables regarding demographic data about 600 customers, transaction data, and promotion activities were applied to the proposed method presenting classification matrix and the comparative analyses of each data mining techniques. We could draw some significant promotion strategies for segmented customers applying our proposed method to sample data.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.391-400
• /
• 2007

According to the recent advances in multimedia computing, storage and searching technology have made large volume of music contents become prevalent. Also there has been increasing needs for the study on efficient categorization and searching technique for music contents management. In this paper, a new classifying method using the local information of music content and music tone feature is proposed. While the conventional classifying algorithms are based on entire information of music content, the algorithm proposed in this paper focuses on only the specific local information, which can drastically reduce the computing time without losing classifying accuracy. In order to improve the classifying accuracy, it uses a new classification feature based on music tone. The proposed method has been implemented as a part of MuSE (Music Search/Classification Engine) which was installed on various systems including commercial PDAs and PCs.

• Journal of Digital Convergence
• /
• v.18 no.2
• /
• pp.249-259
• /
• 2020

This study presents a recently obtained social media data set based upon the case study of Electric Vehicles (EV) and looks to implement a sentiment analysis (SA) in order to gain insights. This study uses two methods in order to fully analyze the public's sentiment on EVs. First, we implement a SA tool in which we used to extract the sentiment of comments. Next we labeled the data with these sentiments obtained and classified them. While performing classification we found the problem of dimensionality and also explored the use of feature selection (FS) models in order to reduce the data set's dimensionality. We found that the use of three FS models (Chi Squared, Information Gain and ReliefF) showed the most promising results when used alongside a logistic and support vector machines classification algorithm. the contributions of this paper are in providing an real-world example of social media text analytics which can be adopted in many other areas of research and business. Moving forward researchers can use the methodological approach in this paper to further refine and improve their own case uses in text analytics.

• Journal of the Korean Data and Information Science Society
• /
• v.12 no.2
• /
• pp.1-10
• /
• 2001

Neural networks we increasingly being seen as an addition to the statistics toolkit which should be considered alongside both classical and modern statistical methods. Neural networks are usually useful for classification and function estimation. In this paper we concentrate on function estimation using neural networks with weight decay factor The use of weight decay seems both to help the optimization process and to avoid overfitting. In this type of neural networks, the problem to decide the number of hidden nodes, weight decay parameter and iteration number of learning is very important. It is called the optimization of weight decay neural networks. In this paper we propose a automatic optimization based on genetic algorithms. Moreover, we compare the weight decay neural network automatically learned according to automatic optimization with ordinary neural network, projection pursuit regression and support vector machines.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.5
• /
• pp.1079-1094
• /
• 2014

In this paper, we study efficient gene selection methods by using conditional mutual information. We suggest gene selection methods using conditional mutual information based on semiparametric methods utilizing multivariate normal distribution and Edgeworth approximation. We compare our suggested methods with other methods such as mutual information filter, SVM-RFE, Cai et al. (2009)'s gene selection (MIGS-original) in SVM classification. By these experiments, we show that gene selection methods using conditional mutual information based on semiparametric methods have better performance than mutual information filter. Furthermore, we show that they take far less computing time than Cai et al. (2009)'s gene selection but have similar performance.

• Journal of Navigation and Port Research
• /
• v.32 no.10
• /
• pp.845-850
• /
• 2008

In this paper, we propose a license plate locating algorithm by using SVM. Tipically, the features regarding license plate format include height-to-width ratio, color, and spatial frequency. The method is dived into three steps which are image acquisition, detecting license plate candidate regions, verifying the license plate accurately. In the course of detecting license plate candidate regions, color filtering and edge detecting are performed to detect candidate regions, and then verify candidate region using Support Vector Machines(SVM) with DCT coefficients of candidates. It is possible to perform reliable license plate location bemuse we can protect false detection through these verification process. We validate our approach with experimental results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1129-1135
• /
• 2007

Human face detection technique plays an important role in computer vision area. It has lots of applications such as face recognition, video surveillance, human computer interface, face image database management, and querying image databases. In this paper, a fast face detection approach using Principal Component Analysis (PCA) and Support Vector Machines (SVM) is proposed based on the previous study on face detection technique. In the proposed detection system, firstly it filter the face potential area using statistical feature which is generated by analyzing the local histogram distribution the detection process is speeded up by eliminating most of the non-face area in this step. In the next step, PCA feature vectors are generated, and then detect whether there are faces present in the test image using SVM classifier. Finally, store the detection results and output the results on the test image. The test images in this paper are from CMU face database. The face and non-face samples are selected from the MIT data set. The experimental results indicate the proposed method has good performance for face detection.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.51-59
• /
• 2019

Due to the exponential growth of access information on the web, the need for predicting web users' next access has increased. Various models such as markov models, deep neural networks, support vector machines, and fuzzy inference models were proposed to handle web access prediction. For deep learning based on neural network models, training time on large-scale web usage data is very huge. To address this problem, deep neural network models are trained on cluster of computers in parallel. In this paper, we investigated impact of several important spark parameters related to data partitions, shuffling, compression, and locality (basic spark parameters) for training Multi-Layer Perceptron model on Spark standalone cluster. Then based on the investigation, we tuned basic spark parameters for training Multi-Layer Perceptron model and used it for tuning Spark when training Multi-Layer Perceptron model for web access prediction. Through experiments, we showed the accuracy of web access prediction based on our proposed web access prediction model. In addition, we also showed performance improvement in training time based on our spark basic parameters tuning for training Multi-Layer Perceptron model over default spark parameters configuration.

• Journal of Digital Convergence
• /
• v.17 no.9
• /
• pp.71-78
• /
• 2019

This study aims to identify good borrowers within the context of P2P lending. P2P lending is a growing platform that allows individuals to lend and borrow money from each other. Inherent in any loans is credit risk of borrowers and needs to be considered before any lending. Specifically in the context of P2P lending, traditional models fall short and thus this study aimed to rectify this as well as explore the problem of class imbalances seen within credit risk data sets. This study implemented an over-sampling technique known as Synthetic Minority Over-sampling Technique (SMOTE). To test our approach, we implemented five benchmarking classifiers such as support vector machines, logistic regression, k-nearest neighbor, random forest, and deep neural network. The data sample used was retrieved from the publicly available LendingClub dataset. The proposed SMOTE revealed significantly improved results in comparison with the benchmarking classifiers. These results should help actors engaged within P2P lending to make better informed decisions when selecting potential borrowers eliminating the higher risks present in P2P lending.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.15-21
• /
• 2018

In this study, we try to detect anomalies on the network intrusion detection system by learning only one class. We use KDD CUP 1999 dataset, an intrusion detection dataset, which is used to evaluate classification performance. One class classification is one of unsupervised learning methods that classifies attack class by learning only normal class. When using unsupervised learning, it difficult to achieve relatively high classification efficiency because it does not use negative instances for learning. However, unsupervised learning has the advantage for classifying unlabeled data. In this study, we use one class classifiers based on support vector machines and density estimation to detect new unknown attacks. The test using the classifier based on density estimation has shown relatively better performance and has a detection rate of about 96% while maintaining a low FPR for the new attacks.