Mining explainable local and global subgraph patterns with surprising densities

DOI10.1007/S10618-020-00721-9zbMath1472.68133OpenAlexW3103825091WikidataQ102634894 ScholiaQ102634894MaRDI QIDQ2659281

Tijl De Bie, Bo Kang, Jefrey Lijffijt, Junning Deng

Publication date: 26 March 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-020-00721-9

zbMATH Keywords

community detectiongraph clusteringsubjective interestingnessgraph miningsubgroup discoverygraph summarization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Uses Software

• ArnetMiner

Cites Work

• Subjective interestingness of subgraph patterns
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• An Exponential Family of Probability Distributions for Directed Graphs
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Mining explainable local and global subgraph patterns with surprising densities