Hao Wu, Jilles Vreeken, Nikolaj Tatti, Naren Ramakrishnan

Abstract

Many application domains such as intelligence analysis and cybersecurity require tools for the unsupervised identification of suspicious entities in multi-relational/network data. In particular, there is a need for automated semi-automated approaches to ‘uncover the plot’, i.e., to detect non-obvious coalitions of entities bridging many types of relations. We cast the problem of detecting such suspicious coalitions and their connections as one of mining surprisingly dense and well-connected chains of biclusters over multi-relational data. With this as our goal, we model data by the Maximum Entropy principle, such that in a statistically well-founded way we can gauge the surprisingness of a discovered bicluster chain with respect to what we already know. We design an algorithm for approximating the most informative multi-relational patterns, and provide strategies to incrementally organize discovered patterns into the background model. We illustrate how our method is adept at discovering the hidden plot in multiple synthetic and real-world intelligence analysis datasets. Our approach naturally generalizes traditional attribute-based maximum entropy models for single relations, and further supports iterative, human-in-the-loop, knowledge discovery.

People

Ramakrishnan-updated

Naren Ramakrishnan


hao-updated

Hao Wu


Publication Details

Date of publication:
July 22, 2014
Journal:
Springer Data Mining and Knowledge Discovery
Publisher:
Springer Science + Business Media
Page number(s):
1398--1428
Volume:
28
Issue Number:
5-6