NetGist: Learning to Generate Task-Based Network Summaries

作者: Sorour E. Amiri , Bijaya Adhikari , Aditya Bharadwaj , B. Aditya Prakash

DOI: 10.1109/ICDM.2018.00101

关键词:

摘要: Given a network, can we visualize it for any given task, highlighting the important characteristics? Networks are widespread, and hence summarizing visualizing them is of primary interest many applications such as viral marketing, extracting communities immunization. Summaries help in solving new problems visualization, sense-making, other goals. However, most prior work focuses on generic structural summarization techniques or developing specific algorithms tasks. This both tedious challenging. As result, several popular tasks, there do not exist readymade methods. In this paper, explore promising alternative approach instead. We propose NetGist, framework which automatically learns how to generate summary task network. addition generating required summary, also allows us reuse learned process similar networks. formulate novel task-based graph problem leverage reinforcement learning design flexible our solution. Via extensive experiments, show that NetGist robustly effectively meaningful summaries, helps solve challenging problems, aids complex sense-making

参考文章(24)
Damien Ernst, Arthur Louette, Introduction to Reinforcement Learning MIT Press. ,(1998)
J. G. Carbonell, T. M. Mitchell, R. S. Michalski, Machine Learning: An Artificial Intelligence Approach Springer Publishing Company, Incorporated. ,(2013)
Lei Shi, Hanghang Tong, Jie Tang, Chuang Lin, None, VEGAS: Visual influEnce GrAph Summarization on Citation Networks IEEE Transactions on Knowledge and Data Engineering. ,vol. 27, pp. 3417- 3431 ,(2015) , 10.1109/TKDE.2015.2453957
Michael Mathioudakis, Francesco Bonchi, Carlos Castillo, Aristides Gionis, Antti Ukkonen, Sparsification of influence networks Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '11. pp. 529- 537 ,(2011) , 10.1145/2020408.2020492
Pinar Yanardag, S.V.N. Vishwanathan, Deep Graph Kernels knowledge discovery and data mining. pp. 1365- 1374 ,(2015) , 10.1145/2783258.2783417
David S. Johnson, Approximation algorithms for combinatorial problems Journal of Computer and System Sciences. ,vol. 9, pp. 256- 278 ,(1974) , 10.1016/S0022-0000(74)80044-9
Thayne Coffman, Seth Greenblatt, Sherry Marcus, Graph-based technologies for intelligence analysis Communications of The ACM. ,vol. 47, pp. 45- 47 ,(2004) , 10.1145/971617.971643
Gil Amitai, Arye Shemesh, Einat Sitbon, Maxim Shklar, Dvir Netanely, Ilya Venger, Shmuel Pietrokovski, Network analysis of protein structures identifies functional residues. Journal of Molecular Biology. ,vol. 344, pp. 1135- 1146 ,(2004) , 10.1016/J.JMB.2004.10.055
George Karypis, Vipin Kumar, Multilevel Algorithms for Multi-Constraint Graph Partitioning conference on high performance computing (supercomputing). pp. 1- 13 ,(1998) , 10.5555/509058.509086
Ulrike von Luxburg, A tutorial on spectral clustering Statistics and Computing. ,vol. 17, pp. 395- 416 ,(2007) , 10.1007/S11222-007-9033-Z