Temporal Subgraph Isomorphism
|Title:||Temporal Subgraph Isomorphism||Authors:||Redmond, Ursula
|Permanent link:||http://hdl.handle.net/10197/7547||Date:||28-Aug-2013||Online since:||2016-04-06T11:14:28Z||Abstract:||Temporal information is increasingly available with network data sets. This information can expose underlying processes in the data via sequences of link activations. Examples range from the propagation of ideas through a scientific collaboration network, to the spread of disease via contacts between infected and susceptible individuals. We focus on the flow of funds through an online financial transaction network, in which given patterns might signify suspicious behaviour. The search for these patterns may be formulated as a temporally constrained subgraph isomorphism problem. We compare two algorithms which use temporal data at different stages during the search, and empirically demonstrate one to be significantly more efficient.||Funding Details:||Science Foundation Ireland||Type of material:||Conference Publication||Publisher:||IEEE||Copyright (published version):||2013 ACM||Keywords:||Subgraph isomorphism problem; Temporal information; Peer-to-peer lending||DOI:||10.1145/2492517.2492586||Language:||en||Status of Item:||Peer reviewed||Is part of:||Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining||Conference Details:||2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Ontario, Canada, 25-28 August 2013|
|Appears in Collections:||Insight Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.