[1] |
DEAN J , GHEMAWAT S . MapReduce:simplified data processing on large clusters[J]. Communications of the ACM, 2008,51(1): 107-113.
|
[2] |
SUOMELA J . Survey of local algorithms[J]. ACM Computing Surveys (CSUR), 2013,45(2): 94-111.
|
[3] |
DESIKAN P , PATHAK N , SRIVASTAVA J ,et al. Incremental page rank computation on evolving graphs[C]// The 14th International Conference on World Wide Web,May 10-14,2005, Chiba,Japan. New York: ACM Press, 2005: 1094-1095.
|
[4] |
BAHMANI B , CHOWDHURY A , GOEL A . Fast incremental and personalized PageRank[J]. Proceedings of the VLDB Endowment, 2010,4(3): 173-184.
|
[5] |
WATTS D J , STROGATZ S H . Collective dynamics of “small-world” networks[J]. Nature, 1998,393(6684): 440-442.
|
[6] |
HOLME P , SARAM?KI J . Temporal networks[J]. Physics Reports, 2011,519(3): 97-125.
|
[7] |
PAN R K,SARAM?KI J . Path lengths,correlations,and centrality in temporal networks[J]. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2011,84(1 Pt 2): 1577-1589.
|
[8] |
NEWMAN M E J . Modularity and community structure in networks[J]. Proceedings of the National Academy of Sciences, 2006,103(1): 8577-8582.
|
[9] |
FORTUNATO S . Community detection in graphs[J]. Physics Reports, 2010,486(3-5): 75-174.
|
[10] |
NEWMAN M E J . Fast algorithm for detecting community structure in networks[J]. Physics Review, 2004,E69,066133.
|
[11] |
SCHAFER L , GRAHAM J W . Missing data:our view of the state of the art[J]. Psychological Methods, 2002,7(2): 147-177.
|
[12] |
ZHANG Q M,Lü L , WANG W Q ,et al. Potential theory for directed networks[J]. Plos One, 2013,8(2):e55437.
|
[13] |
AGGARWAL C C , WOLF J L , WU K L ,et al. Horting hatches an egg:a new graph-theoretic approach to collaborative filtering[C]// The Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 15-18,1999,San Diego,CA,USA. New York:ACM Press, 1999: 201-212.
|
[14] |
HUANG Z , ZENG D , CHEN H . Analyzing consumer-product graphs:empirical findings and applications inrecommender systems[J]. Management science, 2007,53(7): 1146-1164.
|
[15] |
Lü L , ZHOU T . Link prediction in complex networks:a survey[J]. Physica A Statistical Mechanics & Its Applications, 2011,390(6): 1150-1170.
|
[16] |
Lü L , PAN L , ZHOU T ,et al. Toward link predictability of complex networks[J]. Proceedings of the National Academy of Sciences of the United States of America, 2015,112(8): 2325-2330.
|
[17] |
MAN T , SHEN H W , HUANG J M ,et al. Context-adaptive matrix factorization for multi-context recommendation[C]// The 24th ACM International Conference on Information and Knowledge Management(CIKM),October 19-23,2015, Melbourne,Australia. New York: ACM Press, 2015: 901-910.
|
[18] |
WANG P F , GUO J F , LAN Y Y ,et al. Learning hierarchical representation model for next basket recommendation[C]// The 38th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2015),August 9-13,2015, Santiago,Chile. New York: ACM Press, 2015: 403-412.
|
[19] |
SUN X M , ZHANG J , ZHANG J L . Solving multi-choice secretary problem in parallel:an optimal observation-selection protocol[C]// The 25th International Symposium on Algorithms and Computation (ISAAC 2014),December 1517,2014, Jeonju,Korea.[S.l.]: Springer International Publishing, 2014: 661-673.
|
[20] |
SHAO J , HAN Z , YANG Q ,et al. Community detection based on distance dynamics[C]// The 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 10-13,2015, Sydney,Australia. New York: ACM Press, 2015: 1075-1084.
|
[21] |
HUANG Q , LIU X W , SUN X M ,et al. How to select the top-k elements from evolving data?[C]// The 26th International Symposium on Algorithms and Computation (ISAAC 2015),August 3-8,2015, Macao,China. New York: ACM Press, 2015: 60-70.
|
[22] |
YANG Z , CHEN W . A game theoretic model for the formation of navigable small-world networks[C]// The 4th International World Wide Web Conference (WWW’2015),May 18-22,2015, Florence,Italy. 2015.
|
[23] |
ZHANG P , CHEN W , SUN X M ,et al. Minimizing seed set selection with probabilistic coverage guarantee in a social network[C]// The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,August 24-27,2014,New York,USA. New York:ACM Press, 2014: 1306-1315.
|
[24] |
SHAN X H , CHEN W , LI Q ,et al. Cumulative activation in social networks[J]. 2016,arXiv:1605.04635.
|
[25] |
LU W , CHEN W , LAKSHMANAN L V S . From competition to complementarity:comparative influence diffusion and maximization[C]// The 42nd International Conference on Very Large Data Bases (VLDB’2016),September 5-9,2016,New Delhi,India. New York:ACM Press, 2015: 60-71.
|
[26] |
ZHONG L F , LIU J G , SHANG M S . Iterative resource allocation based on propagation feature of node for identifying the influential nodes[J]. Physics Letters A, 2015,379(38): 2272-2276.
|