Node Re-Ordering as a Means of Anomaly Detection in Time-Evolving Graphs

Cite

Text

Rashidi et al. "Node Re-Ordering as a Means of Anomaly Detection in Time-Evolving Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2016. doi:10.1007/978-3-319-46227-1_11

Markdown

[Rashidi et al. "Node Re-Ordering as a Means of Anomaly Detection in Time-Evolving Graphs." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2016.](https://mlanthology.org/ecmlpkdd/2016/rashidi2016ecmlpkdd-node/) doi:10.1007/978-3-319-46227-1_11

BibTeX

@inproceedings{rashidi2016ecmlpkdd-node,
  title     = {{Node Re-Ordering as a Means of Anomaly Detection in Time-Evolving Graphs}},
  author    = {Rashidi, Lida and Kan, Andrey and Bailey, James and Chan, Jeffrey and Leckie, Christopher and Liu, Wei and Rajasegarar, Sutharshan and Ramamohanarao, Kotagiri},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  year      = {2016},
  pages     = {162-178},
  doi       = {10.1007/978-3-319-46227-1_11},
  url       = {https://mlanthology.org/ecmlpkdd/2016/rashidi2016ecmlpkdd-node/}
}