Fetching the paper…
Reading the bibliography…
Recently, graph anomaly detection on attributed networks has attracted growing attention in data mining and machine learning communities.
B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell system technical journal , vol. 49, no. 2, pp. 291–307, 1970
1970
Earlier work this paper cites.
M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, “Lof: identifying density-based local outliers,” in Proceedings of the 2000 ACM SIGMOD international conference on Management of data , 2000, pp. 93–104
2000
Earlier work this paper cites.
V. Batagelj and M. Zaversnik, “An o (m) algorithm for cores decomposition of networks,” arXiv preprint cs/0310049 , 2003
2003
Earlier work this paper cites.
C. C. Noble and D. J. Cook, “Graph-based anomaly detection,” in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , 2003, pp. 631–636
2003
Earlier work this paper cites.
A. Clauset, M. E. Newman, and C. Moore, “Finding community structure in very large networks,” Physical review E , vol. 70, no. 6, p. 066111, 2004
2004
Earlier work this paper cites.
H. Tong, C. Faloutsos, and J.-Y. Pan, “Fast random walk with restart and its applications,” in Sixth international conference on data mining (ICDM’06) . IEEE, 2006, pp. 613–622
2006
Earlier work this paper cites.
D. B. Skillicorn, “Detecting anomalies in graphs,” in 2007 IEEE Intelligence and Security Informatics . IEEE, 2007, pp. 209–216
2007
Earlier work this paper cites.
X. Song, M. Wu, C. Jermaine, and S. Ranka, “Conditional anomaly detection,” IEEE Transactions on knowledge and Data Engineering , vol. 19, no. 5, pp. 631–645, 2007
2007
Earlier work this paper cites.
X. Xu, N. Yuruk, Z. Feng, and T. A. Schweiger, “Scan: a structural clustering algorithm for networks,” in Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , 2007, pp. 824–833
2007
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
H. Schütze, C. D. Manning, and P. Raghavan, Introduction to information retrieval . Cambridge University Press Cambridge, 2008, vol. 39
2008
Earlier work this paper cites.
G. Cordasco and L. Gargano, “Community detection via semi-synchronous label propagation algorithms,” in 2010 IEEE international workshop on: business applications of social network analysis (BASNA) . IEEE, 2010, pp. 1–8
2010
Earlier work this paper cites.
W. He, G. Hu, and Y. Zhou, “Large-scale ip network behavior anomaly detection and identification using substructure-based approach and multivariate time series mining,” Telecommunication Systems , vol. 50, pp. 1–13, 2012
2012
Earlier work this paper cites.
M. Mongiovi, P. Bogdanov, R. Ranca, E. E. Papalexakis, C. Faloutsos, and A. K. Singh, “Netspot: Spotting significant anomalous regions on dynamic networks,” in Proceedings of the 2013 Siam international conference on data mining . SIAM, 2013, pp. 28–36
2013
Earlier work this paper cites.
Y. Boshmaf, K. Beznosov, and M. Ripeanu, “Graph-based sybil detection in social and information systems,” in 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013) . IEEE, 2013, pp. 466–473
2013
Earlier work this paper cites.
Y. Wang, X. Lin, and Q. Zhang, “Towards metric fusion on multi-view data: a cross-view based graph random walk approach,” in Proceedings of the 22nd ACM international conference on Information & Knowledge Management , 2013, pp. 805–810
2013
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
Y. Wang, W. Zhang, L. Wu, X. Lin, and X. Zhao, “Unsupervised metric fusion over multiview data by graph random walk-based cross-view diffusion,” IEEE transactions on neural networks and learning systems , vol. 28, no. 1, pp. 57–70, 2015
2015
Earlier work this paper cites.
B. Perozzi and L. Akoglu, “Scalable anomaly ranking of attributed neighborhoods,” in Proceedings of the 2016 SIAM International Conference on Data Mining . SIAM, 2016, pp. 207–215
2016
Earlier work this paper cites.
R. Yu, H. Qiu, Z. Wen, C. Lin, and Y. Liu, “A survey on social media anomaly detection,” ACM SIGKDD Explorations Newsletter , vol. 18, no. 1, pp. 1–14, 2016
2016
Earlier work this paper cites.
J. Li, H. Dani, X. Hu, and H. Liu, “Radar: Residual analysis for anomaly detection in attributed networks.” in IJCAI , 2017, pp. 2152–2158
2017
Earlier work this paper cites.
D. Marcheggiani and I. Titov, “Encoding sentences with graph convolutional networks for semantic role labeling,” in EMNLP 2017-Conference on Empirical Methods in Natural Language Processing, Proceedings , 2017, pp. 1506–1515
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in International conference on machine learning . PMLR, 2017, pp. 1263–1272
2017
Cited alongside, same era.
Z. Peng, M. Luo, J. Li, H. Liu, and Q. Zheng, “Anomalous: A joint modeling approach for anomaly detection on attributed networks.” in IJCAI , 2018, pp. 3513–3519
2018
Cited alongside, same era.
J. Zhang, X. Shi, J. Xie, H. Ma, I. King, and D. Y. Yeung, “Gaan: Gated attention networks for learning on large and spatiotemporal graphs,” in 34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018 , 2018
2018
Cited alongside, same era.
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , 2018, pp. 974–983
2018
Cited alongside, same era.
Z. Cheng, E. Zhu, S. Wang, P. Zhang, and W. Li, “Unsupervised outlier detection via transformation invariant autoencoder,” IEEE Access , 2021
2021
Later among the works it cites.
Y. Liu, Z. Li, S. Pan, C. Gong, C. Zhou, and G. Karypis, “Anomaly detection on attributed networks via contrastive self-supervised learning,” IEEE transactions on neural networks and learning systems , 2021
2021
Later among the works it cites.
Y. Pei, T. Huang, W. van Ipenburg, and M. Pechenizkiy, “Resgcn: attention-based deep residual modeling for anomaly detection on attributed networks,” in 2021 IEEE 8th International Conference on Data Science and Advanced Analytics (DSAA) . IEEE, 2021, pp. 1–2
2021
Later among the works it cites.
M. Jin, Y. Liu, Y. Zheng, L. Chi, Y.-F. Li, and S. Pan, “Anemone: Graph anomaly detection with multi-scale contrastive learning,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management , 2021, pp. 3122–3126
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
F. Ye, C. Chen, and Z. Zheng, “Deep autoencoder-like nonnegative matrix factorization for community detection,” in Proceedings of the 27th ACM international conference on information and knowledge management , 2018, pp. 1393–1402
2018
Cited alongside, same era.
K. Ding, J. Li, and H. Liu, “Interactive anomaly detection on attributed networks,” in Proceedings of the twelfth ACM international conference on web search and data mining , 2019, pp. 357–365
2019
Cited alongside, same era.
K. Ding, J. Li, R. Bhanushali, and H. Liu, “Deep anomaly detection on attributed networks,” in Proceedings of the 2019 SIAM International Conference on Data Mining . SIAM, 2019, pp. 594–602
2019
Cited alongside, same era.
J. Liu, Z.-J. Zha, R. Hong, M. Wang, and Y. Zhang, “Deep adversarial graph attention convolution network for text-based person search,” in Proceedings of the 27th ACM International Conference on Multimedia , 2019, pp. 665–673
2019
Cited alongside, same era.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax.” ICLR (Poster) , vol. 2, no. 3, p. 4, 2019
2019
Cited alongside, same era.
N. Kasoro, S. Kasereka, E. Mayogha, H. T. Vinh, and J. Kinganga, “Percomcv: A hybrid approach of community detection in social networks,” Procedia Computer Science , vol. 151, pp. 45–52, 2019
2019
Cited alongside, same era.
P.-Z. Li, L. Huang, C.-D. Wang, and J.-H. Lai, “Edmot: An edge enhancement approach for motif-aware community detection,” in Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining , 2019, pp. 479–487
2019
Cited alongside, same era.
Y. Zheng, M. Jin, Y. Liu, L. Chi, K. T. Phan, and Y.-P. P. Chen, “Generative and contrastive self-supervised learning for graph anomaly detection,” IEEE Transactions on Knowledge and Data Engineering , 2021
2021
Later among the works it cites.
S. Zhou, Q. Tan, Z. Xu, X. Huang, and F.-l. Chung, “Subtractive aggregation for attributed network anomaly detection,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management , 2021, pp. 3672–3676
2021
Later among the works it cites.
K. Ding, K. Shu, X. Shan, J. Li, and H. Liu, “Cross-domain graph anomaly detection,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 6, pp. 2406–2415, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
T. Zhao, T. Jiang, N. Shah, and M. Jiang, “A synergistic approach for graph anomaly detection with pattern mining and feature learning,” IEEE Transactions on Neural Networks and Learning Systems , vol. 33, no. 6, pp. 2393–2405, 2021
2021
Later among the works it cites.
X. Wang, N. Liu, H. Han, and C. Shi, “Self-supervised heterogeneous graph neural network with co-contrastive learning,” in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining , 2021, pp. 1726–1736
2021
Later among the works it cites.
S. Thakoor, C. Tallec, M. G. Azar, R. Munos, P. Veličković, and M. Valko, “Bootstrapped representation learning on graphs,” in ICLR 2021 Workshop on Geometrical and Topological Representation Learning , 2021
2021
Later among the works it cites.
X. Yuan, N. Zhou, S. Yu, H. Huang, Z. Chen, and F. Xia, “Higher-order structure based anomaly detection on attributed networks,” in 2021 IEEE International Conference on Big Data (Big Data) . IEEE, 2021, pp. 2691–2700
2021
Later among the works it cites.
R. Jaiswal and S. Ramanna, “Detecting overlapping communities using ensemble-based distributed neighbourhood threshold method in social networks,” Intelligent Decision Technologies , vol. 15, no. 2, pp. 251–267, 2021
2021
Later among the works it cites.
G. Zhang, Z. Li, J. Huang, J. Wu, C. Zhou, J. Yang, and J. Gao, “efraudcom: An e-commerce fraud detection system via competitive graph neural networks,” ACM Transactions on Information Systems (TOIS) , vol. 40, no. 3, pp. 1–29, 2022
2022
Closest in time.
J. Hu, G. Yu, S. Wang, E. Zhu, Z. Cai, and X. Zhu, “Detecting anomalous events from unlabeled videos via temporal masked auto-encoding,” in 2022 IEEE International Conference on Multimedia and Expo (ICME) . IEEE, 2022, pp. 1–6
2022
Closest in time.
K. Liu, Y. Dou, Y. Zhao, X. Ding, X. Hu, R. Zhang, K. Ding, C. Chen, H. Peng, K. Shu et al. , “Bond: Benchmarking unsupervised outlier node detection on static attributed graphs,” in Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track , 2022
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
Y. Wang, J. Peng, H. Wang, and M. Wang, “Progressive learning with multi-scale attention network for cross-domain vehicle re-identification,” Science China Information Sciences , vol. 65, no. 6, pp. 1–15, 2022
2022
Closest in time.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and P. Yu, “Graph self-supervised learning: A survey,” IEEE Transactions on Knowledge and Data Engineering , 2022
2022
Closest in time.