Subjective interestingness of subgraph patterns
From MaRDI portal
Recommendations
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
- Mining explainable local and global subgraph patterns with surprising densities
- The minimum description length principle for pattern mining: a survey
- Constrained clustering: current and new trends
- Discovering subjectively interesting multigraph patterns
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- Concepts of neighbors and their application to instance-based learning on relational data
- Online summarization of dynamic graphs using subjective interestingness for sequential data
- SIAS-miner: mining subjectively interesting attributed subgraphs
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)