Guide query in social networks

Authors:
Yu-Chieh Lin;Philip S. Yu;Ming-Syan Chen
Affiliations:
Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Dept. of Computer Science, University of Illinois at Chicago, Chicago, IL;Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan,Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan
Venue:
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Year:
2013

Citing 10
Cited 0

Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast discovery of connection subgraphs

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity in networks

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Formal Models for Expert Finding on DBLP Bibliography Data

ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Finding a team of experts in social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Extracting influential nodes for information diffusion on a social network

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
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
Community-based greedy algorithm for mining top-K influential nodes in mobile social networks

Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
BASSET: scalable gateway finder in large graphs

PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Instant social graph search

PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a new problem of social guide query, which is to find the most informative neighboring nodes of the query node considering the given requirements. After the target nodes are identified, instead of directly providing information of the target nodes, we would like to find the querier's friends who are targets or who can introduce the querier to some targets. To answer the social guide query, we define InfScore based on an existing model of influence diffusion. In addition, we define DivScore that can be integrated in the ranking process to appreciate the diversity of possibly accessible target nodes. To evaluate the guide query, we develop a prototype system using the coauthor network of DBLP computer science bibliography. The results show that the guide query is practical, which can provide valuable answers efficiently.