基于复杂网络的购物篮商品网络分析研究
发布时间:2018-09-15 19:27
【摘要】:超市已经成为人们生活中经常光顾的地方,超市里的商品琳琅满目,商品种类极端丰富,消费者需要处理的信息量急剧增加,已经面临不能从中有效选择所需商品的问题,导致在一个给定的时间内做出不够合理的购买决策。因此,需要超市管理者对消费者进行适当引导,并从中提高超市运营效率。而在超市管理中,商品布货管理和商品定价管理是影响超市成功运营的关键。为了能够科学合理的进行商品布货和定价,需要对商品之间的联系进行分析。也就是说,如果知道哪些商品经常被同时购买,哪些商品的销售会带动其他商品的销售,超市管理者就可以尽可能的把同时购买概率大的商品排放到相近的位置,,或对消费者进行交叉推荐以增加销量,选择那些能产生最大效益的商品进行促销等。因此,超市管理者就需要一个快速有效的分析方法对超市商品属性及相互关系进行分析,得出相应结论,进而可以引导消费者,更重要的是提高超市效益。 本文以某大型超市一个阶段内的销售账单为数据来源,利用复杂网络思想,对超市购物篮进行分析研究。主要研究工作有: (1)将超市购物篮问题转化为复杂网络问题,利用复杂网络思想对超市购物篮网络节点度分布、平均路径长度、聚类系数、网络密度以及鲁棒性和脆弱性进行分析研究; (2)对购物篮网络进行商品小团体分析,并从中得到核心商品,对核心商品进行分析研究; (3)利用贪婪算法研究购物篮网络,把购物篮网络划分成多个社团,找出每个社团中的关键商品以及把不同社团联系起来的起桥梁作用的商品,并对这些商品进行分析研究; (4)利用PageRank算法对购物篮商品进行PR值排序,并对所得结果进行合理性解释。
[Abstract]:Supermarkets have become a popular place for people to visit in their daily lives. The supermarket is full of goods, with extremely rich kinds of commodities, and the amount of information that consumers need to deal with increases dramatically. They are already faced with the problem of not being able to select the goods they need effectively from them. Leads to unreasonable purchasing decisions within a given period of time. Therefore, it is necessary for supermarket managers to guide consumers properly and improve the efficiency of supermarket operation. In supermarket management, commodity distribution management and commodity pricing management are the key to the successful operation of supermarket. In order to distribute and price goods scientifically and reasonably, it is necessary to analyze the relationship between commodities. That is to say, if you know which goods are often purchased at the same time, and which goods are sold at the same time, the supermarket manager can, as far as possible, emit the goods that are likely to be purchased at the same time to be close to each other. Or cross-recommend to consumers to increase sales, select the most effective products to promote, and so on. Therefore, supermarket managers need a fast and effective analysis method to analyze the commodity attributes and the relationship between them, and draw the corresponding conclusions, which can guide consumers and, more importantly, improve the efficiency of supermarkets. In this paper, the shopping basket of a large supermarket is analyzed and studied by using the complex network idea, taking the sales bill in one stage of a large supermarket as the data source. The main research works are as follows: (1) the supermarket shopping basket problem is transformed into a complex network problem. The distribution of node degree, average path length and clustering coefficient of supermarket shopping basket network are analyzed by using complex network theory. The network density, robustness and vulnerability are analyzed; (2) the shopping basket network is analyzed by commodity small group analysis, from which core commodities are obtained, and core commodities are analyzed and studied. (3) the greedy algorithm is used to study the shopping basket network. The shopping basket network is divided into several communities to find out the key items in each community and the goods that connect different communities. These items are analyzed and studied. (4) the PageRank algorithm is used to sort the PR value of the shopping basket items, and the results are explained reasonably.
【学位授予单位】:江苏科技大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:F721.7;F274;F224
本文编号:2244280
[Abstract]:Supermarkets have become a popular place for people to visit in their daily lives. The supermarket is full of goods, with extremely rich kinds of commodities, and the amount of information that consumers need to deal with increases dramatically. They are already faced with the problem of not being able to select the goods they need effectively from them. Leads to unreasonable purchasing decisions within a given period of time. Therefore, it is necessary for supermarket managers to guide consumers properly and improve the efficiency of supermarket operation. In supermarket management, commodity distribution management and commodity pricing management are the key to the successful operation of supermarket. In order to distribute and price goods scientifically and reasonably, it is necessary to analyze the relationship between commodities. That is to say, if you know which goods are often purchased at the same time, and which goods are sold at the same time, the supermarket manager can, as far as possible, emit the goods that are likely to be purchased at the same time to be close to each other. Or cross-recommend to consumers to increase sales, select the most effective products to promote, and so on. Therefore, supermarket managers need a fast and effective analysis method to analyze the commodity attributes and the relationship between them, and draw the corresponding conclusions, which can guide consumers and, more importantly, improve the efficiency of supermarkets. In this paper, the shopping basket of a large supermarket is analyzed and studied by using the complex network idea, taking the sales bill in one stage of a large supermarket as the data source. The main research works are as follows: (1) the supermarket shopping basket problem is transformed into a complex network problem. The distribution of node degree, average path length and clustering coefficient of supermarket shopping basket network are analyzed by using complex network theory. The network density, robustness and vulnerability are analyzed; (2) the shopping basket network is analyzed by commodity small group analysis, from which core commodities are obtained, and core commodities are analyzed and studied. (3) the greedy algorithm is used to study the shopping basket network. The shopping basket network is divided into several communities to find out the key items in each community and the goods that connect different communities. These items are analyzed and studied. (4) the PageRank algorithm is used to sort the PR value of the shopping basket items, and the results are explained reasonably.
【学位授予单位】:江苏科技大学
【学位级别】:硕士
【学位授予年份】:2014
【分类号】:F721.7;F274;F224
【参考文献】
相关期刊论文 前10条
1 史定华;;无标度网络:基础理论和应用研究[J];电子科技大学学报;2010年05期
2 周斌;程慧;杨立志;裴国庆;;基于贪婪算法的符号网络中社团结构快速发现算法[J];大众科技;2009年12期
3 金弟;刘大有;杨博;刘杰;何东晓;田野;;基于局部探测的快速复杂网络聚类算法[J];电子学报;2011年11期
4 王德兴;胡学钢;刘晓平;王浩;;改进购物篮分析的关联规则挖掘算法[J];重庆大学学报(自然科学版);2006年04期
5 刘涛,陈忠,陈晓荣;复杂网络理论及其应用研究概述[J];系统工程;2005年06期
6 欧瑞秋;杨建梅;常静;;企业-产品二分网络的社团结构分析——以中国汽车产业为例[J];管理学报;2010年09期
7 王伟;杨慧;龚凯;唐明;都永海;;复杂网络上的局域免疫研究[J];电子科技大学学报;2013年06期
8 王高峡;周康;;具有社团结构的小世界网络模型[J];华中科技大学学报(自然科学版);2010年06期
9 王杰;刚轶金;李凤光;吴伟巍;;改进贪婪算法在博客突发事件检测中的研究[J];计算机工程与应用;2008年34期
10 李孔文;顾庆;张尧;陈道蓄;;一种基于聚集系数的局部社团划分算法[J];计算机科学;2010年07期
本文编号:2244280
本文链接:https://www.wllwen.com/jingjilunwen/jingjiguanlilunwen/2244280.html