{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T15:42:08Z","timestamp":1785512528650,"version":"3.56.0"},"reference-count":66,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Czech Grant Agency","award":["22-32620S"],"award-info":[{"award-number":["22-32620S"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tifs.2024.3360867","type":"journal-article","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T18:32:41Z","timestamp":1706725961000},"page":"3554-3566","source":"Crossref","is-referenced-by-count":5,"title":["Malicious Internet Entity Detection Using Local Graph Inference"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8776-2854","authenticated-orcid":false,"given":"\u0160imon","family":"Mandl\u00edk","sequence":"first","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Center, Czech Technical University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5768-9713","authenticated-orcid":false,"given":"Tom\u00e1\u0161","family":"Pevn\u00fd","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Center, Czech Technical University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3027-6174","authenticated-orcid":false,"given":"V\u00e1clav","family":"\u0160m\u00eddl","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Artificial Intelligence Center, Czech Technical University, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9402-6417","authenticated-orcid":false,"given":"Luk\u00e1\u0161","family":"Bajer","sequence":"additional","affiliation":[{"name":"Cisco Systems, Prague, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"issue":"6","key":"ref1","first-page":"107","article-title":"Highly predictive blacklisting","volume":"33","author":"Zhang","year":"2008","journal-title":"Login Usenix Mag."},{"key":"ref2","first-page":"1","article-title":"Building a dynamic reputation system for DNS","volume-title":"Proc. USENIX Secur. Symp.","author":"Antonakakis"},{"key":"ref3","first-page":"1","article-title":"EXPOSURE: Finding malicious domains using passive DNS analysis","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp. (NDSS)","author":"Bilge"},{"key":"ref4","first-page":"807","article-title":"Optimized invariant representation of network traffic for detecting unseen malware variants","volume-title":"Proc. USENIX Secur. Symp.","author":"Bartos"},{"key":"ref5","article-title":"TESSERACT: Eliminating experimental bias in malware classification across space and time","author":"Pendlebury","year":"2018","journal-title":"arXiv:1807.07838"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2334272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1920261.1920283"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6288321"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1850795.1850796"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298319"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2015.14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2455414"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/COMSNETS.2019.8711243"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638196"},{"key":"ref15","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst. Annu. Conf. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton"},{"key":"ref16","article-title":"Graph neural networks: A review of methods and applications","author":"Zhou","year":"2018","journal-title":"arXiv:1812.08434"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2020.2978386"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3468791.3468814"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DSN53405.2022.00028"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10021008"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM48099.2022.10001299"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00034-3"},{"key":"ref23","first-page":"570","article-title":"A framework for multiple-instance learning","volume-title":"Advances in Neural Information Processing Systems","volume":"10","author":"Maron","year":"1998"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.06.003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S026988890999035X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2996758.2996761"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59072-1_17"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.32388\/li2ajv"},{"key":"ref29","article-title":"Approximation capability of neural networks on spaces of probability measures and tree-structured domains","author":"Pevn\u00fd","year":"2019","journal-title":"arXiv:1906.00764"},{"key":"ref30","article-title":"Geometric deep learning: Going beyond Euclidean data","author":"Bronstein","year":"2016","journal-title":"arXiv:1611.08097"},{"key":"ref31","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016","journal-title":"arXiv:1609.02907"},{"key":"ref32","first-page":"2973","article-title":"Semi-supervised novelty detection","volume":"11","author":"Blanchard","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1126\/science.287.5461.2115a"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815300"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/316194.316229"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699147"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/c2009-0-27609-4"},{"key":"ref38","first-page":"479","article-title":"A revolution: Belief propagation in graphs with cycles","volume-title":"Proc. Adv. Neural Inf. Process. Syst. NIPS Conf.","author":"Frey"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00178-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.81"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783296"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0111"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132953"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2018.2833443"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186106"},{"key":"ref48","article-title":"Joint embedding of meta-path and meta-graph for heterogeneous information networks","author":"Sun","year":"1809","journal-title":"arXiv:1809.04110"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330673"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313562"},{"key":"ref51","article-title":"Graph-based detection of malicious network communities","author":"Jusko","year":"2017"},{"key":"ref52","article-title":"SIGN: Scalable inception graph neural networks","author":"Rossi","year":"2020","journal-title":"arXiv:2004.11198"},{"issue":"298","key":"ref53","first-page":"1","article-title":"JsonGrinder. jl: Automated differentiable neural architecture for embedding arbitrary JSON data","volume":"23","author":"Mandl\u00edk","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref54","article-title":"Nested multiple instance learning in modelling of HTTP network traffic","author":"Pevn\u00fd","year":"2020","journal-title":"arXiv:2002.04059"},{"key":"ref55","article-title":"Mapping the internet: Modelling entity interactions in complex heterogeneous networks","author":"Mandlik","year":"2021","journal-title":"arXiv:2104.09650"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2014.6921576"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11203-9_1"},{"issue":"5","key":"ref58","first-page":"263","article-title":"Monte Carlo theory, methods and examples","volume":"1","author":"Owen","year":"2013","journal-title":"J. Oper. Res. Soc. America"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1.5.263"},{"key":"ref60","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"ref61","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","author":"Ioffe","year":"2015","journal-title":"arXiv:1502.03167"},{"key":"ref62","article-title":"Classifying and segmenting microscopy images using convolutional multiple instance learning","author":"Kraus","year":"2015","journal-title":"arXiv:1511.05286"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44848-9_34"},{"key":"ref64","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Represent. (ICLR)","author":"Kingma"},{"key":"ref65","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","volume":"9","author":"Glorot"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.05.021"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/10319981\/10418120.pdf?arnumber=10418120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:20:20Z","timestamp":1714796420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10418120\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":66,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3360867","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}