Sciweavers

65 search results - page 7 / 13
» Estimating the Size of Online Social Networks
Sort
View
89
Voted
PVLDB
2008
146views more  PVLDB 2008»
14 years 9 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
82
Voted
KDD
2010
ACM
265views Data Mining» more  KDD 2010»
14 years 11 months ago
Scalable influence maximization for prevalent viral marketing in large-scale social networks
Influence maximization, defined by Kempe, Kleinberg, and Tardos (2003), is the problem of finding a small set of seed nodes in a social network that maximizes the spread of influe...
Wei Chen, Chi Wang, Yajun Wang
ADBIS
2011
Springer
275views Database» more  ADBIS 2011»
13 years 9 months ago
An Analysis of the Structure and Dynamics of Large-Scale Q/A Communities
Abstract. In recent years, the World Wide Web (WWW) has transformed to a gigantic social network where people interact and collaborate in diverse online communities. By using Web 2...
Daniel Schall, Florian Skopik
105
Voted
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 12 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
86
Voted
WWW
2010
ACM
14 years 9 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han