Cheng-Te Li
ABSTRACT
This paper solves a region-based subgraph discovery problem. We are given a social network and some sample nodes which is supposed to belong to a specific region, and the goal is to obtain a subgraph that contains the sampled nodes with other nodes in the same region. Such regional subgraph discovery can benefit region-based applications, including scholar search, friend suggestion, and viral marketing. To deal with this problem, we assume there is a hidden backbone connecting the query nodes directly or indirectly in their region. The idea is that individuals belonging to the same region tend to share similar interests and cultures. By modeling such fact on edge weights, we search the graph to extract the regional backbone with respect to the query nodes. Then we can expand the backbone to derive the regional network. Experiments on a DBLP co-authorship network show the proposed method can effectively discover the regional subgraph with high precision scores.
- M. D. Choudhury, W. A. Mason, J. M. Hofman, and D. J. Watts. Inferring Relevant Social Networks from Interpersonal Communication. In WWW 2010. Google Scholar
Digital Library
- J. Leskovec, K. Lang, and M. Mahoney. Empirical Comparison of Algorithms for Network Community Detection. In WWW 2010. Google ScholarDigital Library
- Y. Matsuo, J. Mori, M. Hamasaki, K. Ishida, T. Nishimura, H. Takeda, K. Hasida, and M. Ishizuka. POLYPHONET: an Advanced Social Network Extraction System from the Web. In WWW 2006. Google ScholarDigital Library
- H. Takahashi and A. Matsuyama. An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 1980.Google Scholar
- J. Tang, J. Zhang, L. Yao, J. Li, L. Zhang, and Z. Su. ArnetMiner: Extraction and Mining of Academic Social Networks. In KDD 2008. Google ScholarDigital Library
- H. Tong, C. Faloutsos, and J. Y. Pan. Fast Random Walk with Restart and Its Applications. In ICDM 2006. Google ScholarDigital Library
Index Terms
- Regional subgraph discovery in social networks
Recommendations
Neighborhood-Based Route Discovery Protocols for Mobile Ad Hoc Networks
Network-wide broadcasting is used extensively in mobile ad hoc networks for route discovery and for disseminating data throughout the network. Flooding is a common approach to performing network-wide broadcasting. Although it is a simple mechanism that ...
Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks
LCN '07: Proceedings of the 32nd IEEE Conference on Local Computer NetworksConventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, where a mobile node blindly rebroadcasts received Route Request (RREQ) packets until a route to a particular destination is established. This can ...
Social Profile Aware AODV Protocol for Ad-Hoc Social Networks
Ad-hoc social networks are required to strengthen local communication between people. Mobile ad-hoc social networks have emerged as self-configuring and self-organizing social networks to facilitate interactions among different mobile users without ...
Comments