TPA: Fast, Scalable, and Accurate Method for Approximate Random Walk with Restart on Billion Scale Graphs
暂无分享,去创建一个
Minji Yoon | Jinhong Jung | U Kang | Minji Yoon | U. Kang | Jinhong Jung
[1] Lee Sael,et al. BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs , 2015, SIGMOD Conference.
[2] Jimeng Sun,et al. Neighborhood formation and anomaly detection in bipartite graphs , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).
[3] Ashish Goel,et al. FAST-PPR: scaling personalized pagerank estimation for large graphs , 2014, KDD.
[4] Ashish Goel,et al. Personalized PageRank Estimation and Search: A Bidirectional Approach , 2015, WSDM.
[5] Amy Nicole Langville,et al. Google's PageRank and beyond - the science of search engine rankings , 2006 .
[6] Ioannis Antonellis,et al. Simrank++: query rewriting through link analysis of the clickgraph (poster) , 2007, Proc. VLDB Endow..
[7] Christos Faloutsos,et al. Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining , 2011, 2011 IEEE 11th International Conference on Data Mining.
[8] Christos Faloutsos,et al. Random walk with restart: fast solutions and applications , 2008, Knowledge and Information Systems.
[9] Christos Faloutsos,et al. Axiomatic Analysis of Co-occurrence Similarity Functions , 2012 .
[10] Yasuhiro Fujiwara,et al. Fast and Exact Top-k Search for Random Walk with Restart , 2012, Proc. VLDB Endow..
[11] Jure Leskovec,et al. Supervised random walks: predicting and recommending links in social networks , 2010, WSDM '11.
[12] Lee Sael,et al. Random Walk with Restart on Large Graphs Using Block Elimination , 2016, ACM Trans. Database Syst..
[13] Christos Faloutsos,et al. Automatic multimedia cross-modal correlation discovery , 2004, KDD.
[14] Fan Chung Graham,et al. Local Graph Partitioning using PageRank Vectors , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[15] Rajeev Motwani,et al. The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.
[16] Yin Yang,et al. HubPPR: Effective Indexing for Approximate Personalized PageRank , 2016, Proc. VLDB Endow..
[17] Jinhong Jung,et al. A comparative study of matrix factorization and random walk with restart in recommender systems , 2017, 2017 IEEE International Conference on Big Data (Big Data).
[18] Jimmy J. Lin,et al. WTF: the who to follow service at Twitter , 2013, WWW.
[19] Inderjit S. Dhillon,et al. Overlapping community detection using seed set expansion , 2013, CIKM.
[20] Christos Faloutsos,et al. Center-piece subgraphs: problem definition and fast solutions , 2006, KDD '06.
[21] Lee Sael,et al. BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart , 2017, SIGMOD Conference.
[22] Michael R. Lyu,et al. MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching , 2009, CIKM.
[23] Jingrui He,et al. Manifold-ranking based image retrieval , 2004, MULTIMEDIA '04.
[24] Silvio Lattanzi,et al. A Local Algorithm for Finding Well-Connected Clusters , 2013, ICML.
[25] Jennifer Widom,et al. Scaling personalized web search , 2003, WWW '03.
[26] Lee Sael,et al. Personalized Ranking in Signed Networks Using Signed Random Walk with Restart , 2016, 2016 IEEE 16th International Conference on Data Mining (ICDM).
[27] Jimeng Sun,et al. Fast Random Walk Graph Kernel , 2012, SDM.
[28] Soumen Chakrabarti,et al. Index design and query processing for graph conductance search , 2011, The VLDB Journal.
[29] Jennifer Widom,et al. SimRank: a measure of structural-context similarity , 2002, KDD.
[30] David F. Gleich,et al. Approximating Personalized PageRank with Minimal Use of Web Graph Data , 2006, Internet Math..
[31] Yin Yang,et al. FORA: Simple and Effective Approximate Single-Source Personalized PageRank , 2017, KDD.