【摘要】：超市已經(jīng)成為人們生活中經(jīng)常光顧的地方，超市里的商品琳瑯滿目，商品種類極端豐富，消費(fèi)者需要處理的信息量急劇增加，已經(jīng)面臨不能從中有效選擇所需商品的問題，導(dǎo)致在一個給定的時間內(nèi)做出不夠合理的購買決策。因此，需要超市管理者對消費(fèi)者進(jìn)行適當(dāng)引導(dǎo)，并從中提高超市運(yùn)營效率。而在超市管理中，商品布貨管理和商品定價管理是影響超市成功運(yùn)營的關(guān)鍵。為了能夠科學(xué)合理的進(jìn)行商品布貨和定價，需要對商品之間的聯(lián)系進(jìn)行分析。也就是說，如果知道哪些商品經(jīng)常被同時購買，哪些商品的銷售會帶動其他商品的銷售，超市管理者就可以盡可能的把同時購買概率大的商品排放到相近的位置，，或?qū)οM(fèi)者進(jìn)行交叉推薦以增加銷量，選擇那些能產(chǎn)生最大效益的商品進(jìn)行促銷等。因此，超市管理者就需要一個快速有效的分析方法對超市商品屬性及相互關(guān)系進(jìn)行分析，得出相應(yīng)結(jié)論，進(jìn)而可以引導(dǎo)消費(fèi)者，更重要的是提高超市效益。 本文以某大型超市一個階段內(nèi)的銷售賬單為數(shù)據(jù)來源，利用復(fù)雜網(wǎng)絡(luò)思想，對超市購物籃進(jìn)行分析研究。主要研究工作有： （1）將超市購物籃問題轉(zhuǎn)化為復(fù)雜網(wǎng)絡(luò)問題，利用復(fù)雜網(wǎng)絡(luò)思想對超市購物籃網(wǎng)絡(luò)節(jié)點(diǎn)度分布、平均路徑長度、聚類系數(shù)、網(wǎng)絡(luò)密度以及魯棒性和脆弱性進(jìn)行分析研究； （2）對購物籃網(wǎng)絡(luò)進(jìn)行商品小團(tuán)體分析，并從中得到核心商品，對核心商品進(jìn)行分析研究； （3）利用貪婪算法研究購物籃網(wǎng)絡(luò)，把購物籃網(wǎng)絡(luò)劃分成多個社團(tuán)，找出每個社團(tuán)中的關(guān)鍵商品以及把不同社團(tuán)聯(lián)系起來的起橋梁作用的商品，并對這些商品進(jìn)行分析研究； （4）利用PageRank算法對購物籃商品進(jìn)行PR值排序，并對所得結(jié)果進(jìn)行合理性解釋。
[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.
【學(xué)位授予單位】：江蘇科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：F721.7;F274;F224

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 史定華;;無標(biāo)度網(wǎng)絡(luò):基礎(chǔ)理論和應(yīng)用研究[J];電子科技大學(xué)學(xué)報;2010年05期

2 周斌;程慧;楊立志;裴國慶;;基于貪婪算法的符號網(wǎng)絡(luò)中社團(tuán)結(jié)構(gòu)快速發(fā)現(xiàn)算法[J];大眾科技;2009年12期

3 金弟;劉大有;楊博;劉杰;何東曉;田野;;基于局部探測的快速復(fù)雜網(wǎng)絡(luò)聚類算法[J];電子學(xué)報;2011年11期

4 王德興;胡學(xué)鋼;劉曉平;王浩;;改進(jìn)購物籃分析的關(guān)聯(lián)規(guī)則挖掘算法[J];重慶大學(xué)學(xué)報(自然科學(xué)版);2006年04期

5 劉濤,陳忠,陳曉榮;復(fù)雜網(wǎng)絡(luò)理論及其應(yīng)用研究概述[J];系統(tǒng)工程;2005年06期

6 歐瑞秋;楊建梅;常靜;;企業(yè)-產(chǎn)品二分網(wǎng)絡(luò)的社團(tuán)結(jié)構(gòu)分析——以中國汽車產(chǎn)業(yè)為例[J];管理學(xué)報;2010年09期

7 王偉;楊慧;龔凱;唐明;都永海;;復(fù)雜網(wǎng)絡(luò)上的局域免疫研究[J];電子科技大學(xué)學(xué)報;2013年06期

8 王高峽;周康;;具有社團(tuán)結(jié)構(gòu)的小世界網(wǎng)絡(luò)模型[J];華中科技大學(xué)學(xué)報(自然科學(xué)版);2010年06期

9 王杰;剛軼金;李鳳光;吳偉巍;;改進(jìn)貪婪算法在博客突發(fā)事件檢測中的研究[J];計算機(jī)工程與應(yīng)用;2008年34期

10 李孔文;顧慶;張堯;陳道蓄;;一種基于聚集系數(shù)的局部社團(tuán)劃分算法[J];計算機(jī)科學(xué);2010年07期

本文編號：2244280