SIAM Journal on Computing
Communications of the ACM
Communication Networks for Computers
Communication Networks for Computers
A Faster Katz Status Score Algorithm
Computational & Mathematical Organization Theory
Scaling personalized web search
WWW '03 Proceedings of the 12th international conference on World Wide Web
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient
SIAM Journal on Numerical Analysis
Measuring and extracting proximity graphs in networks
ACM Transactions on Knowledge Discovery from Data (TKDD)
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Introduction to Information Retrieval
Introduction to Information Retrieval
All-pairs shortest-paths for large graphs on the GPU
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Local Probabilistic Models for Link Prediction
ICDM '07 Proceedings of the 2007 Seventh IEEE International Conference on Data Mining
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Scalable proximity estimation and link prediction in online social networks
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Personalized social search based on the user's social network
Proceedings of the 18th ACM conference on Information and knowledge management
Modeling relationship strength in online social networks
Proceedings of the 19th international conference on World wide web
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
Fast and accurate estimation of shortest paths in large graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Fast incremental and personalized PageRank
Proceedings of the VLDB Endowment
Guess who?: enriching the social graph through a crowdsourcing game
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Fast personalized PageRank on MapReduce
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
Using social networks to enhance customer relationship management
Proceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems
| Hi-index | 0.00 |
Measuring proximity in a social network is an important task, with many interesting applications, including person search and link prediction. Person search is the problem of finding, by means of keyword search, relevant people in a social network. In user-centric person search, the search query is issued by a person participating in the social network and the goal is to find people that are relevant not only to the keywords, but also to the searcher herself. Link prediction is the task of predicting new friendships (links) that are likely to be added to the network. Both of these tasks require the ability to measure proximity of nodes within a network, and are becoming increasingly important as social networks become more ubiquitous. This chapter surveys recent work on scoring measures for determining proximity between nodes in a social network. We broadly identify various classes of measures and discuss prominent examples within each class. We also survey efficient implementations for computing or estimating the values of the proximity measures.