skip to main content
10.1145/2489247acmconferencesBook PagePublication PagesmodConference Proceedingsconference-collections
DyNetMM '13: Proceedings of the Workshop on Dynamic Networks Management and Mining
ACM2013 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
SIGMOD/PODS'13: International Conference on Management of Data New York New York June 22 - 27, 2013
ISBN:
978-1-4503-2209-6
Published:
22 June 2013
Sponsors:

Bibliometrics
Abstract

No abstract available.

Proceeding Downloads

Skip Table Of Content Section
research-article
Fast search for dynamic multi-relational graphs

Acting on time-critical events by processing ever growing social media or news streams is a major technical challenge. Many of these data sources can be modeled as multi-relational graphs. Continuous queries or techniques to search for rare events that ...

research-article
Identifying small subsets of agents for behavior tracking and abnormal event detection in dynamic networks

For very large dynamic networks, monitoring the behavior of a subset of agents provides an efficient framework for detecting changes in network topology. For example, in mobile caller networks with millions of subscribers, we would like to monitor the ...

research-article
Fully dynamic quasi-biclique edge covers via Boolean matrix factorizations

An important way of summarizing a bipartite graph is to give a set of (quasi-) bicliques that contain (almost) all of its edges. These quasi-bicliques are somewhat similar to clustering of the nodes, giving sets of similar nodes. Unlike clustering, ...

research-article
LabelRankT: incremental community detection in dynamic networks via label propagation

An increasingly important challenge in network analysis is efficient detection and tracking of communities in dynamic networks for which changes arrive as a stream. There is a need for algorithms that can incrementally update and monitor communities ...

Recommendations