Online summarization of dynamic graphs using subjective interestingness for sequential data
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2086259 (Why is no real title available?)
- A graph‐theoretic generalization of the clique concept
- A review on algorithms for maximum clique problems
- A universal prior for integers and estimation by minimum description length
- Classifying molecular sequences using a linkage graph with their pairwise similarities
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- Graph Clustering and Minimum Cut Trees
- GraphScope
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- SIAS-miner: mining subjectively interesting attributed subgraphs
- Spectral partitioning with multiple eigenvectors
- Subjective interestingness of subgraph patterns
- Summarizing and understanding large graphs
This page was built for publication: Online summarization of dynamic graphs using subjective interestingness for sequential data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659275)