{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:16:45Z","timestamp":1777706205971,"version":"3.51.4"},"reference-count":35,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:p>Clickbait often ignores facts and fabricates false information to attract clicks and traffic, undermining the credibility of the media industry. Unbiased has been proven effective in identifying exposure bias of clickbait. However, there are still two major challenges. First, when the model pushes news to users, the issue of similar news cannot be ignored. Second, existing methods mostly focus on introducing auxiliary information to effectively compensate for the lack of interactive information. To address these issues, in this paper, a Clickbait Identification Method for Unbiased Recommendation, namely CI-UR, is proposed. CI-UR (1) proposes a deduplication method that utilizes a relevance function between news titles and content to solve the similar news push. (2) can reduce the exposure bias of news and achieve unbiased recommendation without adding auxiliary information. Firstly, a dynamic sampling strategy is adopted to obtain user embedding vectors and news embedding vectors. Then, CI-UR uses a nonlinear model to obtain prediction scores, and constructs an unbiased method to remove the impact of false positive noise on model training during user interaction. Experimental results on two real-world news datasets show that CI-UR is effective in improving the accuracy of recommendation compared to state-of-the-art algorithms.<\/jats:p>","DOI":"10.1177\/18758967251356814","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T13:46:22Z","timestamp":1758721582000},"page":"1125-1136","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Clickbait Identification Method for Unbiased Recommendation"],"prefix":"10.1177","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6040-1012","authenticated-orcid":false,"given":"Jianfang","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqing","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Fu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shibo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"crossref","unstructured":"Agrawal A. (2016). Clickbait detection using deep learning. Proceedings of the 2nd International Conference on Next Generation Computing Technologies 268\u2013272.","DOI":"10.1109\/NGCT.2016.7877426"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jjimei.2021.100052"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-34402-6"},{"key":"e_1_3_3_5_1","unstructured":"Borgeaud S. Mensch A. Hoffmann J. Cai T. Rutherford E. Millican K. Van Den Driessche G. B. Lespiau J.-B. Damoc B. Clark A. De Las Casas D. Guy A. Menick J. Ring R. Hennigan S. Huang S. Maggiore L. Jones C. Cassirer A. Sifre L. (2022). Improving language models by retrieving from trillions of tokens. International Conference on Machine Learning 2206\u20132240."},{"key":"e_1_3_3_6_1","doi-asserted-by":"crossref","unstructured":"Chen G. Chen J. Feng F. He X. Li Z. Zhou T. (2023a). Unbiased knowledge distillation for recommendation. Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining 976\u2013984.","DOI":"10.1145\/3539597.3570477"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120519"},{"key":"e_1_3_3_8_1","doi-asserted-by":"crossref","unstructured":"Damak K. Khenissi S. Nasraoui O. (2021). Debiased explainable pairwise ranking from implicit feedback. Proceedings of the 15th ACM Conference on Recommender Systems 321\u2013331.","DOI":"10.1145\/3460231.3474274"},{"issue":"6","key":"e_1_3_3_9_1","first-page":"27","article-title":"A secure privacy preserving deduplication scheme for cloud computing","volume":"101","author":"Fan Y.","year":"2019","unstructured":"Fan Y., Lin X., Liang W., Huang H., Liu Y. (2019). A secure privacy preserving deduplication scheme for cloud computing. Future Generation Computer Systems, 101(6), 27\u2013135. https:\/\/doi.org\/10.1016\/j.future.2019.06.018","journal-title":"Future Generation Computer Systems"},{"key":"e_1_3_3_10_1","doi-asserted-by":"crossref","unstructured":"He X. Deng K. Wang X. Li Y. Zhang Y. Wang R. (2020). Lightgcn: Simplifying and powering graph convolution network for recommendation. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval 639\u2013648.","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_3_11_1","doi-asserted-by":"crossref","unstructured":"He X. Zhang H. Kan M.-Y. Chua T.-S. (2017). Neural collaborative filtering. Proceedings of the 26th International Conference on World Wide Web 173\u2013182.","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.02.015"},{"key":"e_1_3_3_13_1","doi-asserted-by":"crossref","unstructured":"Hu Y. Koren Y. Volinsky C. (2008). Collaborative filtering for implicit feedback datasets. 2008 Eighth IEEE International Conference on Data Mining IEEE 263\u2013272.","DOI":"10.1109\/ICDM.2008.22"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-1747-7_23"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijerph17031066"},{"key":"e_1_3_3_16_1","doi-asserted-by":"crossref","unstructured":"Lee J. Park S. Lee J. (2021). Dual unbiased recommender learning for implicit feedback. Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval 1647\u20131651.","DOI":"10.1145\/3404835.3463118"},{"key":"e_1_3_3_17_1","first-page":"106650","article-title":"A news deduplication method based on incremental learning and maximum average cosine similarity","volume":"212","author":"Liu S.","year":"2021","unstructured":"Liu S., Zhou J., Hu M., Zhang Y., Li X. (2021). A news deduplication method based on incremental learning and maximum average cosine similarity. Knowledge-Based Systems, 212, 106650. https:\/\/doi.org\/10.1016\/j.knosys.2020.106650","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_3_18_1","doi-asserted-by":"crossref","unstructured":"Lu H. Zhang M. Ma W. Li Y. Liu Y. (2019). Effects of user negative experience in mobile news streaming. Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval 705\u2013714.","DOI":"10.1145\/3331184.3331247"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.22260\/ISARC2023\/0053"},{"key":"e_1_3_3_20_1","unstructured":"Rendle S. Freudenthaler C. Schmidt-Thieme L. (2009). BPR: Bayesian personalized ranking from implicit feedback. Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence 452\u2013461."},{"key":"e_1_3_3_21_1","doi-asserted-by":"crossref","unstructured":"Saito Y. (2020). Unbiased pairwise learning from biased implicit feedback. Proceedings of the 2020 ACM SIGIR on International Conference on Theory of Information Retrieval 5\u201312.","DOI":"10.1145\/3409256.3409812"},{"key":"e_1_3_3_22_1","doi-asserted-by":"crossref","unstructured":"Saito Y. Yaginuma S. Nishino Y. (2020). Unbiased recommender learning from missing-not-at-random implicit feedback. Proceedings of the 13th International Conference on Web Search and Data Mining 501\u2013509.","DOI":"10.1145\/3336191.3371783"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2009.03.002"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-023-01162-0"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2023.135933"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijinfomgt.2022.102474"},{"key":"e_1_3_3_27_1","doi-asserted-by":"crossref","unstructured":"Wan Q. He X. Wang X. Zhang Y. Liu Y. (2022). Cross pairwise ranking for unbiased item recommendation. Proceedings of the ACM Web Conference 2022 2370\u20132378.","DOI":"10.1145\/3485447.3512010"},{"key":"e_1_3_3_28_1","doi-asserted-by":"crossref","unstructured":"Wang W. Feng F. He X. Zhang Y. Liu Y. (2021a). Clicks can be cheating: Counterfactual recommendation for mitigating clickbait issue. Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval 1288\u20131297.","DOI":"10.1145\/3404835.3462962"},{"key":"e_1_3_3_29_1","doi-asserted-by":"crossref","unstructured":"Wang W. Feng F. He X. Zhang Y. Liu Y. (2021b). Denoising implicit feedback for recommendation. Proceedings of the 14th ACM International Conference on Web Search and Data Mining 373\u2013381.","DOI":"10.1145\/3437963.3441800"},{"key":"e_1_3_3_30_1","doi-asserted-by":"crossref","unstructured":"Wei Y. Wang X. Nie L. He X. Chua T.-S. (2019). MMGCN: Multi-modal graph convolution network for personalized recommendation of micro-video. Proceedings of the 27th ACM International Conference on Multimedia 1437\u20131445.","DOI":"10.1145\/3343031.3351034"},{"key":"e_1_3_3_31_1","doi-asserted-by":"crossref","unstructured":"Wen H. Yang L. Estrin D. (2019). Leveraging post-click feedback for content recommendations. Proceedings of the 13th ACM Conference on Recommender Systems 278\u2013286. https:\/\/doi.org\/10.1145\/3298689.3347037","DOI":"10.1145\/3298689.3347037"},{"issue":"6","key":"e_1_3_3_32_1","first-page":"9053","article-title":"A deep learning based news deduplication method using multi-channel text convolution","volume":"39","author":"Yu C.","year":"2020","unstructured":"Yu C., Qi Z., Chen X., Zhang Y., Liu Y. (2020). A deep learning based news deduplication method using multi-channel text convolution. Journal of Intelligent & Fuzzy Systems, 39(6), 9053\u20139062.\u00a0https:\/\/doi.org\/10.3233\/JIFS-189252","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"e_1_3_3_33_1","doi-asserted-by":"crossref","unstructured":"Yuan F. He X. Karatzoglou A. Zhang L. Lian J. (2020). Parameter-efficient transfer from sequential behaviors for user modeling and recommendation. Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval 1469\u20131478.","DOI":"10.1145\/3397271.3401156"},{"key":"e_1_3_3_34_1","doi-asserted-by":"crossref","unstructured":"Zheng Y. Gao C. Li X. He X. Chen H. (2021b). Disentangling user interest and conformity for recommendation with causal embedding. Proceedings of the Web Conference 2021 2980\u20132991.","DOI":"10.1145\/3442381.3449788"},{"key":"e_1_3_3_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106714"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2023.103516"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251356814","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18758967251356814","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251356814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:46:18Z","timestamp":1777455978000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18758967251356814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["10.1177\/18758967251356814"],"URL":"https:\/\/doi.org\/10.1177\/18758967251356814","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,24]]}}}