{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T11:45:29Z","timestamp":1707824729345},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["688797"],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Big Data"],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1109\/tbdata.2017.2716409","type":"journal-article","created":{"date-parts":[[2017,6,23]],"date-time":"2017-06-23T18:42:11Z","timestamp":1498243331000},"page":"293-304","source":"Crossref","is-referenced-by-count":11,"title":["Spamdoop: A Privacy-Preserving Big Data Platform for Collaborative Spam Detection"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-6770-3654","authenticated-orcid":false,"given":"Abdelrahman","family":"AlMahmoud","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9557-6496","authenticated-orcid":false,"given":"Ernesto","family":"Damiani","sequence":"additional","affiliation":[]},{"given":"Hadi","family":"Otrok","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6469-9154","authenticated-orcid":false,"given":"Yousof","family":"Al-Hammadi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.143"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.104"},{"key":"ref33","year":"2016"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.147"},{"key":"ref31","article-title":"MapReduce based RDF assisted distributed SVM for high throughput spam filtering","author":"caruana","year":"2013"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2011.6020074"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.257"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/PTP.2004.1334945"},{"key":"ref35","year":"2016"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2015.01.006"},{"key":"ref10","first-page":"195","article-title":"Fast and effective clustering of spam emails based on structural similarity","author":"sheikhalishahi","year":"2015","journal-title":"Proc Int Symp Found Pract Secur"},{"key":"ref40","first-page":"199","article-title":"Compressing trigram language models with golomb coding","author":"church","year":"2007","journal-title":"Proc Joint Conf Empirical Methods Natural Language Process Comput Natural Language Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123125"},{"key":"ref12","first-page":"1","article-title":"State of the art in similarity preserving hashing functions","author":"gayoso","year":"2014","journal-title":"Proc Int Conf Secur Manage"},{"key":"ref13","first-page":"1","article-title":"Characterizing botnets from email spam records","author":"zhuang","year":"2008","journal-title":"USENIX Workshop on Large-scale Exploits and Emergent Threats"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2684793.2684803"},{"key":"ref15","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1105664.1105677"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","article-title":"Identifying almost identical files using context triggered piecewise hashing","volume":"3","author":"kornblum","year":"2006","journal-title":"Journal of digital investigation"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2007.06.011"},{"key":"ref19","first-page":"167","article-title":"Similarity preserving hashing: Eligible properties and a new algorithm MRSH-v2","author":"breitinger","year":"2012","journal-title":"Proc Int Conf Digit Forensics Cyber Crime"},{"key":"ref28","first-page":"14","article-title":"Comparative study on email spam classifier using data mining techniques","author":"kumar","year":"2012","journal-title":"Proc Int MultiConf Eng Comput Scientists"},{"key":"ref4","article-title":"Spam and phishing statistics for 2016","year":"2016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2089125.2089129"},{"key":"ref3","article-title":"Spam and phishing statistics report Q1–2014","year":"2016"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/1500000006"},{"key":"ref29","author":"conway","year":"2012","journal-title":"Machine learning for hackers"},{"key":"ref5","first-page":"27","article-title":"2016 Internet security threat report","volume":"21","author":"wood","year":"2016","journal-title":"Symantec"},{"key":"ref8","article-title":"The underground economy of spam: A botmaster's perspective of coordinating large-scale spam campaigns","author":"stone-gross","year":"2011","journal-title":"USENIX Workshop on Large-scale Exploits and Emergent Threats"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-4789-3.ch002"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2013.254082"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-015-0029-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S1353-4858(09)70007-8"},{"key":"ref46","article-title":"Welcome to apache hadoop","year":"2016"},{"key":"ref20","first-page":"559","article-title":"An open digest-based technique for spam detection","author":"damiani","year":"2004","journal-title":"Proc Int Workshop Secur Parallel Distrib Syst"},{"key":"ref45","first-page":"1","article-title":"Exploiting redundancy in natural language to penetrate Bayesian spam filters","author":"karlberger","year":"2007","journal-title":"Proc USENIX Workshop Offensive Technol"},{"key":"ref22","article-title":"Algorithms key sizes and parameter report-2013 recommendations","author":"smart","year":"2013","journal-title":"European Union Agency for Network and Information Security (ENISA)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CTC.2013.9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SPW.2014.21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2207243.2207252"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2014.6849281"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2013.08.003"},{"key":"ref44","article-title":"Spam email datasets","year":"2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935047"},{"key":"ref43","first-page":"59","article-title":"Histogram-based outlier score (HBOS): A fast unsupervised anomaly detection algorithm","author":"goldstein","year":"2012","journal-title":"Proc German Conf Artif Intell Poster Demo Track"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.aasri.2013.10.082"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6687317\/8819924\/07956257.pdf?arnumber=7956257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:44:09Z","timestamp":1657745049000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7956257\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":46,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2017.2716409","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}