Discovering subjectively interesting multigraph patterns

DOI10.1007/s10994-020-05873-9OpenAlexW3011850714MaRDI QIDQ2203340

Dhish Kumar Saxena, Matthijs van Leeuwen, Sarang Kapoor

Publication date: 6 October 2020

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-020-05873-9

zbMATH Keywords

multigraphmaximum entropy principlesubjective interestingnessexploratory data mining

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Subjective interestingness of subgraph patterns
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Combinatorial algorithms for the maximum \(k\)-plex problem
• An efficient algorithm for solving pseudo clique enumeration problem
• Fast algorithms for determining (generalized) core groups in social networks
• Emergence of Scaling in Random Networks
• Finding Dense Subgraphs with Size Bounds
• On Finding Dense Subgraphs
• Community structure in social and biological networks
• Clustering With Multi-Layer Graphs: A Spectral Perspective
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Networks

This page was built for publication: Discovering subjectively interesting multigraph patterns