Genetic Algorithm for Feature Selection in Predicting Repurchase Intention from Online Reviews

D. Suryadi, Wellington
{"title":"Genetic Algorithm for Feature Selection in Predicting Repurchase Intention from Online Reviews","authors":"D. Suryadi, Wellington","doi":"10.1109/3ICT53449.2021.9581586","DOIUrl":null,"url":null,"abstract":"This paper proposes a methodology to predict the repurchase intention based on the reviews and the customer's stated intention. However, there is a large number of words in the reviews. Using those words as features in the prediction model tends to decrease the accuracy of the model and cause model overfitting. A methodology that is based on Genetic Algorithm is proposed to improve the selection iteratively. Each chromosome is encoded as a set of randomly selected indices of words in the vocabulary. The fitness of a chromosome is measured as the accuracy of the Decision Tree prediction model using the selected features (i.e., words). Decision Tree model also provides the feature importance values, which are used to rearrange the genes, such that the Crossover procedure ensures important genes are passed to the offspring. For the Mutation, the information about the Tendency Rank of the features is used alter a gene. Therefore, the Crossover and Mutation procedures are not merely combining and modifying the chromosomes. The proposed methodology is implemented to two data sets. For both data sets, the prediction accuracy of the proposed methodology is significantly higher than the baseline, i.e., random selection.","PeriodicalId":133021,"journal":{"name":"2021 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3ICT53449.2021.9581586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper proposes a methodology to predict the repurchase intention based on the reviews and the customer's stated intention. However, there is a large number of words in the reviews. Using those words as features in the prediction model tends to decrease the accuracy of the model and cause model overfitting. A methodology that is based on Genetic Algorithm is proposed to improve the selection iteratively. Each chromosome is encoded as a set of randomly selected indices of words in the vocabulary. The fitness of a chromosome is measured as the accuracy of the Decision Tree prediction model using the selected features (i.e., words). Decision Tree model also provides the feature importance values, which are used to rearrange the genes, such that the Crossover procedure ensures important genes are passed to the offspring. For the Mutation, the information about the Tendency Rank of the features is used alter a gene. Therefore, the Crossover and Mutation procedures are not merely combining and modifying the chromosomes. The proposed methodology is implemented to two data sets. For both data sets, the prediction accuracy of the proposed methodology is significantly higher than the baseline, i.e., random selection.
基于遗传算法的在线评论再购买意愿预测
本文提出了一种基于顾客评价和顾客陈述意愿的再购买意愿预测方法。然而,评论中有大量的词语。在预测模型中使用这些词作为特征往往会降低模型的精度,导致模型过拟合。提出了一种基于遗传算法的迭代改进方法。每条染色体被编码为词汇表中随机选择的一组单词索引。染色体的适应度是通过使用所选特征(即单词)的决策树预测模型的准确性来测量的。决策树模型还提供了特征重要性值,用于重新排列基因,使交叉过程确保重要的基因传递给后代。对于突变,有关特征的倾向等级的信息被用来改变一个基因。因此,交叉和突变程序不仅仅是组合和修改染色体。提出的方法在两个数据集上实现。对于这两个数据集,所提出方法的预测精度显著高于基线,即随机选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信