Discovering Hidden Groups in Communication Networks

13 years 10 months ago

Download www.cs.rpi.edu

We describe models and eﬃcient algorithms for detecting groups (communities) functioning in communication networks which attempt to hide their functionality – hidden groups. Our results reveal the properties of the background network activity that make detection of the hidden group easy, as well as those that make it diﬃcult.

Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ism

Real-time Traffic

Background Network Activity | Eﬃcient Algorithms | Hidden Group | ISI 2004 |

claim paper

» SIGHTS A Software System for Finding Coalitions and Leaders in a Social Network

» Discovering Hidden Evidence

» CommunicationEfficient Group Key Agreement

» Collaborative Mining in Multiple Social Networks Data for Criminal Group Discovery

» AS alliance cooperatively improving resilience of intraalliance communication

» Global Discovery Service for JMX Architecture

» Localized Group Membership Service for Ad Hoc Networks

» Interactive Communication Diagnosis and Error Control in Networks

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	ISI
Authors	Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace

Comments (0)

Sciweavers

Discovering Hidden Groups in Communication Networks

Background Network Activity | Eﬃcient Algorithms | Hidden Group | ISI 2004 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers