［1］DOMINGOS P,RICHARDSON M.Mining the network value of customers［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2001:57-66.
［2］KEMPE D,KLEINBERG J,TARDOSE.Maximizing the spread of influence through a social network［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2003:137-146.
［3］LESKOVEC J,KRAUSE A,GUESTRIN C,et al.Cost-effective outbreak detection in networks［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2007:420-429.
［4］GOYAL A,LU W,LAKSHMANAN L V S.CELF++:optimizing the greedy algorithm for influence maximization in social networks［C］//Proceedings of International Conference on World Wide Web.New York,USA:ACM Press,2011:47-48.
［5］CHEN Wei,WANG Yajun,YANG Siyu.Efficient influence maximization in social networks［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2009:199-208.
［6］WASSERMAN S,FAUST K.Social network analysis［J］.Encyclopedia of Social Network Analysis & Mining,2011,22(Suppl 1):109-127.
［7］BRIN S,PAGE L.The anatomy of a large-scale hypertextual web search engine［J］.Computer Networks & Isdn Systems,1998,30(1-7):107-117.
［8］CHEN W,WANG C,WANG Y.Scalable influence maximization for prevalent viral marketing in large-scale social networks［C］//Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM
Press,2010:1029-1038.
［9］SONG Guojie,ZHOU Xiabing,WANG Yu,et al.Influence maximization on large-scale mobile social network:a divide-and-conquer method［J］.IEEE Transactions on Parallel & Distributed Systems,2015,26(5):1379-1392.
［10］ZHOU Chuan,ZHANG Peng,ZANG Wenyu,et al.On the upper bounds of spread for greedy algorithms in social network influence maximization［J］.IEEE Transactions on Knowledge & Data Engineering,2015,27(10):1.
［11］LI Ji,CAI Zhipeng,YAN Mingyuan,et al.Using crowdsourced data in location-based social networks to explore influence maximization［C］//Proceedings of IEEE Conference on Computer Communications.Washington D.C.,USA:IEEE Press,2016:1-9.
(下转第200页)
(上接第193页)
［12］曹玖新,董丹,徐顺,等.一种基于k-核的社会网络影响最大化算法［J］.计算机学报,2015,38(2):238-248.
［13］MIAO Yu,WU Yang,WANG Wei,et al.UGGreedy:Influence maximization for user group in microb-logging［J］.Chinese Journal of Electronics,2016,25(2):241-248.
［14］GRANOVETTER M.Threshold models of collective behavior［J］.American Journal of Sociology,1978,83(6):1420-1443.
［15］WATTS D J.A simple model of global cascades on random networks［J］.Proceedings of the National
Academy of Sciences of the United States of America,2002,99(9):5766-5771.
［16］LESKOVEC J.Wikipedia vote network［EB/OL］.［2017-03-10］.http://snap.stanford.edu/data/wiki-Vote.html.
［17］ELMACIOGLU E,LEE D.On six degrees of separation in DBLP-DB and more［J］.Acm Sigmod Record,2005,34(2):33-40.
［18］LESKOVEC J.Social corcles:twitter［EB/OL］.［2017-03-10］.http://snap.stanford.edu/data/egonets-Twitter.html.
|