Fetching the paper…
Reading the bibliography…
A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs.
R. C. Bolles and M. A. Fischler, “A ransac-based approach to model fitting and its application to finding cylinders in range data.” in
1981
Earlier work this paper cites.
M. Charikar, “Greedy approximation algorithms for finding dense components in a graph,” in
2000
Earlier work this paper cites.
G. W. Flake, S. Lawrence, C. L. Giles
2000
Earlier work this paper cites.
M. McPherson, L. Smith-Lovin, and J. M. Cook, “Birds of a feather: Homophily in social networks,”
2001
Earlier work this paper cites.
A. J. Smola and R. I. Kondor, “Kernels and regularization on graphs,” in
2003
Earlier work this paper cites.
X. Zhu, Z. Ghahramani, and J. D. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in
2003
Earlier work this paper cites.
O. Chapelle, B. Schölkopf, and A. Zien,
2006
Earlier work this paper cites.
R. Andersen, F. Chung, and K. Lang, “Local graph partitioning using pagerank vectors,” in
2006
Earlier work this paper cites.
W. Eberle and L. Holder, “Discovering structural anomalies in graph-based data,” in
2007
Earlier work this paper cites.
J. Gao, F. Liang, W. Fan, C. Wang, Y. Sun, and J. Han, “On community outliers and their efficient detection in information networks,” in
2010
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,”
2010
Earlier work this paper cites.
B. Bahmani, A. Chowdhury, and A. Goel, “Fast incremental and personalized pagerank,”
2010
Cited alongside, same era.
G. Cordasco and L. Gargano, “Community detection via semi-synchronous label propagation algorithms,” in
2010
Cited alongside, same era.
A. Zimek, E. Schubert, and H.-P. Kriegel, “A survey on unsupervised outlier detection in high-dimensional numerical data,”
2012
Cited alongside, same era.
P. I. Sánchez, E. Müller, F. Laforet, F. Keller, and K. Böhm, “Statistical selection of congruent subspaces for mining attributed graphs,” in
2013
Cited alongside, same era.
I. J. Goodfellow, J. Shlens, and C. Szegedy, “Explaining and harnessing adversarial examples,” in
2014
Cited alongside, same era.
B. Perozzi and L. Akoglu, “Scalable anomaly ranking of attributed neighborhoods,” in
2016
Later among the works it cites.
T. Iwata and M. Yamada, “Multi-view anomaly detection via robust probabilistic latent variable models,” in
2016
Later among the works it cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in
2017
Later among the works it cites.
J. Li, H. Dani, X. Hu, and H. Liu, “Radar: Residual analysis for anomaly detection in attributed networks.” in
2017
Later among the works it cites.
Z. Yan, Y. Guo, and C. Zhang, “Deep defense: Training dnns with improved adversarial robustness,” in
2018
Later among the works it cites.
T. Pang, C. Du, Y. Dong, and J. Zhu, “Towards robust detection of adversarial examples,” in
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
C. C. Aggarwal, “Outlier analysis,” in
2015
Cited alongside, same era.
L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: a survey,”
2015
Cited alongside, same era.
D. F. Gleich, “Pagerank beyond the web,”
2015
Cited alongside, same era.
J. A. Tropp
2015
Cited alongside, same era.
Y. Yan, Z. Xu, I. W. Tsang, G. Long, and Y. Yang, “Robust semi-supervised learning through label aggregation,” in
2016
Cited alongside, same era.
2018
Later among the works it cites.
C. Donnat, M. Zitnik, D. Hallac, and J. Leskovec, “Learning structural node embeddings via diffusion wavelets,” in
2018
Later among the works it cites.
D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial attacks on neural networks for graph data,” in
2018
Later among the works it cites.
K. Ding, J. Li, R. Bhanushali, and H. Liu, “Deep anomaly detection on attributed networks,” in
2019
Closest in time.
K. Xu, H. Chen, S. Liu, P.-Y. Chen, T.-W. Weng, M. Hong, and X. Lin, “Topology attack and defense for graph neural networks: An optimization perspective,” in
2019
Closest in time.