In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
An Intrusion Detection Program (IDP) analyzes what happens or has happened during an execution and tries to find indications that the computer has been misused. In this talk, we p...
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
Urban sensing, participatory sensing, and user activity recognition can provide rich contextual information for mobile applications such as social networking and location-based se...
Yi Wang, Jialiu Lin, Murali Annavaram, Quinn Jacob...
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...