Fetching the paper…
Reading the bibliography…
Anomalies represent rare observations (e.g., data records or events) that deviate significantly from others.
J. L. Sharpnack, A. Krishnamurthy, and A. Singh, “Near-optimal anomaly detection in graphs using lovasz extended scan statistic,” in Proc. 26th Int. Conf. Neural Inf. Process. Syst. , 2013, pp. 1959–1967
1967
Earlier work this paper cites.
F. E. Grubbs, “Procedures for detecting outlying observations in samples,” Technometrics , vol. 11, no. 1, pp. 1–21, 1969
1969
Earlier work this paper cites.
R. H. Berk and D. H. Jones, “Goodness-of-fit test statistics that dominate the kolmogorov statistics,” Wahrsch. Verw. Gebiete. , vol. 47, no. 1, pp. 47–59, 1979
1979
Earlier work this paper cites.
B. Iglewicz and D. C. Hoaglin, How to detect and handle outliers . Asq Press, 1993, vol. 16
1993
Earlier work this paper cites.
M. Ester, H. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in Proc. ACM Int. Conf. Knowl. Discov. Data Mining , 1996, pp. 226–231
1996
Earlier work this paper cites.
M. Kulldorff, “A spatial scan statistic,” Commun. Stat.- Theory Methods , vol. 26, no. 6, pp. 1481–1496, 1997
1997
Earlier work this paper cites.
G. Karypis and V. Kumar, “A fast and high quality multilevel scheme for partitioning irregular graphs,” J. Sci. Comput. , vol. 20, no. 1, pp. 359–392, 1998
1998
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’networks,” nature , vol. 393, no. 6684, pp. 440–442, 1998
1998
Earlier work this paper cites.
M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander, “Lof: identifying density-based local outliers,” in Proc. ACM SIGMOD Int. Conf. Manage. Data , 2000, pp. 93–104
2000
Earlier work this paper cites.
C. C. Aggarwal and P. S. Yu, “Outlier detection for high dimensional data,” in Proc. ACM SIGMOD Int. Conf. Manage. Data , 2001, pp. 37–46
2001
Earlier work this paper cites.
C. C. Noble and D. J. Cook, “Graph-based anomaly detection,” in Proc. ACM SIGKDD 9th Int. Conf. Knowl. Discov. Data Mining , 2003, pp. 631–636
2003
Earlier work this paper cites.
D. B. Neill, A. W. Moore, M. Sabhnani, and K. Daniel, “Detection of emerging space-time clusters,” in Proc. ACM SIGKDD 11th Int. Conf. Knowl. Discov. Data Mining , 2005, pp. 218–227
2005
Earlier work this paper cites.
S. Pandit, D. H. Chau, S. Wang, and C. Faloutsos, “Netprobe: fast and scalable system for fraud detection in online auction networks,” in Proc. 16th Int. Conf. World Wide Web , 2007, pp. 201–210
2007
Earlier work this paper cites.
Z. Liu, J. X. Yu, Y. Ke, X. Lin, and L. Chen, “Spotting significant changing subgraphs in evolving graphs,” in Proc. IEEE 8th Int. Conf. Data Mining , 2008, pp. 917–922
2008
Earlier work this paper cites.
J. Langford and T. Zhang, “The epoch-greedy algorithm for multi-armed bandits with side information,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2008, pp. 817–824
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad, “Collective classification in network data,” AI Mag. , vol. 29, no. 3, pp. 93–106, 2008
2008
Earlier work this paper cites.
J. Silva and R. Willett, “Hypergraph-based anomaly detection of high-dimensional co-occurrences,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 31, no. 3, pp. 563–569, 2008
2008
Earlier work this paper cites.
V. Chandola, A. Banerjee, and V. Kumar, “Anomaly detection: A survey,” ACM Comput. Surv. , vol. 41, no. 3, pp. 15:1–15:58, 2009
2009
Earlier work this paper cites.
M. W. Mahoney and P. Drineas, “CUR matrix decompositions for improved data analysis,” Proc. Natl. Acad. Sci. USA , vol. 106, no. 3, pp. 697–702, 2009
2009
Earlier work this paper cites.
N. Ailon, R. Jaiswal, and C. Monteleoni, “Streaming k-means approximation,” in Proc. Int. Conf. Neural Inf. Process. Syst. , vol. 4, 2009, p. 2
2009
Earlier work this paper cites.
A. Lancichinetti and S. Fortunato, “Community detection algorithms: a comparative analysis,” Physical review E , vol. 80, no. 5, p. 056117, 2009
2009
Earlier work this paper cites.
L. Akoglu and C. Faloutsos, “Rtg: A recursive realistic graph generator using random typing,” in European Conf. Mach. Learn. Knowl. Discov. Databases . Springer, 2009, pp. 13–28
2009
Earlier work this paper cites.
L. Akoglu, M. McGlohon, and C. Faloutsos, “Oddball: Spotting anomalies in weighted graphs,” in Pacific-Asia Conf. Knowl. Discov. Data Mining . Springer, 2010, pp. 410–421
2010
Earlier work this paper cites.
C. C. Aggarwal, Y. Zhao, and S. Y. Philip, “Outlier detection in graph streams,” in Proc. IEEE 27th Int. Conf. Data Eng. , 2011, pp. 399–409
2011
Earlier work this paper cites.
P. Gogoi, D. K. Bhattacharyya, B. Borah, and J. K. Kalita, “A survey of outlier detection methods in network anomaly identification,” Comput. J. , vol. 54, no. 4, pp. 570–588, 2011
2011
Earlier work this paper cites.
S. Gao, L. Denoyer, and P. Gallinari, “Temporal link prediction by integrating content and structure information,” in Proc. ACM 20th Int. Conf. Inf. Knowl. Manage. , 2011, pp. 1169–1174
2011
Earlier work this paper cites.
Z. Chen, W. Hendrix, and N. F. Samatova, “Community-based anomaly detection in evolutionary networks,” J. Intell. Inf. Syst. , vol. 39, no. 1, pp. 59–85, 2012
2012
Earlier work this paper cites.
Q. Ding, N. Katenka, P. Barford, E. D. Kolaczyk, and M. Crovella, “Intrusion as (anti)social communication: characterization and detection,” in Proc. ACM SIGKDD 18th Int. Conf. Knowl. Discov. Data Mining , 2012, pp. 886–894
2012
Earlier work this paper cites.
P. Bogdanov, C. Faloutsos, M. Mongiovì, E. E. Papalexakis, R. Ranca, and A. K. Singh, “Netspot: Spotting significant anomalous regions on dynamic networks,” in Proc. SIAM Int. Conf. Data Mining , 2013, pp. 28–36
2013
Earlier work this paper cites.
B. A. Miller, N. Arcolano, and N. T. Bliss, “Efficient anomaly detection in dynamic, attributed graphs: Emerging phenomena and big data,” in Proc. IEEE Int. Conf. Intell. Secur. Inf. , 2013, pp. 179–184
2013
Earlier work this paper cites.
J. Wu, X. Zhu, C. Zhang, and Z. Cai, “Multi-instance multi-graph dual embedding learning,” in Proc. IEEE 13th Int. Conf. Data Mining , 2013, pp. 827–836
2013
Earlier work this paper cites.
R. A. Rossi, B. Gallagher, J. Neville, and K. Henderson, “Modeling dynamic behavior in large evolving graphs,” in Proc. ACM 6th Int. Conf. Web Search Data Mining , 2013, pp. 667–676
2013
Earlier work this paper cites.
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 Proc. IEEE 13th Int. Conf. Data Mining , 2013, pp. 647–656
2013
Earlier work this paper cites.
J. Wu, Z. Hong, S. Pan, X. Zhu, Z. Cai, and C. Zhang, “Multi-graph-view learning for graph classification,” in Proc. IEEE Int. Conf. Data Mining , 2014, pp. 590–599
2014
Earlier work this paper cites.
J. Wu, Z. Hong, S. Pan, X. Zhu, C. Zhang, and Z. Cai, “Multi-graph learning with positive and unlabeled bags,” in Proc. SIAM Int. Conf. Data Mining , 2014, pp. 217–225
2014
Earlier work this paper cites.
N. Li, H. Sun, K. C. Chipman, J. George, and X. Yan, “A probabilistic approach to uncovering attributed graph anomalies,” in Proc. SIAM Int. Conf. Data Mining , 2014, pp. 82–90
2014
Earlier work this paper cites.
D. Savage, X. Zhang, X. Yu, P. Chou, and Q. Wang, “Anomaly detection in online social networks,” Soc. Networks , vol. 39, pp. 62–70, 2014
2014
Earlier work this paper cites.
B. Perozzi, L. Akoglu, P. I. Sánchez, and E. Müller, “Focused clustering and outlier detection in large attributed graphs,” in Proc. ACM SIGKDD 20th Int. Conf. Knowl. Discov. Data Mining , 2014, pp. 1346–1355
2014
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proc. ACM SIGKDD 20th Int. Conf. Knowl. Discov. Data Mining , 2014, pp. 701–710
2014
Earlier work this paper cites.
I. J. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. C. Courville, and Y. Bengio, “Generative adversarial nets,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2014
2014
Earlier work this paper cites.
J. Wu, X. Zhu, C. Zhang, and P. S. Yu, “Bag constrained structure pattern mining for multi-graph classification,” IEEE Trans. Knowl. Data Eng. , vol. 26, no. 10, pp. 2382–2396, 2014
2014
Earlier work this paper cites.
N. Shah, A. Beutel, B. Gallagher, and C. Faloutsos, “Spotting suspicious link behavior with fbox: An adversarial perspective,” in Proc. IEEE Int. Conf. Data Mining , 2014, pp. 959–964
2014
Earlier work this paper cites.
T. Babaie, S. Chawla, S. Ardon, and Y. Yu, “A unified approach to network anomaly detection,” in BigData , 2014, pp. 650–655
2014
Earlier work this paper cites.
L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: A survey,” Data Min. Knowl. Discovery , vol. 29, no. 3, pp. 626–688, 2015
2015
Earlier work this paper cites.
S. Ranshous, S. Shen, D. Koutra, S. Harenberg, C. Faloutsos, and N. F. Samatova, “Anomaly detection in dynamic networks: A survey,” Wiley Interdiscip. Rev. Comput. Stat. , vol. 7, no. 3, pp. 223–247, 2015
2015
Earlier work this paper cites.
J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, and Q. Mei, “Line: Large-scale information network embedding,” in Proc. 24th Int. Conf. World Wide Web , 2015, pp. 1067–1077
2015
Earlier work this paper cites.
J. Wu, S. Pan, X. Zhu, and Z. Cai, “Boosting for multi-graph classification,” IEEE Trans. Cybern. , vol. 45, no. 3, pp. 416–429, 2015
2015
Earlier work this paper cites.
N. Srivastava, E. Mansimov, and R. Salakhutdinov, “Unsupervised learning of video representations using lstms,” in Int. Conf. Mach. Learn. , vol. 37, 2015, pp. 843–852
2015
Earlier work this paper cites.
H. Xiao, J. Gao, D. S. Turaga, L. H. Vu, and A. Biem, “Temporal multi-view inconsistency detection for network traffic analysis,” in Proc. 24th Int. Conf. World Wide Web , 2015, pp. 455–465
2015
Earlier work this paper cites.
B. Hooi, N. Shah, A. Beutel, S. Günnemann, L. Akoglu, M. Kumar, D. Makhija, and C. Faloutsos, “Birdnest: Bayesian inference for ratings-fraud detection,” in Proc. SIAM Int. Conf. Data Mining , 2016, pp. 495–503
2016
Earlier work this paper cites.
R. Yu, H. Qiu, Z. Wen, C. Lin, and Y. Liu, “A survey on social media anomaly detection,” SIGKDD Explor. , vol. 18, no. 1, pp. 1–14, 2016
2016
Earlier work this paper cites.
B. Perozzi and L. Akoglu, “Scalable anomaly ranking of attributed neighborhoods,” in Proc. SIAM Int. Conf. Data Mining , 2016, pp. 207–215
2016
Earlier work this paper cites.
S. M. Erfani, S. Rajasegarar, S. Karunasekera, and C. Leckie, “High-dimensional and large-scale anomaly detection using a linear one-class SVM with deep learning,” Pattern Recognit. , vol. 58, pp. 121–134, 2016
2016
Earlier work this paper cites.
N. Shah, A. Beutel, B. Hooi, L. Akoglu, S. Günnemann, D. Makhija, M. Kumar, and C. Faloutsos, “Edgecentric: Anomaly detection in edge-attributed networks,” in Proc. IEEE 16th Int. Conf. Data Mining , 2016, pp. 327–334
2016
Earlier work this paper cites.
B. Hooi, H. A. Song, A. Beutel, N. Shah, K. Shin, and C. Faloutsos, “Fraudar: Bounding graph fraud in the face of camouflage,” in Proc. ACM SIGKDD 22nd Int. Conf. Knowl. Discov. Data Mining , 2016, pp. 895–904
2016
Earlier work this paper cites.
R. Hu, C. C. Aggarwal, S. Ma, and J. Huai, “An embedding approach to anomaly detection,” in Proc. IEEE 32nd Int. Conf. Data Eng. , 2016, pp. 385–396
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “Node2vec: Scalable feature learning for metworks,” in Proc. ACM SIGKDD 22nd Int. Conf. Knowl. Discov. Data Mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
S. Ranshous, S. Harenberg, K. Sharma, and N. F. Samatova, “A scalable approach for outlier detection in edge streams using sketch-based approximations,” in Proc. SIAM Int. Conf. Data Mining , 2016, pp. 189–197
2016
Earlier work this paper cites.
E. A. Manzoor, S. M. Milajerdi, and L. Akoglu, “Fast memory-efficient anomaly detection in streaming heterogeneous graphs,” in Proc. ACM SIGKDD 22nd Int. Conf. Knowl. Discov. Data Mining , 2016, pp. 1035–1044
2016
Earlier work this paper cites.
S. Rayana and L. Akoglu, “Less is more: Building selective anomaly ensembles,” ACM Trans. Knowl. Discov. Data , vol. 10, no. 4, pp. 1–33, 2016
2016
Earlier work this paper cites.
J. Zhang, B. Cao, S. Xie, C. Lu, P. S. Yu, and A. B. Ragin, “Identifying connectivity patterns for brain diseases via multi-side-view guided deep architectures,” in Proc. SIAM Int. Conf. Data Mining , 2016, pp. 36–44
2016
Earlier work this paper cites.
J. Tang, C. C. Aggarwal, and H. Liu, “Node classification in signed social networks,” in Proc. SIAM Int. Conf. Data Mining , 2016, pp. 54–62
2016
Earlier work this paper cites.
B. Hooi, K. Shin, H. A. Song, A. Beutel, N. Shah, and C. Faloutsos, “Graph-based fraud detection in the face of camouflage,” ACM Trans. Knowl. Discovery Data , vol. 11, no. 4, pp. 44:1–44:26, 2017
2017
Earlier work this paper cites.
K. Shin, B. Hooi, J. Kim, and C. Faloutsos, “Densealert: Incremental dense-subtensor detection in tensor streams,” in Proc. ACM SIGKDD 23rd Int. Conf. Knowl. Discov. Data Mining , 2017, pp. 1057–1066
2017
Earlier work this paper cites.
L. Gao, J. Wu, C. Zhou, and Y. Hu, “Collaborative dynamic sparse topic regression with user profile evolution for item recommendation,” in Proc. AAAI Conf. Artif. Intell. , vol. 31, no. 1, 2017
2017
Earlier work this paper cites.
J. Li, H. Dani, X. Hu, and H. Liu, “Radar: Residual analysis for anomaly detection in attributed networks,” in Proc. 26th Int. Joint Conf. Artif. Intell. , 2017, pp. 2152–2158
2017
Earlier work this paper cites.
B. Wang, N. Z. Gong, and H. Fu, “Gang: Detecting fraudulent users in online social networks via guilt-by-association on directed graphs,” in Proc. IEEE Int. Conf. Data Mining , 2017, pp. 465–474
2017
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proc. 31st Int. Conf. Neural Inf. Process. Syst. , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Representation learning on graphs: Methods and applications,” IEEE Data Eng. Bull. , vol. 40, no. 3, pp. 52–74, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in Proc. Int. Conf. Learn. Represent. , 2017
2017
Cited alongside, same era.
N. Liu, X. Huang, and X. Hu, “Accelerated local anomaly detection via resolving attributed networks,” in Proc. 26th Int. Joint Conf. Artif. Intell. , 2017, pp. 2337–2343
2017
Cited alongside, same era.
L. Wu, X. Hu, F. Morstatter, and H. Liu, “Adaptive spammer detection with sparse group modeling,” in Proc. AAAI Int. Conf. Web Soc. Media , 2017, pp. 319–326
2017
Cited alongside, same era.
X. Teng, Y. Lin, and X. Wen, “Anomaly detection in dynamic networks using multi-view time-series hypersphere learning,” in Proc. ACM Int. Conf. Inf. Knowl. Manage. , 2017, pp. 827–836
2017
Cited alongside, same era.
Z. Dai, Z. Yang, F. Yang, W. W. Cohen, and R. Salakhutdinov, “Good semi-supervised learning that requires a bad gan,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2017
Y. Dou, Z. Liu, L. Sun, Y. Deng, H. Peng, and P. S. Yu, “Enhancing graph neural network-based fraud detectors against camouflaged fraudsters,” in Proc. ACM Int. Conf. Inf. Knowl. Manage. , 2020, pp. 315–324
2020
Later among the works it cites.
H. Wang, C. Zhou, X. Chen, J. Wu, S. Pan, and J. Wang, “Graph stochastic neural networks for semi-supervised learning,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2020
2020
Later among the works it cites.
S. Thudumu, P. Branch, J. Jin, and J. J. Singh, “A comprehensive survey of anomaly detection techniques for high dimensional big data,” J. Big Data , vol. 7, no. 1, p. 42, 2020
2020
Later among the works it cites.
A. Boukerche, L. Zheng, and O. Alfandi, “Outlier detection: Methods, models, and classification,” ACM Comput. Surv. , vol. 53, no. 3, pp. 55:1–55:37, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
2017
Cited alongside, same era.
S. Verma and Z.-L. Zhang, “Hunt for the unique, stable, sparse and fast feature learning on graphs,” in Proc. 31st Int. Conf. Neural Inf. Process. Syst. , 2017, pp. 87–97
2017
Cited alongside, same era.
C. Zhou and R. C. Paffenroth, “Anomaly detection with robust deep autoencoders,” in Proc. ACM SIGKDD 23rd Int. Conf. Knowl. Discov. Data Mining , 2017, pp. 665–674
2017
Cited alongside, same era.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proc. 31st Int. Conf. Neural Inf. Process. Syst. , 2017, pp. 1024–1034
2017
Cited alongside, same era.
A. Guzzo, A. Pugliese, A. Rullo, D. Sacca, and A. Piccolo, “Malevolent activity detection with hypergraph-based models,” IEEE Trans. Knowl. Data Eng. , vol. 29, no. 5, pp. 1115–1128, 2017
2017
Cited alongside, same era.
S. Kumar, B. Hooi, D. Makhija, M. Kumar, C. Faloutsos, and V. S. Subrahmanian, “Rev2: Fraudulent user prediction in rating platforms,” in Proc. ACM Int. Conf. Web Search Data Mining , 2018, pp. 333–341
2018
Cited alongside, same era.
X. Sun, C. Zhang, G. Li, D. Sun, F. Ren, A. Y. Zomaya, and R. Ranjan, “Detecting users’ anomalous emotion using social media for business intelligence,” J. Comput. Sci. , vol. 25, pp. 193–200, 2018
2018
Cited alongside, same era.
2020
Later among the works it cites.
S. Eltanbouly, M. Bashendy, N. AlNaimi, Z. Chkirbene, and A. Erbad, “Machine learning techniques for network anomaly detection: A survey,” in Int. Conf. Inform. IoT Enabling Technol. , 2020, pp. 156–162
2020
Later among the works it cites.
R. Wang, K. Nie, T. Wang, Y. Yang, and B. Long, “Deep learning for anomaly detection,” in Proc. ACM 13th Int. Conf. Web Search Data Mining , 2020, pp. 894–896
2020
Later among the works it cites.
Q. Wang, W. Zhao, J. Yang, J. Wu, C. Zhou, and Q. Xing, “Atne-trust: Attributed trust network embedding for trust prediction in online social networks,” in Proc. IEEE Int. Conf. Data Mining , 2020, pp. 601–610
2020
Later among the works it cites.
F. Liu, S. Xue, J. Wu, C. Zhou, W. Hu, C. Paris, S. Nepal, J. Yang, and P. S. Yu, “Deep learning for community detection: progress, challenges and opportunities,” in Proc. 29th Int. Joint Conf. Artif. Intell. , 2020, pp. 4981–4987
2020
Later among the works it cites.
S. Zhu, S. Pan, C. Zhou, J. Wu, Y. Cao, and B. Wang, “Graph geometry interaction learning,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2020
2020
Later among the works it cites.
T. Zhao, C. Deng, K. Yu, T. Jiang, D. Wang, and M. Jiang, “Error-bounded graph anomaly loss for gnns,” in Proc. ACM Int. Conf. Inf. Knowl. Manage. , 2020, pp. 1873–1882
2020
Later among the works it cites.
2020
Later among the works it cites.
M. Zhu and H. Zhu, “Mixedad: A scalable algorithm for detecting mixed anomalies in attributed graphs,” in Proc. AAAI Conf. Artif. Intell. , vol. 34, no. 01, 2020, pp. 1274–1281
2020
Later among the works it cites.
S. Bandyopadhyay, L. N, S. V. Vivek, and M. N. Murty, “Outlier resistant unsupervised deep architectures for attributed network embedding,” in Proc. ACM 13th Int. Conf. Web Search Data Mining , 2020, pp. 25–33
2020
Later among the works it cites.
2020
Later among the works it cites.
Z. Peng, M. Luo, J. Li, L. Xue, and Q. Zheng, “A deep multi-view framework for anomaly detection on attributed networks,” IEEE Trans. Knowl. Data Eng. , 2020
2020
Later among the works it cites.
S. Zhang, H. Yin, T. Chen, Q. V. H. Nguyen, Z. Huang, and L. Cui, “Gcn-based user representation learning for unifying robust recommendation and fraudster detection,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2020, pp. 689–698
2020
Later among the works it cites.
H. Fan, F. Zhang, and Z. Li, “Anomalydae: Dual autoencoder for anomaly detection on attributed networks,” in Proc. IEEE Int. Conf. Acoustics Speech Signal Processing , 2020, pp. 5685–5689
2020
Later among the works it cites.
K. Ding, J. Li, N. Agarwal, and H. Liu, “Inductive anomaly detection on attributed networks,” in Proc. 29th Int. Joint Conf. Artif. Intell. , 2020, pp. 1288–1294
2020
Later among the works it cites.
L. Ouyang, Y. Zhang, and Y. Wang, “Unified graph embedding-based anomalous edge detection,” in Proc. Int. Joint Conf. Neural Netw. , 2020, pp. 1–8
2020
Later among the works it cites.
D. Duan, L. Tong, Y. Li, J. Lu, L. Shi, and C. Zhang, “Aane: Anomaly aware network embedding for anomalous link detection,” in Proc. IEEE Int. Conf. Data Mining , 2020, pp. 1002–1007
2020
Later among the works it cites.
L. Xu, X. Wei, J. Cao, and P. S. Yu, “Icane: Interaction content-aware network embedding via co-embedding of nodes and edges,” Int. J. Data Sci. Anal. , vol. 9, no. 4, pp. 401–414, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
X. Lin, C. Zhou, H. Yang, J. Wu, H. Wang, Y. Cao, and B. Wang, “Exploratory adversarial attacks on graph neural networks,” in Proc. IEEE Int. Conf. Data Mining , 2020, pp. 1136–1141
2020
Later among the works it cites.
L. Gutiérrez-Gómez, A. Bovet, and J.-C. Delvenne, “Multi-scale anomaly detection on attributed networks,” in Proc. AAAI Conf. Artif. Intell. , vol. 34, no. 01, 2020, pp. 678–685
2020
Later among the works it cites.
Z. Liu, Y. Dou, P. S. Yu, Y. Deng, and H. Peng, “Alleviating the inconsistency problem of applying graph neural network to fraud detection,” in Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval , 2020, pp. 1569–1572
2020
Later among the works it cites.
Y.-J. Lu and C.-T. Li, “Gcan: Graph-aware co-attention networks for explainable fake news detection on social media,” in Proc. Annu. Meet. Assoc. Comput. Linguist. Proc. Conf. , 2020, pp. 505–514
2020
Later among the works it cites.
Q. Huang, J. Yu, J. Wu, and B. Wang, “Heterogeneous graph attention networks for early detection of rumors on twitter,” in Proc. Int. Joint Conf. Neural Netw. , 2020, pp. 1–8
2020
Later among the works it cites.
S. Bhatia, B. Hooi, M. Yoon, K. Shin, and C. Faloutsos, “Midas: Microcluster-based detector of anomalies in edge streams,” in Proc. AAAI Conf. Artif. Intell. , vol. 34, no. 04, 2020, pp. 3242–3249
2020
Later among the works it cites.
S. Kim, Y. Tsai, K. Singh, Y. Choi, E. Ibok, C. Li, and M. Cha, “Date: Dual attentive tree-aware embedding for customs fraud detection,” in Proc. ACM SIGKDD 26th Int. Conf. Knowl. Discov. Data Mining , 2020, pp. 2880–2890
2020
Later among the works it cites.
Q. Huang, C. Zhou, J. Wu, L. Liu, and B. Wang, “Deep spatial–temporal structure learning for rumor detection on twitter,” Neural Comput. Appl. , 08 2020
2020
Later among the works it cites.
L. Bozarth and C. Budak, “Toward a better performance evaluation framework for fake news classification,” in Proc. AAAI Int. Conf. Web Soc. Media , 2020, pp. 60–71
2020
Later among the works it cites.
N. Elmrabit, F. Zhou, F. Li, and H. Zhou, “Evaluation of machine learning algorithms for anomaly detection,” in Cyber Security , 2020, pp. 1–8
2020
Later among the works it cites.
A. H. Engly, A. R. Larsen, and W. Meng, “Evaluation of anomaly-based intrusion detection with combined imbalance correction and feature selection,” in Int. Conf. Netw. Secur. , vol. 12570, 2020, pp. 277–291
2020
Later among the works it cites.
E. Alsentzer, S. G. Finlayson, M. M. Li, and M. Zitnik, “Subgraph neural networks,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2020
2020
Later among the works it cites.
A. Sankar, Y. Wu, L. Gou, W. Zhang, and H. Yang, “Dysat: Deep neural representation learning on dynamic graphs via self-attention networks,” in Proc. ACM Int. Conf. Web Search Data Mining , 2020, pp. 519–527
2020
Later among the works it cites.
S. M. Kazemi, R. Goel, K. Jain, I. Kobyzev, A. Sethi, P. Forsyth, and P. Poupart, “Representation learning for dynamic graphs: A survey,” J. Mach. Learn. Res. , vol. 21, pp. 70:1–70:73, 2020
2020
Later among the works it cites.
S. Fan, X. Wang, C. Shi, E. Lu, K. Lin, and B. Wang, “One2multi graph autoencoder for multi-view graph clustering,” in Proc. Int. Conf. World Wide Web , 2020, pp. 3070–3076
2020
Later among the works it cites.
J. Cheng, Q. Wang, Z. Tao, D. Xie, and Q. Gao, “Multi-view attribute graph convolution networks for clustering,” in Proc. Int. Joint Conf. Artif. Intell. , 2020, pp. 2973–2979
2020
Later among the works it cites.
E. Gujral, R. Pasricha, and E. Papalexakis, “Beyond rank-1: Discovering rich community structure in multi-aspect graphs,” in Proc. Int. Conf. World Wide Web , 2020, pp. 452–462
2020
Later among the works it cites.
H. Chen, H. Yin, X. Sun, T. Chen, B. Gabrys, and K. Musial, “Multi-level graph convolutional networks for cross-platform anchor link prediction,” in Proc. ACM SIGKDD 26th Int. Conf. Knowl. Discov. Data Mining , 2020, pp. 1503–1511
2020
Later among the works it cites.
G. Pang, C. Yan, C. Shen, A. v. d. Hengel, and X. Bai, “Self-trained deep ordinal regression for end-to-end video anomaly detection,” in Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit. , 2020, pp. 12 173–12 182
2020
Later among the works it cites.
B. Sanchez-Lengeling, J. N. Wei, B. K. Lee, E. Reif, P. Wang, W. W. Qian, K. McCloskey, L. J. Colwell, and A. B. Wiltschko, “Evaluating attribution for graph neural networks,” in Proc. Int. Conf. Neural Inf. Process. Syst. , 2020
2020
Later among the works it cites.
X. Li, P. Chen, L. Jing, Z. He, and G. Yu, “Swisslog: Robust and unified deep learning based log anomaly detection for diverse faults,” in Proc. IEEE 31st Int. Symp. Software Reliab. Eng. , 2020, pp. 92–103
2020
Later among the works it cites.
G. Pang, C. Shen, L. Cao, and A. V. D. Hengel, “Deep learning for anomaly detection,” ACM Comput. Surv. , vol. 54, no. 2, p. 1–38, 2021
2021
Closest in time.
D. J. D’Souza and K. U. K. Reddy, “Anomaly detection for big data using efficient techniques: A review,” AIDE , pp. 1067–1080, 2021
2021
Closest in time.
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A comprehensive survey on graph neural networks,” IEEE Trans. Neural Networks Learn. Syst. , vol. 32, no. 1, pp. 4–24, 2021
2021
Closest in time.
2021
Closest in time.
L. Akoglu, “Anomaly mining–past, present and future,” arXiv preprint arXiv:2105.10077 , 2021
2021
Closest in time.
L. Ruff, J. R. Kauffmann, R. A. Vandermeulen, G. Montavon, W. Samek, M. Kloft, T. G. Dietterich, and K.-R. Müller, “A unifying review of deep and shallow anomaly detection,” IEEE , 2021
2021
Closest in time.
P. Morales, R. S. Caceres, and T. Eliassi-Rad, “Selective network discovery via deep reinforcement learning on embedded spaces,” Appl. Network Sci. , vol. 6, no. 1, pp. 1–20, 2021
2021
Closest in time.
Y. Wang, J. Zhang, S. Guo, H. Yin, C. Li, and H. Chen, “Decoupling representation learning and classification for gnn-based anomaly detection,” in Proc. Int. ACM SIGIR 44th Conf. Res. Develop. Inf. Retrieval , 2021, pp. 1239–1248
2021
Closest in time.
Y. Pei, T. Huang, W. van Ipenburg, and M. Pechenizkiy, “Resgcn: Attention-based deep residual modeling for anomaly detection on attributed networks,” Mach. Learn. , pp. 1–23, 2021
2021
Closest in time.
X. Wang, B. Jin, Y. Du, P. Cui, Y. Tan, and Y. Yang, “One-class graph neural networks for anomaly detection in attributed networks,” Neural Comput. Appl. , pp. 1–13, 2021
2021
Closest in time.
Y. Liu, Z. Li, S. Pan, C. Gong, C. Zhou, and G. Karypis, “Anomaly detection on attributed networks via contrastive self-supervised learning,” IEEE Trans. Neural Networks Learn. Syst. , 2021
2021
Closest in time.
K. Ding, K. Shu, X. Shan, J. Li, and H. Liu, “Cross-domain graph anomaly detection,” IEEE Trans. Neural Networks Learn. Syst. , 2021
2021
Closest in time.
G. Zhang, J. Wu, J. Yang, A. Beheshti, S. Xue, C. Zhou, and Q. Z. Sheng, “Fraudre: Fraud detection dual-resistant to graph inconsistency and imbalance,” in Proc. IEEE Int. Conf. Data Mining , 2021, pp. 66–77
2021
Closest in time.
K. Ding, Q. Zhou, H. Tong, and H. Liu, “Few-shot network anomaly detection via cross-network meta-learning,” in Proc. Web Conf. , 2021, pp. 2448–2456
2021
Closest in time.
Y.-Y. Chang, P. Li, R. Sosic, M. Afifi, M. Schweighauser, and J. Leskovec, “F-fade: Frequency factorization for anomaly detection in edge streams,” in Proc. ACM 14th Int. Conf. Web Search Data Mining , 2021, pp. 589–597
2021
Closest in time.
2021
Closest in time.
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 Trans. Inf. Syst. , 2021
2021
Closest in time.
Y. Wan, Y. Liu, D. Wang, and Y. Wen, “Glad-paw: Graph-based log anomaly detection by position aware weighted graph attention network,” in Pacific-Asia Conf. Knowl. Discov. Data Mining , 2021, pp. 66–77
2021
Closest in time.
Z. Zhang, J. Jia, B. Wang, and N. Z. Gong, “Backdoor attacks to graph neural networks,” in Proc. 26th ACM Symp. Access Control Models Technol. , 2021, pp. 15–26
2021
Closest in time.
X. Sun, H. Yin, B. Liu, H. Chen, J. Cao, Y. Shao, and N. Q. Viet Hung, “Heterogeneous hypergraph embedding for graph classification,” in Proc. ACM 14th Int. Conf. Web Search Data Mining , 2021, pp. 725–733
2021
Closest in time.
T. Idé, A. Dhurandhar, J. Navrátil, M. Singh, and N. Abe, “Anomaly attribution with likelihood compensation,” in Proc. AAAI Conf. Artif. Intell. , vol. 35, no. 5, 2021, pp. 4131–4138
2021
Closest in time.
X. Luo, J. Wu, A. Beheshti, J. Yang, X. Zhang, Y. Wang, and S. Xue, “Comga: Community-aware attributed graph anomaly detection,” in Proc. ACM Int. Conf. Web Search Data Mining , 2022
2022
Closest in time.
G. Pang, L. Cao, L. Chen, and H. Liu, “Learning representations of ultrahigh-dimensional data for random distance-based outlier detection,” in Proc. ACM SIGKDD 24th Int. Conf. Knowl. Discov. Data Mining , 2018, pp. 2041–2050
2050
Closest in time.
Z. Liu, C. Chen, X. Yang, J. Zhou, X. Li, and L. Song, “Heterogeneous graph neural networks for malicious account detection,” in Proc. ACM 27th Int. Conf. Inf. Knowl. Manage. , 2018, pp. 2077–2085
2085
Closest in time.
Q. Sun, J. Li, H. Peng, J. Wu, Y. Ning, P. S. Yu, and L. He, “Sugar: Subgraph neural network with reinforcement pooling and self-supervised mutual information mechanism,” in Proc. Int. Conf. World Wide Web , 2021, pp. 2081–2091
2091
Closest in time.