Analysis on Driving Force of Dishes Based on Complex Data Network in Catering Field

doi:10.3969/j.issn.1006-2475.2017.07.001

Abstract

Abstract: In catering field, the driving force of dishes can be defined as the ability of dishes to stimulate the overall consumption growth of other dishes due to their own consumption growth. However, there is no clear method to calculate the driving force of dishes. This paper puts forward a novel method to quantify the driving force of dishes through historical bills. First, the paper extracts the characteristics of dishes contained in dataset. Secondly, the paper analyzes the relationship between the dishes to build dishes complex networks, and then based on the complex network, the paper calculates the driving force of dishes through the network spreading procedure with a propagation model. Finally, the paper validates the effectiveness of the proposed method in the real historical billing data set of a catering enterprise.

Key words: driving force of dishes, complex network, network spread

CLC Number:

TP311

WEN Zhen-qian, LIN You-fang, WU Zhi-hao. Analysis on Driving Force of Dishes Based on Complex Data Network in Catering Field[J]. Computer and Modernization, doi: 10.3969/j.issn.1006-2475.2017.07.001.

References

［1］程慧芳. 浅析我国餐饮业服务营销现状及发展策略［J］. 现代经济信息, 2015(4)：352，354.
［2］Newman M E J. The structure and function of complex networks［J］. SIAM Review, 2003,45(2):167-256.
［3］Albert R, Barabási A， Barabasi. Statistical mechanics of complex networks［J］. Review of Modern Physics, 2002,74(1):47-97.
［4］Liu Li, Chen Xiwei, Liu Ming, et al. An influence power-based clustering approach with PageRank-like model［J］. Applied Soft Computing, 2015,40:17-32.
［5］赵晓荣. 复杂网络传播学中重要节点的发现［D］. 西安：西安电子科技大学, 2013.
［6］Pastor-Satorras R, Vespignani A. Epidemic spreading in scale-free networks［J］. Physical Review Letters, 2001,86(14):3200-3203.
［7］刘涛,陈忠,陈晓荣. 复杂网络理论及其应用研究概述［J］. 系统工程, 2005,23(6):1-7.
［8］Page L, Brin S, Motwani R, et al. The PageRank Citation Ranking: Bringing Order to the Web［R］. Technical Report, Stanford InfoLab. 1998:1-14.
［9］黄德才,戚华春. PageRank算法研究［J］. 计算机工程, 2006,32(4):145-146.
［10］Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network［C］// ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2003:137-146.
［11］Chen Wei, Yuan Yifei, Zhang Li. Scalable influence maximization in social networks under the linear threshold model［C］// IEEE International Conference on Data Mining. 2010:88-97.
［12］Goyal A, Lu Wei, Lakshmanan L V S. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model［C］// IEEE International Conference on Data Mining. 2011:211-220.
［13］Chen Wei, Wang Yajun, Yang Siyu. Efficient influence maximization in social networks［C］// Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2009:199-208.
［14］Morone F, Makse H A. Influence maximization in complex networks through optimal percolation［J］. Nature, 2015, 524(7563):65-68.
［15］吴凯,季新生,郭进时,等. 基于微博网络的影响力最大化算法［J］. 计算机应用, 2013,33(8):2091-2094.
［16］李国良,楚娅萍,冯建华,等. 多社交网络的影响力最大化分析［J］. 计算机学报, 2016,39(4):643-656.
［17］Domingos P, Richardson M. Mining the network value of customers［C］// Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2001:57-66.
［18］Richardson M, Domingos P. Mining knowledge-sharing sites for viral marketing［C］// Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2002:61-70.
［19］乌兰图雅,李东魁. 求解一类NP-HARD问题的一个快速算法［J］. 内蒙古大学学报(自然科学版), 2012,43(1):85-88.
［20］潘立登,黄晓峰. 用启发式贪心法求解旅行商问题［J］. 北京化工大学学报, 1998,25(2):46-51.
［21］Kazarlis S A, Bakirtzis A G, Petridis V. A genetic algorithm solution to the unit commitment problem［J］. IEEE Transactions on Power Systems, 1996,11(1):83-92.

[1]	ZHANG Xiao-fang, FENG Hui-fang. Dynamic Optimal Path Planning Based on Trajectory Big Data [J]. Computer and Modernization, 2021, 0(11): 82-88.
[2]	LI Wei-dong, XU Shu-kun, WANG Yun-ming. Analysis of New York Rail Transit Network Characteristics Based on Complex Network [J]. Computer and Modernization, 2021, 0(02): 94-99.
[3]	WANG Hai-hong, LIU Li. Improved Path Search Algorithm Based on Layering and Reinforcement Learning [J]. Computer and Modernization, 2020, 0(11): 77-82.
[4]	XU Xiao-yuan, LI Hai-bo, YU Ben-cheng, LIU Fang. Semi-supervised Overlapping Community Finding with Pairwise Constraints [J]. Computer and Modernization, 2020, 0(08): 63-68.
[5]	CHEN Jing-yi, XU Ming-hai, YANG Xi, DU Fan. An Improved HK Social Network Modeling Method [J]. Computer and Modernization, 2019, 0(02): 123-.
[6]	MA Jia-yan, WANG Ping,XIA Wei, SHEN Hong-wei. Research on Network Traffic Prediction and Early Warning in Complex Networks [J]. Computer and Modernization, 2018, 0(01): 102-106.
[7]	LIN Jia-qi, LU Gang, XU Nan-shan. A Fast Algorithm for Calculating APSP by Paths Block [J]. Computer and Modernization, 2017, 0(12): 6-11.
[8]	CHEN Gao, WU Guang-chao. Information Propagation Model in Online Social Network Based on PageRank [J]. Computer and Modernization, 2017, 0(1): 101-105.
[9]	LI Meng1,2, MA Yi-fang3, JIANG Xin1,2, MA Li-li4, ZHENG Zhi-ming1,2. Competition Dynamics of Information Propagation on Complex Network [J]. Computer and Modernization, 2016, 0(1): 104-107.
[10]	WANG Zhu. A New Social Network Modeling Method [J]. Computer and Modernization, 2015, 0(12): 57-.
[11]	FAN Chao1, WANG Zhong-xi2, GAO Lu-bin3. Visibility Network Analysis on Official Documents Distribution Records [J]. Computer and Modernization, 2014, 0(5): 150-155.
[12]	GAO Hongwei1, XU Yong2. Detecting Communities of Complex Networks Based on Dependence Degree of Two Nodes [J]. Computer and Modernization, 2014, 0(4): 109-112.
[13]	JIA Sui-min, HU Ming-sheng, JIA Zhi-juan. Spatio-temporal Trend and Seismic Anomaly of Historical Earthquake Based on Complex Network [J]. Computer and Modernization, 2014, 0(12): 1-5.