• Journal of Intelligence and Information Systems
• /
• v.29 no.4
• /
• pp.325-345
• /
• 2023

In the rapidly evolving domain of e-commerce, our study presents a cohesive approach to enhance customer satisfaction prediction from online reviews, aligning methodological innovation with practical insights. We integrate the RFE-SHAP feature selection with LDA topic modeling to streamline predictive analytics in e-commerce. This integration facilitates the identification of key features-specifically, narrowing down from an initial set of 28 to an optimal subset of 14 features for the Random Forest algorithm. Our approach strategically mitigates the common issue of overfitting in models with an excess of features, leading to an improved accuracy rate of 84% in our Random Forest model. Central to our analysis is the understanding that certain aspects in review content, such as quality, fit, and durability, play a pivotal role in influencing customer satisfaction, especially in the clothing sector. We delve into explaining how each of these selected features impacts customer satisfaction, providing a comprehensive view of the elements most appreciated by customers. Our research makes significant contributions in two key areas. First, it enhances predictive modeling within the realm of e-commerce analytics by introducing a streamlined, feature-centric approach. This refinement in methodology not only bolsters the accuracy of customer satisfaction predictions but also sets a new standard for handling feature selection in predictive models. Second, the study provides actionable insights for e-commerce platforms, especially those in the clothing sector. By highlighting which aspects of customer reviews-like quality, fit, and durability-most influence satisfaction, we offer a strategic direction for businesses to tailor their products and services.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.2
• /
• pp.19-28
• /
• 2019

The purpose of this study is to examine the trends on machine learning and deep learning research in the published journals from the Web of Science Database. To achieve the study purpose, we used the abstracts of 20,664 articles published between 1990 and 2017, which include the word 'machine learning', 'deep learning', and 'artificial neural network' in their titles. Twenty major research topics were identified from topic modeling analysis and they were inclusive of classification accuracy, machine learning, optimization problem, time series model, temperature flow, engine variable, neuron layer, spectrum sample, image feature, strength property, extreme machine learning, control system, energy power, cancer patient, descriptor compound, fault diagnosis, soil map, concentration removal, protein gene, and job problem. The analysis of the time-series linear regression showed that all identified topics in machine learning research were 'hot' ones.

• Journal of The Korean Association For Science Education
• /
• v.42 no.5
• /
• pp.487-499
• /
• 2022

This study aims to understand the trends and characteristics of elementary science textbook research. For this purpose, among the papers published in science-related journals from 2001 to 2021, 156 studies related to elementary science textbooks were analyzed to examine the research trends on textbook analysis. The analysis criteria consisted of two major categories, 'outward feature' and 'topic.' The subcategories of 'outward feature' consist of 'year of publication,' 'target curriculum,' 'target grade,' 'science content area,' 'subject of study,' and 'publishing institution.' The sub-categories of 'topic' consist of 'comparison,' 'content,' 'illustration,' 'inquiry activity,' 'perception of textbooks,' and 'others.' As a result of the analysis on 'outer feature,' textbook-related research was conducted almost every year, and the research on the 2009 revised science curriculum, on the 3-6 grades, and on the whole field of science had the most. The science textbook researches were published not only in science education-related journals but also in other areas' journals. As a result of the analysis of the 'topic,' the number of papers was higher in the order of comparative research, content analysis, illustration, inquiry activities, and perception of textbooks. Implications for accredited textbook system of elementary science were discussed based on the analyses on the elementary science textbook research trends.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.133-140
• /
• 2018

Accurate sentiment classification is an important research topic in sentiment analysis. This study suggests an efficient classification method of Korean sentiment using word2vec and ensemble methods which have been recently studied variously. For the 200,000 Korean movie review texts, we generate a POS-based BOW feature and a feature using word2vec, and integrated features of two feature representation. We used a single classifier of Logistic Regression, Decision Tree, Naive Bayes, and Support Vector Machine and an ensemble classifier of Adaptive Boost, Bagging, Gradient Boosting, and Random Forest for sentiment classification. As a result of this study, the integrated feature representation composed of BOW feature including adjective and adverb and word2vec feature showed the highest sentiment classification accuracy. Empirical results show that SVM, a single classifier, has the highest performance but ensemble classifiers show similar or slightly lower performance than the single classifier.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.697-702
• /
• 2005

The focused crawler is a topic-driven document-collecting crawler that was suggested as a promising alternative of maintaining up-to-date web document Indices in search engines. A major problem inherent in previous focused crawlers is the liability of missing highly relevant documents that are linked from off-topic documents. This problem mainly originated from the lack of consideration of structural information in a document. Traditional weighting method such as TFIDF employed in document classification can lead to this problem. In order to improve the performance of focused crawlers, this paper proposes a scheme of locality-based document segmentation to determine the relevance of a document to a specific topic. We segment a document into a set of sub-documents using contextual features around the hyperlinks. This information is used to determine whether the crawler would fetch the documents that are linked from hyperlinks in an off-topic document.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.4
• /
• pp.651-671
• /
• 2001

