Subjective interestingness of subgraph patterns
DOI10.1007/S10994-015-5539-3zbMATH Open1392.68376OpenAlexW2229578389WikidataQ59474228 ScholiaQ59474228MaRDI QIDQ338641FDOQ338641
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
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)
Cites Work
- Title not available (Why is that?)
- Elements of Information Theory
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- An efficient algorithm for solving pseudo clique enumeration problem
- A graph‐theoretic generalization of the clique concept
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- Interesting pattern mining in multi-relational data
Cited In (9)
- 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
- 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)
