Phil Tee, George Parisis, Ian Wakeman. Towards an approximate graph entropy measure for identifying incidents in network event data. In Sema Oktug, Mehmet Ulema, Cicek Cavdar, Lisandro Zambenedetti Granville, Carlos Raniery Paula dos Santos, editors, 2016 IEEE/IFIP Network Operations and Management Symposium, NOMS 2016, Istanbul, Turkey, April 25-29, 2016. pages 1049-1054, IEEE, 2016. [doi]
@inproceedings{TeePW16,
title = {Towards an approximate graph entropy measure for identifying incidents in network event data},
author = {Phil Tee and George Parisis and Ian Wakeman},
year = {2016},
doi = {10.1109/NOMS.2016.7502959},
url = {http://dx.doi.org/10.1109/NOMS.2016.7502959},
researchr = {https://researchr.org/publication/TeePW16},
cites = {0},
citedby = {0},
pages = {1049-1054},
booktitle = {2016 IEEE/IFIP Network Operations and Management Symposium, NOMS 2016, Istanbul, Turkey, April 25-29, 2016},
editor = {Sema Oktug and Mehmet Ulema and Cicek Cavdar and Lisandro Zambenedetti Granville and Carlos Raniery Paula dos Santos},
publisher = {IEEE},
isbn = {978-1-5090-0223-8},
}