Discovering subjectively interesting multigraph patterns
From MaRDI portal
Recommendations
- Subjective interestingness of subgraph patterns
- Subjectively interesting connecting trees and forests
- Mining explainable local and global subgraph patterns with surprising densities
- SIAS-miner: mining subjectively interesting attributed subgraphs
- Online summarization of dynamic graphs using subjective interestingness for sequential data
Cites work
- An efficient algorithm for solving pseudo clique enumeration problem
- Clustering With Multi-Layer Graphs: A Spectral Perspective
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Community structure in social and biological networks
- Computing Communities in Large Networks Using Random Walks
- Emergence of Scaling in Random Networks
- Fast algorithms for determining (generalized) core groups in social networks
- Fast unfolding of communities in large networks
- Finding Dense Subgraphs with Size Bounds
- scientific article; zbMATH DE number 1670532 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- Networks. An introduction.
- On Finding Dense Subgraphs
- Subjective interestingness of subgraph patterns
Cited in
(3)
This page was built for publication: Discovering subjectively interesting multigraph patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2203340)