基于社区挖掘的购物数据集中顾客购买行为预测

C. Spoorthi, Pushpa Ravi Kumar
{"title":"基于社区挖掘的购物数据集中顾客购买行为预测","authors":"C. Spoorthi, Pushpa Ravi Kumar","doi":"10.1109/ICAIT47043.2019.8987246","DOIUrl":null,"url":null,"abstract":"Evolution of technology has resulted in a significant growth in each and every field starting from business to research. This growth has caused a great impact in growing the business revenue. Multiple E-commerce sectors have been evolving day by day which are working day and night to reach the peak. At present the research is being carried out in every sector to determine the frequent customers, analyze their behaviour in terms their purchase and various other factors. The main aim is to get hold of the loyal customer by satisfying their needs. So every ecommerce sectors are moving in the direction to determine the best model to identify such key players. Key player is the one who is found to make the frequent purchase which helps to increases the revenue of retailers. The historical data has to be used to perform the analysis of key players in a shopping data set. Handling such huge data requires best tools and techniques and one such domain is Data Mining. In this proposed work an efficient model is developed by applying the data mining techniques such as preprocessing, feature selection, community build and mining. The dataset collected has to be cleaned in order to reduce the computation and to eliminate the error rate for which preprocessing is carried out using the algorithm regex and mean weighted average vector. The preprocessed data has to be reduced in terms of its dimension for which the feature selection is applied. The algorithms PCA with accuracy 89%, recursive feature elimination with accuracy 67% and Karl Pearson Correlation is also used and compared. The community is built for the extracted features using dependency algorithm. Community mining techniques has been applied to find the degreeness, closeness, betweeness property of the nodes is used to find the key player among the communities.","PeriodicalId":221994,"journal":{"name":"2019 1st International Conference on Advances in Information Technology (ICAIT)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Community Mining for Predicting the Purchasing Behaviour of Customer in Shopping Dataset\",\"authors\":\"C. Spoorthi, Pushpa Ravi Kumar\",\"doi\":\"10.1109/ICAIT47043.2019.8987246\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Evolution of technology has resulted in a significant growth in each and every field starting from business to research. This growth has caused a great impact in growing the business revenue. Multiple E-commerce sectors have been evolving day by day which are working day and night to reach the peak. At present the research is being carried out in every sector to determine the frequent customers, analyze their behaviour in terms their purchase and various other factors. The main aim is to get hold of the loyal customer by satisfying their needs. So every ecommerce sectors are moving in the direction to determine the best model to identify such key players. Key player is the one who is found to make the frequent purchase which helps to increases the revenue of retailers. The historical data has to be used to perform the analysis of key players in a shopping data set. Handling such huge data requires best tools and techniques and one such domain is Data Mining. In this proposed work an efficient model is developed by applying the data mining techniques such as preprocessing, feature selection, community build and mining. The dataset collected has to be cleaned in order to reduce the computation and to eliminate the error rate for which preprocessing is carried out using the algorithm regex and mean weighted average vector. The preprocessed data has to be reduced in terms of its dimension for which the feature selection is applied. The algorithms PCA with accuracy 89%, recursive feature elimination with accuracy 67% and Karl Pearson Correlation is also used and compared. The community is built for the extracted features using dependency algorithm. Community mining techniques has been applied to find the degreeness, closeness, betweeness property of the nodes is used to find the key player among the communities.\",\"PeriodicalId\":221994,\"journal\":{\"name\":\"2019 1st International Conference on Advances in Information Technology (ICAIT)\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 1st International Conference on Advances in Information Technology (ICAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAIT47043.2019.8987246\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Advances in Information Technology (ICAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIT47043.2019.8987246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

技术的发展导致了从商业到研究的每一个领域的显著增长。这种增长对业务收入的增长产生了很大的影响。多个电子商务部门都在不断发展,日以继夜地工作,以达到顶峰。目前,研究正在每个部门进行,以确定常客,分析他们的购买行为和各种其他因素。主要目的是通过满足忠实客户的需求来抓住他们。因此,每个电子商务部门都在朝着确定最佳模式的方向发展,以确定这些关键参与者。关键人物是指那些经常购买商品的人,这有助于增加零售商的收入。历史数据必须用于对购物数据集中的关键参与者进行分析。处理如此庞大的数据需要最好的工具和技术,其中一个领域就是数据挖掘。本文采用数据挖掘技术,如预处理、特征选择、社区构建和挖掘,建立了一个高效的模型。为了减少计算量和消除错误率,必须对收集到的数据集进行清理,并使用正则表达式和平均加权平均向量进行预处理。预处理后的数据必须根据应用特征选择的维度进行降维。并对准确率为89%的PCA、准确率为67%的递归特征消除算法和卡尔·皮尔逊相关算法进行了比较。使用依赖算法为提取的特征构建社区。社团挖掘技术用于发现节点的度、紧密度、间性,用于寻找社团中的关键角色。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Community Mining for Predicting the Purchasing Behaviour of Customer in Shopping Dataset
Evolution of technology has resulted in a significant growth in each and every field starting from business to research. This growth has caused a great impact in growing the business revenue. Multiple E-commerce sectors have been evolving day by day which are working day and night to reach the peak. At present the research is being carried out in every sector to determine the frequent customers, analyze their behaviour in terms their purchase and various other factors. The main aim is to get hold of the loyal customer by satisfying their needs. So every ecommerce sectors are moving in the direction to determine the best model to identify such key players. Key player is the one who is found to make the frequent purchase which helps to increases the revenue of retailers. The historical data has to be used to perform the analysis of key players in a shopping data set. Handling such huge data requires best tools and techniques and one such domain is Data Mining. In this proposed work an efficient model is developed by applying the data mining techniques such as preprocessing, feature selection, community build and mining. The dataset collected has to be cleaned in order to reduce the computation and to eliminate the error rate for which preprocessing is carried out using the algorithm regex and mean weighted average vector. The preprocessed data has to be reduced in terms of its dimension for which the feature selection is applied. The algorithms PCA with accuracy 89%, recursive feature elimination with accuracy 67% and Karl Pearson Correlation is also used and compared. The community is built for the extracted features using dependency algorithm. Community mining techniques has been applied to find the degreeness, closeness, betweeness property of the nodes is used to find the key player among the communities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信