There are several English constructions in which a certain constituent appears to the left of its canonical position, typically sentence-initially, leaving its canonical position empty. Such constructions involve Left-dislocation and Y-movement. These operations are called ‘Preposing.’ The preposed constituent of such constructions is generally regarded as the topic of the sentence which involves that constituent. Topics must have at least two features; ‘aboutness’ and ‘givenness.’ The feature ‘aboutness’ defines the range of comment, and the feature ‘givenness’ means ‘informationally old or given.’ The purpose of this paper is to show that the function of Preposing is to reinforce the aboutness of the preposed constituent of a sentence and that most preposed constituents have givenness. We examined Preposing for this purpose. Tough-movement and Passivization were examined also, because they have characteristics informationally similar to those of Preposing.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.179-188
• /
• 2004

Bankruptcy prediction is an important and widely studied topic since it can have significant impact on bank lending decisions and profitability. Recently, support vector machine (SVM) has been applied to the problem of bankruptcy prediction. The SVM-based method has been compared with other methods such as neural network, logistic regression and has shown good results. Genetic algorithm (GA) has been increasingly applied in conjunction with other AI techniques such as neural network, CBR. However, few studies have dealt with integration of GA and SVM, though there is a great potential for useful applications in this area. This study proposes the methods for improving SVM performance in two aspects: feature subset selection and parameter optimization. GA is used to optimize both feature subset and parameters of SVM simultaneously for bankruptcy prediction.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.787-795
• /
• 2008

Human recognition on camera is an interesting topic in computer vision. While fingerprint and face recognition have been become common, gait is considered as a new biometric feature for distance recognition. In this paper, we propose a gait recognition algorithm based on the knee angle, 2 feet distance, walking velocity and head direction of a person who appear in camera view on one gait cycle. The background subtraction method firstly use for binary moving object extraction and then base on it we continue detect the leg region, head region and get gait features (leg angle, leg swing amplitude). Another feature, walking speed, also can be detected after a gait cycle finished. And then, we compute the errors between calculated features and stored features for recognition. This method gives good results when we performed testing using indoor and outdoor landscape in both lateral, oblique view.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1045-1055
• /
• 2007

Latent topic models are statistical models which automatically captures salient patterns or correlation among features underlying a data collection in a probabilistic way. They are gaining an increased popularity as an effective tool in the application of automatic semantic feature extraction from text corpus, multimedia data analysis including image data, and bioinformatics. Among the important issues for the effectiveness in the application of latent topic models to the massive data set is the efficient learning of the model. The paper proposes an accelerated learning technique for PLSA model, one of the popular latent topic models, by an incremental EM algorithm instead of conventional EM algorithm. The incremental EM algorithm can be characterized by the employment of a series of partial E-steps that are performed on the corresponding subsets of the entire data collection, unlike in the conventional EM algorithm where one batch E-step is done for the whole data set. By the replacement of a single batch E-M step with a series of partial E-steps and M-steps, the inference result for the previous data subset can be directly reflected to the next inference process, which can enhance the learning speed for the entire data set. The algorithm is advantageous also in that it is guaranteed to converge to a local maximum solution and can be easily implemented just with slight modification of the existing algorithm based on the conventional EM. We present the basic application of the incremental EM algorithm to the learning of PLSA and empirically evaluate the acceleration performance with several possible data partitioning methods for the practical application. The experimental results on a real-world news data set show that the proposed approach can accomplish a meaningful enhancement of the convergence rate in the learning of latent topic model. Additionally, we present an interesting result which supports a possible synergistic effect of the combination of incremental EM algorithm with parallel computing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3984-4005
• /
• 2017

Image recognition has become an increasingly important topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The recognition systems rely on a key component, i.e. the low-level feature or the learned mid-level feature. The recognition performance can be potentially improved if the data distribution information is exploited using a more sophisticated way, which usually a function over hidden variable, model parameter and observed data. These methods are called generative score space. In this paper, we propose a discriminative extension for the existing generative score space methods, which exploits class label when deriving score functions for image recognition task. Specifically, we first extend the regular generative models to class conditional models over both observed variable and class label. Then, we derive the mid-level feature mapping from the extended models. At last, the derived feature mapping is embedded into a discriminative classifier for image recognition. The advantages of our proposed approach are two folds. First, the resulted methods take simple and intuitive forms which are weighted versions of existing methods, benefitting from the Bayesian inference of class label. Second, the probabilistic generative modeling allows us to exploit hidden information and is well adapt to data distribution. To validate the effectiveness of the proposed method, we cooperate our discriminative extension with three generative models for image recognition task. The experimental results validate the effectiveness of our proposed approach.