Browse > Article

랜덤 워크를 활용한 그래프 랭킹 기반 추천 시스템  

Jin, U-Jeong (서울대학교)
Jeong, Jin-Hong (서울대학교)
Gang, Yu (서울대학교)
Publication Information
Communications of the Korean Institute of Information Scientists and Engineers / v.34, no.6, 2016 , pp. 30-35 More about this Journal
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 L. Backstrom and J. Leskovec, "Supervised random walks: predicting and recommending links in social networks", In Proceedings of the fourth ACM international conference on Web search and data mining, pp. 635-644, 2011.
2 D. Liben-Nowell and J. Kleinberg, "The link prediction problem for social networks", Journal of the American society for information science and technology, Vol. 58, No. 7, pp. 1019-1031 , 2007.   DOI
3 L. Page and et al., "The PageRank citation ranking: bringing order to the web", 1999.
4 S. Brin and L. Page, "Reprint of: The anatomy of a large-scale hypertextual web search engine", Computer networks, Vol. 56, No. 18, pp. 3825-3833, 2012.   DOI
5 T. Haveliwala H, "Topic-sensitive pagerank", In Proceedings of the 11th international conference on World Wide Web, pp. 517-526, 2002.
6 J. Sun and et al., "Neighborhood formation and anomaly detection in bipartite graphs", In Data Mining, Fifth IEEE International Conference on, p. 8, 2005.
7 D. Gleich and M. Polito, "Approximating personalized pagerank with minimal use of web graph data", Internet Mathematics, Vol. 3, No. 3, pp. 257-294, 2006.   DOI
8 H. Tong, C. Faloutsos and J. Pan, "Fast random walk with restart and its applications", 2006.
9 Y. Fujiwara and et al., "Efficient personalized pagerank with accuracy assurance", In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovely and data mining, pp. 15-23, 2012.
10 Y. Fujiwara and et al., "Fast and exact top-k search for random walk with restart", Proceedings of the VLDB Endowment, Vol. 5, No. 5, pp. 442-453, 2012.   DOI
11 K. Shin and et al., "BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs", In Proceedings of the 20 15 ACM SIGMOD International Conference on Management of Data, pp. 1571-1585, 2015.
12 J. Jung and et al., "Random Wa1k with Restart on Large Graphs Using Block Elimination", ACM Transactions on Database Systems (TODS), Vol. 41 , No. 2, p. 12, 2016.
13 U. Kang and C. Faloutsos, "Beyond 'caveman communities' : Hubs and spokes for graph compression and mining" In Data Mining (ICDM), IEEE 11th International Conference on. IEEE, pp. 300-309, 2011.
14 Y. Lim, U. Kang and C. Faloutsos, "Slashburn: Graph compression and mining beyond caveman communities", Knowledge and Data Engineering, IEEE Transactions, Vol. 26, No. 12, pp. 3077-3089, 2014.   DOI
15 M. Shahriari and M. Jalili, "Ranking nodes in signed social networks", Social Network Analysis and Mining, Vol. 4, No. 1, pp. 1-12, 2014
16 Z. Wu, C. Aggarwal and J. Sun, "The Troll-Trust Model for Ranking in Signed Networks", In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, pp. 447-456, 2016.