Subjective interestingness of subgraph patterns

DOI10.1007/S10994-015-5539-3MaRDI QIDQ338641zbMATH OpenOpenAlexWikidataFDO

Authors Matthijs van Leeuwen, Tijl De Bie, Eirini Spyropoulou, Cédric Mesnage

Publication date 7 November 2016

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-015-5539-3

zbMATH Keywords

community detectionmaximum entropydense subgraph patternssubjective interestingness

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Statistical aspects of information-theoretic topics (62B10) Learning and adaptive systems in artificial intelligence (68T05) Structural characterization of families of graphs (05C75)

Recommendations

• Mining explainable local and global subgraph patterns with surprising densities
• Subjectively interesting connecting trees and forests
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Discovering subjectively interesting multigraph patterns
• Top-\(k\) overlapping densest subgraphs

Cites work

• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A graph‐theoretic generalization of the clique concept
• An efficient algorithm for solving pseudo clique enumeration problem
• Elements of Information Theory
• Interesting pattern mining in multi-relational data
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Probability Inequalities for Sums of Bounded Random Variables

Cited in

(10)

• Large-scale network motif analysis using compression
• Subjectively interesting connecting trees and forests
• The minimum description length principle for pattern mining: a survey
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Concepts of neighbors and their application to instance-based learning on relational data
• Mining explainable local and global subgraph patterns with surprising densities
• Constrained clustering: current and new trends
• Online summarization of dynamic graphs using subjective interestingness for sequential data
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Discovering subjectively interesting multigraph patterns

This page was built for publication: Subjective interestingness of subgraph patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338641)