{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:55:02Z","timestamp":1730199302562,"version":"3.28.0"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1109\/asonam.2016.7752351","type":"proceedings-article","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T21:38:35Z","timestamp":1480023515000},"page":"931-938","source":"Crossref","is-referenced-by-count":2,"title":["Frequent and non-frequent pattern detection in big data streams: An experimental simulation in 1 trillion data points"],"prefix":"10.1109","author":[{"given":"Konstantinos F.","family":"Xylogiannopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reda","family":"Alhajj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Karampelas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0553-x"},{"key":"ref11","first-page":"1141","article-title":"Sequential All Frequent Itemsets Detection – A Method to Detect All Frequent Sequential Itemsets Using LERP–Reduced Suffix Array Data Structure and ARPaD Algorithhm","author":"xylogiannopoulos","year":"2015","journal-title":"Proceedings of International Conference on Advances in Social Networks Analysis and Mining"},{"key":"ref12","first-page":"344","article-title":"Real Time Early Warning DDoS Attack Detection","author":"xylogiannopoulos","year":"2016","journal-title":"Proceedings of the 11th International Conference on Cyber Warfare and Security"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0766-2"},{"journal-title":"Data Structures Algorithms and Applications for Big Data Analytics Single Multiple and All Repeated Patterns Detection in Discrete Sequences","year":"2016","author":"xylogiannopoulos","key":"ref14"},{"key":"ref15","article-title":"Methods for finding frequent items in data streams","author":"cormode","year":"2009","journal-title":"The VLDB Journal"},{"key":"ref16","article-title":"A fast majority vote algorithm","author":"boyer","year":"1981","journal-title":"Technical Report ICSCA-CMP-32 Institute for Computer Science University of Texas"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_33"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0394-4"},{"key":"ref3","first-page":"579","article-title":"Computing All Repeats Using Suffix Arrays","volume":"8","author":"franek","year":"2003","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"ref6","first-page":"161","article-title":"Fast Optimal Algorithms for Computing All the Repeats in a String","author":"puglishi","year":"2008","journal-title":"Proceedings of the PSCC"},{"key":"ref5","first-page":"319","article-title":"Suffix Arrays: A New Method for On-Line String Searches","author":"manber","year":"1990","journal-title":"Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0499-4"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"journal-title":"CALICO","article-title":"PI-World site","year":"0","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90109-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3773-4_5"},{"key":"ref20","article-title":"Efficient computation of frequent and top-k elements in data streams","author":"metwally","year":"2005","journal-title":"International Conference on Database Theory"},{"key":"ref22","article-title":"Fast data stream algorithms using associativememories","author":"bandi","year":"2007","journal-title":"ACMSIGMOD International Conference on Management of Data"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375670"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237823"}],"event":{"name":"2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","start":{"date-parts":[[2016,8,18]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2016,8,21]]}},"container-title":["2016 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7736513\/7752180\/07752351.pdf?arnumber=7752351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T08:37:09Z","timestamp":1481963829000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7752351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/asonam.2016.7752351","relation":{},"subject":[],"published":{"date-parts":[[2016,8]]}}}