SIAS-miner: mining subjectively interesting attributed subgraphs
From MaRDI portal
Publication:2218410
DOI10.1007/s10618-019-00664-wzbMath1458.68157arXiv1905.03040OpenAlexW2991628432MaRDI QIDQ2218410
Jefrey Lijffijt, Céline Robardet, Marc Plantevit, Tijl De Bie, Ahmad Mel, Anes Bendimerad
Publication date: 15 January 2021
Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.03040
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
Enumeration of support-closed subsets in confluent systems ⋮ Online summarization of dynamic graphs using subjective interestingness for sequential data ⋮ Polynomial-delay enumeration algorithms in set systems ⋮ SIAS-miner
Cites Work
- Unnamed Item
- Unnamed Item
- Subjective interestingness of subgraph patterns
- Maximum entropy models and subjective interestingness: an application to tiles in binary databases
- Listing closed sets of strongly accessible set systems with applications to data mining
- Exceptional contextual subgraph mining
- A statistical significance testing approach to mining the most informative set of patterns
- Discrete Signal Processing on Graphs
- A Spectral Framework for Anomalous Subgraph Detection
- Detecting Localized Categorical Attributes on Graphs
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
This page was built for publication: SIAS-miner: mining subjectively interesting attributed subgraphs