Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluating similarity measures: a large-scale study in the orkut social network
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Fg-index: towards verification-free query processing on graph databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Prediction of Information Diffusion Probabilities for Independent Cascade Model
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Evaluating very large datalog queries on social networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Make new friends, but keep the old: recommending people on social networking sites
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
On the evolution of user interaction in Facebook
Proceedings of the 2nd ACM workshop on Online social networks
Personalized recommendation of social software items based on social relations
Proceedings of the third ACM conference on Recommender systems
Learning influence probabilities in social networks
Proceedings of the third ACM international conference on Web search and data mining
Randomization tests for distinguishing social influence and homophily effects
Proceedings of the 19th international conference on World wide web
On the quality of inferring interests from social neighbors
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
Graph homomorphism revisited for graph matching
Proceedings of the VLDB Endowment
Scalable Influence Maximization in Social Networks under the Linear Threshold Model
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Social linking and physical proximity in a mobile location-based service
Proceedings of the 1st international workshop on Mobile location-based service
A data-based approach to social influence maximization
Proceedings of the VLDB Endowment
Recommendations to boost content spread in social networks
Proceedings of the 21st international conference on World Wide Web
Friend or frenemy?: predicting signed ties in social networks
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Exploiting homophily effect for trust prediction
Proceedings of the sixth ACM international conference on Web search and data mining
| Hi-index | 0.00 |
Friending recommendation has successfully contributed to the explosive growth of online social networks. Most friending recommendation services today aim to support passive friending, where a user passively selects friending targets from the recommended candidates. In this paper, we advocate a recommendation support for active friending, where a user actively specifies a friending target. To the best of our knowledge, a recommendation designed to provide guidance for a user to systematically approach his friending target has not been explored for existing online social networking services. To maximize the probability that the friending target would accept an invitation from the user, we formulate a new optimization problem, namely, Acceptance Probability Maximization (APM), and develop a polynomial time algorithm, called Selective Invitation with Tree and In-Node Aggregation (SITINA), to find the optimal solution. We implement an active friending service with SITINA on Facebook to validate our idea. Our user study and experimental results reveal that SITINA outperforms manual selection and the baseline approach in solution quality efficiently.