{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:10:54Z","timestamp":1772118654694,"version":"3.50.1"},"reference-count":7,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T00:00:00Z","timestamp":1762128000000},"content-version":"vor","delay-in-days":2,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Internet Technology Letters"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>With the rise of social media chat platforms, spam, particularly in the form of text\u2010embedded images has become increasingly disruptive. This study proposes a lightweight, reference\u2010based, unsupervised spam detection method that offers both computational efficiency and high adaptability. Unlike traditional supervised models, the approach leverages string similarity algorithms to detect phrases resembling user\u2010defined spam references. Specifically targeting overlooked categories like festive wishes, this method allows users to customize spam detection based on contextual needs. By focusing on low\u2010resource processing and dynamic adaptability, the framework effectively identifies clutter\u2010inducing spam while (with 80% accuracy) remaining scalable for broader applications.<\/jats:p>","DOI":"10.1002\/itl2.70179","type":"journal-article","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T05:39:55Z","timestamp":1762234795000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reference\u2010Based Spam Detection Using Longest Common Substring"],"prefix":"10.1002","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9260-0614","authenticated-orcid":false,"given":"Arunabha","family":"Tarafdar","sequence":"first","affiliation":[{"name":"Department of CSE NIT Patna  Patna Bihar India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6113-7284","authenticated-orcid":false,"given":"Chayan","family":"Halder","sequence":"additional","affiliation":[{"name":"Department of Computer Science Ramakrishna Mission Vivekananda Centenary College  Kolkata West Bengal India"}]},{"given":"Dinesh","family":"Dash","sequence":"additional","affiliation":[{"name":"Department of CSE NIT Patna  Patna Bihar India"}]}],"member":"311","published-online":{"date-parts":[[2025,11,3]]},"reference":[{"key":"e_1_2_1_8_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.247"},{"key":"e_1_2_1_8_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.618"},{"key":"e_1_2_1_8_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10195-4"},{"key":"e_1_2_1_8_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582768.3582795"},{"key":"e_1_2_1_8_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"e_1_2_1_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3081479"},{"key":"e_1_2_1_8_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441667"}],"container-title":["Internet Technology Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/itl2.70179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T12:21:51Z","timestamp":1762777311000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/itl2.70179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1002\/itl2.70179"],"URL":"https:\/\/doi.org\/10.1002\/itl2.70179","archive":["Portico"],"relation":{"has-review":[{"id-type":"doi","id":"10.1002\/ITL2.70179\/v2\/response1","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v2\/decision1","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v2\/review2","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v1\/decision1","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v1\/review1","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v1\/review2","asserted-by":"object"},{"id-type":"doi","id":"10.1002\/ITL2.70179\/v2\/review1","asserted-by":"object"}]},"ISSN":["2476-1508","2476-1508"],"issn-type":[{"value":"2476-1508","type":"print"},{"value":"2476-1508","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"2025-05-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70179"}}