Efficiently summarizing attributed diffusion networks

DOI10.1007/S10618-018-0572-ZzbMath1409.68028OpenAlexW2803809130WikidataQ129815898 ScholiaQ129815898MaRDI QIDQ1741422

Sorour E. Amiri, Liangzhe Chen, B. Aditya Prakash

Publication date: 3 May 2019

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

Full work available at URL: https://doi.org/10.1007/s10618-018-0572-z

zbMATH Keywords

summarizationattributed graphtopic aware influence maximization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• SA-cluster

Cites Work

• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• The analysis of a simple k -means clustering algorithm

This page was built for publication: Efficiently summarizing attributed diffusion networks