{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:22:14Z","timestamp":1761294134938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["DSAIPA\/DS\/0086\/2018"],"award-info":[{"award-number":["DSAIPA\/DS\/0086\/2018"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,30]]},"DOI":"10.1145\/3341105.3373842","type":"proceedings-article","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T17:55:36Z","timestamp":1592243736000},"page":"482-489","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fraud detection using heavy hitters"],"prefix":"10.1145","author":[{"given":"Bruno","family":"Veloso","sequence":"first","affiliation":[{"name":"INESCTEC, Porto, Portugal"}]},{"given":"Carlos","family":"Martins","sequence":"additional","affiliation":[{"name":"WEDO, Braga, Portugal"}]},{"given":"Raphael","family":"Espanha","sequence":"additional","affiliation":[{"name":"WEDO, Braga, Portugal"}]},{"given":"Raul","family":"Azevedo","sequence":"additional","affiliation":[{"name":"WEDO, Braga, Portugal"}]},{"given":"Jo\u00e3o","family":"Gama","sequence":"additional","affiliation":[{"name":"INESCTEC, Porto, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"2017 Global Fraud Loss Survey. Press Release","author":"Control Communications Fraud","year":"2017","unstructured":"Communications Fraud Control Association et al. 2017 . 2017 Global Fraud Loss Survey. Press Release , June ( 2017 ). Communications Fraud Control Association et al. 2017. 2017 Global Fraud Loss Survey. Press Release, June (2017)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2010.18"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-009-0172-z"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007588"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324172.1324174"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376916.1376930"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.10053"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Discrete Mathematics and Theoretical Computer Science. Discrete Mathematics and Theoretical Computer Science 137--156.  Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Discrete Mathematics and Theoretical Computer Science. Discrete Mathematics and Theoretical Computer Science 137--156.","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.167"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI '13)","author":"San Martino Giovanni Da","year":"2013","unstructured":"Giovanni Da San Martino , Nicol\u00f2 Navarin , and Alessandro Sperduti . 2013 . A Lossy Counting Based Approach for Learning on Streams of Graphs on a Budget . In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI '13) . AAAI Press, 1294--1301. http:\/\/dl.acm.org\/citation.cfm?id=2540128.2540315 Giovanni Da San Martino, Nicol\u00f2 Navarin, and Alessandro Sperduti. 2013. A Lossy Counting Based Approach for Learning on Streams of Graphs on a Budget. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (IJCAI '13). AAAI Press, 1294--1301. http:\/\/dl.acm.org\/citation.cfm?id=2540128.2540315"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000002"},{"volume-title":"2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--4.","author":"Nishina T.","key":"e_1_3_2_1_14_1","unstructured":"T. Nishina , K. Iwanuma , and Y. Yamamoto . 2019. A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining . In 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--4. T. Nishina, K. Iwanuma, and Y. Yamamoto. 2019. A Skipping FP-Tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining. In 2019 IEEE International Conference on Big Data and Smart Computing (BigComp). IEEE, 1--4."},{"key":"e_1_3_2_1_15_1","unstructured":"B. Subbulakshmi and A. Periya Nayaki. 2018. Compact Pattern Stream Tree Algorithm.  B. Subbulakshmi and A. Periya Nayaki. 2018. Compact Pattern Stream Tree Algorithm."}],"event":{"name":"SAC '20: The 35th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Brno Czech Republic","acronym":"SAC '20"},"container-title":["Proceedings of the 35th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3373842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341105.3373842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:11Z","timestamp":1750204451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3373842"}},"subtitle":["a case study"],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":15,"alternative-id":["10.1145\/3341105.3373842","10.1145\/3341105"],"URL":"https:\/\/doi.org\/10.1145\/3341105.3373842","relation":{},"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"2020-03-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}