FastIncrementalProximitySearchinLargeGraphs详解.pptVIP

Fast Incremental Proximity Search in Large Graphs Purnamrita Sarkar Andrew W. Moore Amit Prakash Recommender systems Content-based search in databases{1,2} Proximity measures on graphs For ranking we need proximity measures Personalized pagerank Hitting/commute times Truncated hitting and commute times We will present an algorithm to compute nearest neighbors in truncated hitting and commute times on the fly. Empirically show that these truncated measures perform better than the others in most cases. Outline Ranking Problem on graphs Background Random walks Standard and truncated measures Previous work Our contribution Theoretical justification Algorithm sketch Experimental results Random walks Start at 1 Random walks Start at 1 Pick a neighbor i uniformly at random Move to i Random walks Start at 1 Pick a neighbor i uniformly at random Move to i Continue. Random walks Start at 1 Pick a neighbor i uniformly at random Move to i Continue. Hitting time from i to j Hitting time from i to j Hitting time from i to j Random walk-based proximity measures Hitting time can be defined recursively Symmetric version: commute time Hitting Commute times: Drawbacks Predictive power Hitting time and Commute times often take into account very long paths.1,2 You are more prone to pick up popular entities.1,2 Bad for personalization. Alice likes cartoons, so her top 10 recommendations should not be the 10 most popular movies. As a result these do not perform well for link prediction1,2. A better proximity measure based on truncated random walks We use a truncated version of hitting and commute times, which only considers paths of length at most T 15 nearest neighbors of node 95 (in red) Truncated Hitting Commute times For small T Are not sensitive to long paths Do not necessarily favor high degree nodes These are also easier to compute compared to un-truncated hitting and commute times Nearest neighbors of a node:Computational complexity of truncated