Cadena, Jose, Chen, Feng, and Vullikanti, Anil. Graph Anomaly Detection Based on Steiner Connectivity and Density. Retrieved from https://par.nsf.gov/biblio/10067737. Proceedings of the IEEE 106.5 Web. doi:10.1109/JPROC.2018.2813311.
Cadena, Jose, Chen, Feng, & Vullikanti, Anil. Graph Anomaly Detection Based on Steiner Connectivity and Density. Proceedings of the IEEE, 106 (5). Retrieved from https://par.nsf.gov/biblio/10067737. https://doi.org/10.1109/JPROC.2018.2813311
@article{osti_10067737,
place = {Country unknown/Code not available},
title = {Graph Anomaly Detection Based on Steiner Connectivity and Density},
url = {https://par.nsf.gov/biblio/10067737},
DOI = {10.1109/JPROC.2018.2813311},
abstractNote = {},
journal = {Proceedings of the IEEE},
volume = {106},
number = {5},
author = {Cadena, Jose and Chen, Feng and Vullikanti, Anil},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.