• Publications
  • Influence
Graph based anomaly detection and description: a survey
Detecting anomalies in data is a vital task, with numerous high-impact applications in areas such as security, finance, health care, and law enforcement. While numerous techniques have been developedExpand
  • 681
  • 38
  • PDF
RolX: structural role extraction & mining in large graphs
Given a network, intuitively two nodes belong to the same role if they have similar structural behavior. Roles should be automatically determined from the data, and could be, for example,Expand
  • 288
  • 33
  • PDF
DELTACON: A Principled Massive-Graph Similarity Function
How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known nodeExpand
  • 165
  • 26
  • PDF
BIG-ALIGN: Fast Bipartite Graph Alignment
How can we find the virtual twin (i.e., the same or similar user) on Linked In for a user on Facebook? How can we effectively link an information network with a social network to supportExpand
  • 93
  • 15
  • PDF
DeltaCon: Principled Massive-Graph Similarity Function with Attribution
How much has a network changed since yesterday? How different is the wiring of Bob’s brain (a left-handed male) and Alice’s brain (a right-handed female), and how is it different? Graph similarityExpand
  • 70
  • 14
  • PDF
Anomaly detection in dynamic networks: a survey
Anomaly detection is an important problem with multiple applications, and thus has been studied for decades in various research domains. In the past decade there has been a growing interest inExpand
  • 179
  • 11
  • PDF
Unifying Guilt-by-Association Approaches: Theorems and Fast Algorithms
If several friends of Smith have committed petty thefts, what would you say about Smith? Most people would not be surprised if Smith is a hardened criminal. Guilt-by-association methods combine weakExpand
  • 97
  • 10
  • PDF
NetSimile: A Scalable Approach to Size-Independent Network Similarity
Given a set of k networks, possibly with different sizes and no overlaps in nodes or edges, how can we quickly assess similarity between them, without solving the node-correspondence problem?Expand
  • 72
  • 10
  • PDF
REGAL: Representation Learning-based Graph Alignment
Problems involving multiple networks are prevalent in many scientific and other domains. In particular, network alignment, or the task of identifying corresponding nodes in different networks, hasExpand
  • 62
  • 10
  • PDF
Network similarity via multiple social theories
Given a set of k networks, possibly with different sizes and no overlaps in nodes or links, how can we quickly assess similarity between them? Analogously, are there a set of social theories which,Expand
  • 58
  • 10
  • PDF