Mining exceptional closed patterns in attributed graphs

被引:12
|
作者
Bendimerad, Anes [1 ]
Plantevit, Marc [2 ]
Robardet, Celine [1 ]
机构
[1] Univ Lyon, CNRS, LIRIS UMR5205, INSA Lyon, F-69621 Lyon, France
[2] Univ Lyon 1, Univ Lyon, CNRS, LIRIS UMR5205, F-69622 Lyon, France
关键词
Exceptional subgraph mining; Pattern mining; Urban data analysis; SUBGROUP DISCOVERY; FREQUENT; SET;
D O I
10.1007/s10115-017-1109-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Geo-located social media provide a large amount of information describing urban areas based on user descriptions and comments. Such data make possible to identify meaningful city neighborhoods on the basis of the footprints left by a large and diverse population that uses this type of media. In this paper, we present some methods to exhibit the predominant activities and their associated urban areas to automatically describe a whole city. Based on a suitably attributed graph model, our approach identifies neighborhoods with homogeneous and exceptional characteristics. We introduce the novel problem of exceptional subgraph mining in attributed graphs and propose a complete algorithm that takes benefits from closure operators, new upper bounds and pruning properties. We also define an approach to sample the space of closed exceptional subgraphs within a given time budget. Experiments performed on ten real datasets are reported and demonstrated the relevancy of both approaches, and also showed their limits.
引用
收藏
页码:1 / 25
页数:25
相关论文
共 50 条
  • [21] Joint Weighted Nonnegative Matrix Factorization for Mining Attributed Graphs
    Huang, Zhichao
    Ye, Yunming
    Li, Xutao
    Liu, Feng
    Chen, Huajie
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2017, PT I, 2017, 10234 : 368 - 380
  • [22] Supporting the Discovery of Relevant Topological Patterns in Attributed Graphs
    Salotti, Julien
    Plantevit, Marc
    Robardet, Celine
    Boulicaut, Jean-Francois
    12TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING WORKSHOPS (ICDMW 2012), 2012, : 898 - 901
  • [23] GraphRPM: Risk Pattern Mining on Industrial Large Attributed Graphs
    Tian, Sheng
    Zeng, Xintan
    Hu, Yifei
    Wang, Baokun
    Liu, Yongchao
    Jin, Yue
    Meng, Changhua
    Hong, Chuntao
    Zhang, Tianyi
    Wang, Weiqiang
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES-APPLIED DATA SCIENCE TRACK, PT X, ECML PKDD 2024, 2024, 14950 : 133 - 149
  • [24] Mining high impact exceptional behavior patterns
    Cao, Longbing
    Zhao, Yanchang
    Figueiredo, Fernando
    Ou, Yuming
    Luo, Dan
    EMERGING TECHNOLOGIES IN KNOWLEDGE DISCOVERY AND DATA MINING, 2007, 4819 : 56 - +
  • [25] Mining closed relational graphs with connectivity constraints
    Yan, XF
    Zhou, XJ
    Han, JW
    ICDE 2005: 21ST INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2005, : 357 - 358
  • [26] MinerLSD: efficient mining of local patterns on attributed networks
    Atzmueller, Martin
    Soldano, Henry
    Santini, Guillaume
    Bouthinon, Dominique
    APPLIED NETWORK SCIENCE, 2019, 4 (01)
  • [27] MinerLSD: efficient mining of local patterns on attributed networks
    Martin Atzmueller
    Henry Soldano
    Guillaume Santini
    Dominique Bouthinon
    Applied Network Science, 4
  • [28] Fast mining of closed sequential patterns
    Department of Computer Science and Information Engineering, Tamkang University, 151 Ying-Chuan Road, Tamsui, Taipei, Taiwan
    WSEAS Trans. Comput., 2008, 3 (133-139):
  • [29] Mining patterns in graphs with multiple weights
    Giulia Preti
    Matteo Lissandrini
    Davide Mottin
    Yannis Velegrakis
    Distributed and Parallel Databases, 2021, 39 : 281 - 319
  • [30] Mining patterns in graphs with multiple weights
    Preti, Giulia
    Lissandrini, Matteo
    Mottin, Davide
    Velegrakis, Yannis
    DISTRIBUTED AND PARALLEL DATABASES, 2021, 39 (02) : 281 - 319