SIAS-miner: mining subjectively interesting attributed subgraphs.

• Bendimerad, Anes ^[3] ; Mel, Ahmad ^[1] ; Lijffijt, Jefrey ^[1] ; Plantevit, Marc ^[2] ; Robardet, Céline ^[2] ; De Bie, Tijl ^[1]
  1. [1] Ghent University

     Ghent University

     Arrondissement Gent, Bélgica

     
  2. [2] University of Lyon System

     University of Lyon System

     Arrondissement de Lyon, Francia

     
  3. [3] INSA Lyon, CNRS, LIRIS UMR5205

  Mostrar afiliaciones +
• Localización: Data mining and knowledge discovery, ISSN 1384-5810, Vol. 34, Nº 2, 2020, pág. 355
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Data clustering, local pattern mining, and community detection in graphs are three mature areas of data mining and machine learning. In recent years, attributed subgraph mining has emerged as a new powerful data mining task in the intersection of these areas. Given a graph and a set of attributes for each vertex, attributed subgraph mining aims to find cohesive subgraphs for which (some of) the attribute values have exceptional values. The principled integration of graph and attribute data poses two challenges: (1) the definition of a pattern syntax (the abstract form of patterns) that is intuitive and lends itself to efficient search, and (2) the formalization of the interestingness of such patterns. We propose an integrated solution to both of these challenges. The proposed pattern syntax improves upon prior work in being both highly flexible and intuitive. Plus, we define an effective and principled algorithm to enumerate patterns of this syntax. The proposed approach for quantifying interestingness of these patterns is rooted in information theory, and is able to account for background knowledge on the data. While prior work quantified the interestingness for the cohesion of the subgraph and for the exceptionality of its attributes separately, then combining these in a parameterized trade-off, we instead handle this trade-off implicitly in a principled, parameter-free manner. Empirical results confirm we can efficiently find highly interesting subgraphs. [ABSTRACT FROM AUTHOR]