{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T20:33:13Z","timestamp":1711485193151},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01517-y","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T10:02:53Z","timestamp":1671271373000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Spam Classification: Genetically Optimized Passive-Aggressive Approach"],"prefix":"10.1007","volume":"4","author":[{"given":"Priyatam","family":"Naravajhula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alekhya","family":"Naravajula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"key":"1517_CR1","doi-asserted-by":"crossref","unstructured":"Alazab, Broadhurst Roderic. An Analysis of the Nature of Spam as Cybercrime 2017.","DOI":"10.1007\/978-3-319-32824-9_13"},{"key":"1517_CR2","volume-title":"Machine learning algorithms","author":"G Bonaccorso","year":"2018","unstructured":"Bonaccorso G. Machine learning algorithms. Birmingham: Packt publishing; 2018."},{"key":"1517_CR3","doi-asserted-by":"crossref","unstructured":"Cheng L-C, Tseng Judy CR, Chung T-Y. Case study of fake web reviews. In: International conference on advances in social network analysis and mining; 2017. IEEE\/ACM, pp. 706\u20139.","DOI":"10.1145\/3110025.3110119"},{"key":"1517_CR4","first-page":"551","volume":"2006","author":"K Crammer","year":"2006","unstructured":"Crammer K, Dekel O, Keshet J, Shalev-Shwartz S. Online passive-aggressive 32 algorithms. J Mach Learn Res. 2006;2006:551\u201385.","journal-title":"J Mach Learn Res"},{"key":"1517_CR5","unstructured":"Emmanuel G. Machine learning for email spam filtering: review, approaches and open research problems Heliyon; 2019."},{"key":"1517_CR6","doi-asserted-by":"crossref","unstructured":"Zulfikar Alom BC. A deep learning model for Twitter spam detection. Online Social Networks and Media; 2020.","DOI":"10.1016\/j.osnem.2020.100079"},{"key":"1517_CR7","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.ipm.2016.12.002","volume":"53","author":"YH Hu","year":"2017","unstructured":"Hu YH, Chen YL, Chou HL. Opinion mining from online hotel reviews\u2014a text summarization approach. Inf Process Manag. 2017;53:436\u201349.","journal-title":"Inf Process Manag"},{"key":"1517_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.eswa.2017.12.016","volume":"96","author":"Y Li","year":"2018","unstructured":"Li Y, Nie X, Huang R. Web Spam classification methods based on deep belief networks. Expert Syst Appl. 2018;96:261\u201370.","journal-title":"Expert Syst Appl"},{"key":"1517_CR9","doi-asserted-by":"crossref","unstructured":"Liu S, Zhang J, Xiang Y. Statistical detection of online drifting twitter spam. In: 11th ACM on Asia conference on computer and communication security; 2016. ACM, pp. 1\u201310.","DOI":"10.1145\/2897845.2897928"},{"key":"1517_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s12065-019-00204-x","volume":"12","author":"AC Pandey","year":"2019","unstructured":"Pandey AC, Rajpoot DS. Spam review detection using sprial cuckoo search clustering method. Evol Intell. 2019;12:147\u201364.","journal-title":"Evol Intell"},{"key":"1517_CR11","doi-asserted-by":"crossref","unstructured":"Salehi S, Selamat A, Bostanian M. Enhanced Genetic Algorithm for spam detection in Email. IEEE; 2011.","DOI":"10.1109\/ICSESS.2011.5982390"},{"key":"1517_CR12","doi-asserted-by":"crossref","unstructured":"Sanpakdee U, Walairacht A, Walairacht S. Adaptive spam mail filtering using genetic algorithm. IEEE 2006.","DOI":"10.1109\/ICACT.2006.206004"},{"key":"1517_CR13","unstructured":"Babatunde OH, Armstrong L, Leng J, Diepeveen D. A genetic-algorithm-based feature selection. Int J Electron Commun Comput Eng 2014."},{"key":"1517_CR14","doi-asserted-by":"publisher","unstructured":"Frohlich H, Chapelle O, Scholkopf B. Feature Selection for support vector machines by means of genetic algorithms. In: Proceedings, 15th IEEE international conference on tools with artificial intelligence; 2003. pp. 142\u2013148. https:\/\/doi.org\/10.1109\/TAI.2003.1250182.","DOI":"10.1109\/TAI.2003.1250182"},{"key":"1517_CR15","unstructured":"Chowdhary M, Dhaka VS. E-mail Spam Filtering using Genetic Algorithm: A Depper Analysis. Int J Comput Sci Inf Technol. 2272\u20136 (n.d.)."},{"key":"1517_CR16","volume-title":"Principles of Soft Computing","author":"SN Sivanandam","year":"2011","unstructured":"Sivanandam SN, Deepa SN. Principles of Soft Computing. New Delhi: Wiely-India; 2nd Edition. publication in year 2011."},{"key":"1517_CR17","unstructured":"David Schaffer J, Morishima A. An Adaptive crossover distribution mechanism for genetic algorithms. In: Proceedings of second international conference o genetic algorithms; 1987. Hillsdale: Lawerence Erlbaum Associates, Inc, pp. 36-40."},{"key":"1517_CR18","unstructured":"Morik K, K\u00f6pcke H. Analysing insurance data or the advantage of TF\/IDF Features. Research Gate; 2003."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01517-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01517-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01517-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T11:37:27Z","timestamp":1678448247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01517-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":18,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["1517"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01517-y","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"7 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration\u00a0"}},{"value":"Author declares no conflict of interest exists.\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0  \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"93"}}