Sciweavers

225 search results - page 29 / 45
» Hot Set Identification for Social Network Applications
Sort
View
KI
1998
Springer
13 years 11 months ago
From Theory to Practice in Multiagent System Design: The Case of Structural Co-operation
Abstract. In Distributed Problem-solving (DPS) systems a group of purposefully designed computational agents interact and co-ordinate their activities so as to jointly achieve a gl...
Sascha Ossowski, Ana García-Serrano, Jos&ea...
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
14 years 7 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
SOCIALCOM
2010
13 years 5 months ago
GDC: Group Discovery Using Co-location Traces
Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailab...
Steve Mardenfeld, Daniel Boston, Susan Juan Pan, Q...
SAC
2009
ACM
14 years 2 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
14 years 1 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