Filtering Methods for Subgraph Matching on Multiplex Networks

被引:0
|
作者
Moorman, Jacob D. [1 ]
Chen, Qinyi [1 ]
Tu, Thomas K. [1 ]
Boyd, Zachary M. [1 ,2 ]
Bertozzi, Andrea L. [1 ]
机构
[1] Univ Calif Los Angeles, Dept Math, Los Angeles, CA 90024 USA
[2] Univ N Carolina, Dept Math, Chapel Hill, NC USA
关键词
ALGORITHM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present filtering methods for finding all sub graphs of a large multiplex network that are isomorphic to a smaller template network. These methods are shown to be effective on a set of synthetic transaction networks from the DARPA Modeling Adversarial Activity (MAA) program. In some cases, filtering allows us to identify and enumerate all possible isomorphisms. We observe that in some of the MAA networks, the number of subgraphs isomorphic to the template is orders of magnitude larger than the size of the network.
引用
收藏
页码:3980 / 3985
页数:6
相关论文
共 50 条
  • [1] Filtering Strategies for Inexact Subgraph Matching on Noisy Multiplex Networks
    Kopylov, Alexei
    Xu, Jiejun
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 4906 - 4912
  • [2] Subgraph Matching on Multiplex Networks
    Moorman, Jacob D.
    Tu, Thomas K.
    Chen, Qinyi
    He, Xie
    Bertozzi, Andrea L.
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2021, 8 (02): : 1367 - 1384
  • [3] A Comparative Study of Subgraph Matching Isomorphic Methods in Social Networks
    Ma, Tinghuai
    Yu, Siyang
    Cao, Jie
    Tian, Yuan
    Al-Dhelaan, Abdullah
    Al-Rodhaan, Mznah
    IEEE ACCESS, 2018, 6 : 66621 - 66631
  • [4] Generalized Densest Subgraph in Multiplex Networks
    Behrouz, Ali
    Hashemi, Farnoosh
    COMPLEX NETWORKS & THEIR APPLICATIONS XII, VOL 3, COMPLEX NETWORKS 2023, 2024, 1143 : 49 - 61
  • [5] Noisy Subgraph Isomorphisms on Multiplex Networks
    Jin, Hui
    He, Xie
    Wang, Yanghui
    Li, Hao
    Bertozzi, Andrea L.
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 4899 - 4905
  • [6] MATCHED FILTERING FOR SUBGRAPH DETECTION IN DYNAMIC NETWORKS
    Miller, Benjamin A.
    Beard, Michelle S.
    Bliss, Nadya T.
    2011 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2011, : 509 - 512
  • [7] Probabilistic Subgraph Matching on Huge Social Networks
    Brocheler, Matthias
    Pugliese, Andrea
    Subrahmanian, V. S.
    2011 INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2011), 2011, : 271 - 278
  • [8] Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
    Shin, Wonseok
    Song, Siwoo
    Park, Kunsoo
    Han, Wook-Shin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (07): : 1697 - 1709
  • [9] SMAC: Subgraph Matching and Centrality in Huge Social Networks
    Park, Noseong
    Ovelgoenne, Michael
    Subrahmanian, V. S.
    2013 ASE/IEEE INTERNATIONAL CONFERENCE ON SOCIAL COMPUTING (SOCIALCOM), 2013, : 134 - 141
  • [10] Fault-tolerant Subgraph Matching on Aligned Networks
    Tu, Thomas
    Yang, Dominic
    2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2020, : 2569 - 2574