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 条
  • [31] Mining Frequent Patterns on Knowledge Graphs
    Mouatadid, Lalla
    WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2022, : 1647 - 1647
  • [32] Mining Frequent Patterns in Evolving Graphs
    Aslay, Cigdem
    Nasir, Muhammad Anis Uddin
    Morales, Gianmarco De Francisci
    Gionis, Aristides
    CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, : 923 - 932
  • [33] Efficiently mining rich subgraphs from vertex-attributed graphs
    Hakim, Riyad
    Salem, Saeed
    ACM-BCB 2020 - 11TH ACM CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2020,
  • [34] Granularity of Co-evolution Patterns in Dynamic Attributed Graphs
    Desmier, Elise
    Plantevit, Marc
    Robardet, Celine
    Boulicaut, Jean-Francois
    ADVANCES IN INTELLIGENT DATA ANALYSIS XIII, 2014, 8819 : 84 - 95
  • [35] MAGE: Matching Approximate Patterns in Richly-Attributed Graphs
    Pienta, Robert
    Tamersoy, Acar
    Tong, Hanghang
    Chau, Duen Horng
    2014 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2014, : 585 - 590
  • [36] A PCA approach for fast retrieval of structural patterns in attributed graphs
    Xu, L
    King, I
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2001, 31 (05): : 812 - 817
  • [37] Granularity of co-evolution patterns in dynamic attributed graphs
    Desmier, Elise
    Plantevit, Marc
    Robardet, Céline
    Boulicaut, Jean-François
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8819 : 84 - 95
  • [38] Peer recommendation by using pattern mining to generate candidate keywords in attributed graphs
    Raj, Shristi
    Sharma, Prashant
    Kumar, Chintoo
    Chowdary, C. Ravindranath
    SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2023, 48 (02):
  • [39] Peer recommendation by using pattern mining to generate candidate keywords in attributed graphs
    Shristi Raj
    Prashant Sharma
    Chintoo Kumar
    C Ravindranath Chowdary
    Sādhanā, 48
  • [40] CCSpan: Mining closed contiguous sequential patterns
    Zhang, Jingsong
    Wang, Yinglin
    Yang, Dingyu
    KNOWLEDGE-BASED SYSTEMS, 2015, 89 : 1 - 13