Sciweavers

267 search results - page 26 / 54
» On the approximability of influence in social networks
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Distributed task allocation in social networks
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. W...
Mathijs de Weerdt, Yingqian Zhang, Tomas Klos
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 2 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
WWW
2007
ACM
14 years 9 months ago
Parallel crawling for online social networks
Given a huge online social network, how do we retrieve information from it through crawling? Even better, how do we improve the crawling performance by using parallel crawlers tha...
Duen Horng Chau, Shashank Pandit, Samuel Wang, Chr...
ALT
2010
Springer
13 years 10 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
KDD
2010
ACM
244views Data Mining» more  KDD 2010»
13 years 7 months ago
Finding effectors in social networks
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
Theodoros Lappas, Evimaria Terzi, Dimitrios Gunopu...