Subjective interestingness of subgraph patterns

DOI10.1007/s10994-015-5539-3zbMath1392.68376OpenAlexW2229578389WikidataQ59474228 ScholiaQ59474228MaRDI QIDQ338641

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)

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

zbMATH Keywords

maximum entropycommunity detectiondense subgraph patternssubjective interestingness

Mathematics Subject Classification ID

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

Related Items

Online summarization of dynamic graphs using subjective interestingness for sequential data ⋮ Mining explainable local and global subgraph patterns with surprising densities ⋮ Discovering subjectively interesting multigraph patterns ⋮ Large-scale network motif analysis using compression ⋮ Subjectively interesting connecting trees and forests ⋮ SIAS-miner: mining subjectively interesting attributed subgraphs ⋮ The minimum description length principle for pattern mining: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Interesting pattern mining in multi-relational data
• An efficient algorithm for solving pseudo clique enumeration problem
• A graph‐theoretic generalization of the clique concept
• Probability Inequalities for Sums of Bounded Random Variables
• Elements of Information Theory
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations