Sciweavers

274 search results - page 6 / 55
» Identifying sets of key players in a social network
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding tribes: identifying close-knit individuals from employment patterns
We present a family of algorithms to uncover tribes--groups of individuals who share unusual sequences of affiliations. While much work inferring community structure describes lar...
Lisa Friedland, David Jensen
FDG
2009
ACM
14 years 2 months ago
Exertion in networked games
Physical play familiar from sports activities is a favorite pastime across all cultures and has been attributed with many social, mental and physical health benefits. However, the...
Florian Mueller
ISI
2008
Springer
13 years 8 months ago
Detecting Hidden Hierarchy in Terrorist Networks: Some Case Studies
This paper provides a novel algorithm to automatically detect the hidden hierarchy in terrorist networks. The algorithm is based on centrality measures used in social network analy...
Nasrullah Memon, Henrik Legind Larsen, David L. Hi...
CSCW
2002
ACM
13 years 8 months ago
Contact management: identifying contacts to support long-term communication
Much of our daily communication activity involves managing interpersonal communications and relationships. Despite its importance, this activity of contact management is poorly un...
Steve Whittaker, Quentin Jones, Loren G. Terveen