[1] ASHISH G,et al.The who-to-follow system at twitter:Strategy,algorithms,and revenue impact[J].Interfaces,2015,45(1):98-107.
[2] FORTUNATO S.Community detection in graphs[J].Physics Reports,2010,486(3-5):75-174.
[3] 俞春花,等.基于上下文相似度和社会网络的移动服务推荐方法[J].电子学报,2017,45(6):1530-1536. YU Chu-hua,et al.Mobie service recommendation based on context similairity and social network[J].Acta Electronica Sinica,2017,45(6):1530-1536.(in Chinese)
[4] JEH G,WIDOM J.Scaling Personalized Web Search[OL].http://www2003.org/cdrom/papers/refereed/p185/html/p185-jeh.html.2018-12-01.
[5] JEH G,WIDOM J.SimRank:A Measure of Structural-Context Similarity[OL].http://ilpubs.stanford.edu:8090/508/1/2001-41.pdf.2018-12-01.
[6] 张应龙,等.信息网络中一个有效的基于链接的结点相似度度量[J].软件学报,2014,25(11):2602-2615. ZHANG Y,et al.Effective link-based measure of node similarity on information networks[J].Journal of Software,2014,25(11):2602-2615.(in Chinese)
[7] KYROLA A,et al.Graphchi:Large-scale graph computation on just a PC[A].Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation[C].US:USENIX Association,2012.31-46.
[8] 吴城文,等.从系统角度审视大图计算[J].大数据,2015,1(3):39-47. WU C.et al.Reviewing large graph computing from a system perspective[J].Big Data Research,2015,1(3):39-47.(in Chinese)
[9] CHENG J,et al.VENUS:Vertex-centric streamlined graph computation on a single PC[A].Proceedings of IEEE 31st International Conference on Data Engineering[C].New York:IEEE,2015.1131-1142.
[10] ZHU X,et al.GridGraph:Large-scale graph processing on a single machine using 2-level hierarchical partitioning[A].Proceedings of the 13th USENIX Conference on Operating Systems Design and Implementation[C].US:USENIX Association,2015.375-386.
[11] CHI Y,et al.NXgraph:An efficient graph processing system on a single machine[A].Proceedings of IEEE 32nd International Conference on Data Engineering[C].New York:IEEE,2016.409-420.
[12] 吴甘沙.大数据技术发展的十个前沿方向(中)[J].大数据,2015,1(2):109-117. WU G-S.Ten fronties for big data technologies(Part B)[J].Big Data Research,2015,1(2):109-117.(in Chinese)
[13] LIZORKIN D,et al.Accuracy estimate and optimization techniques for simrank computation[J].VLDB Journal,2010,19(1):45-66.
[14] YU W,et al.Dynamical SimRank search on time-varying networks[J].VLDB Journal,2018,27(1):79-104.
[15] WANG S,et al.FORA:Simple and effective approximate single-source personalized pagerank[A].Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery in Data Mining[C].New York:ACM,2017.505-514.
[16] MINHAO J,et al.READS:a random walk approach for efficient and accurate dynamic SimRank[J].Proceedings of VLDB Endow,2017,10(9):937-948.
[17] PEROZZI B,et al.Deepwalk:online learning of social representations[A].Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining[C].New York:ACM,2014.701-710. |