<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">76156</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2026.076156</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Deep-Learning Approaches to Text-Based Verification for Digital and Fake News Detection</article-title>
<alt-title alt-title-type="left-running-head">Deep-Learning Approaches to Text-Based Verification for Digital and Fake News Detection</alt-title>
<alt-title alt-title-type="right-running-head">Deep-Learning Approaches to Text-Based Verification for Digital and Fake News Detection</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Alotaibi</surname><given-names>Raed</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>alhafi@su.edu.sa</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Ahmed</surname><given-names>Muhammad Atta Othman</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Reyad</surname><given-names>Omar</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><xref ref-type="aff" rid="aff-4">4</xref><email>oreyad@su.edu.sa</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Omran</surname><given-names>Nahla Fathy</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Applied College, Shaqra University</institution>, <addr-line>Shaqra</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-2"><label>2</label><institution>Faculty of Computers and Information, Luxor University</institution>, <addr-line>Luxor</addr-line>, <country>Egypt</country></aff>
<aff id="aff-3"><label>3</label><institution>College of Computing and Information Technology, Shaqra University</institution>, <addr-line>Shaqra</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-4"><label>4</label><institution>Faculty of Computers and Artificial Intelligence, Sohag University</institution>, <addr-line>Sohag</addr-line>, <country>Egypt</country></aff>
<aff id="aff-5"><label>5</label><institution>Faculty of Computers and Information, Qena University</institution>, <addr-line>Qena</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Authors: Raed Alotaibi. Email: <email>alhafi@su.edu.sa</email>; Omar Reyad. Email: <email>oreyad@su.edu.sa</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2026</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>9</day><month>4</month><year>2026</year>
</pub-date>
<volume>87</volume>
<issue>3</issue>
<elocation-id>58</elocation-id>
<history>
<date date-type="received">
<day>15</day>
<month>11</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>05</day>
<month>02</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors. Published by Tech Science Press.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>The Authors</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_76156.pdf"></self-uri>
<abstract>
<p>The widespread use of social media has made assessing users&#x2019; tastes and preferences increasingly complex and important. At the same time, the rapid dissemination of misinformation on these platforms poses a critical challenge, driving significant efforts to develop effective detection methods. This study offers a comprehensive analysis leveraging advanced Machine Learning (ML) techniques to classify news articles as fake or true, contributing to discourse on media integrity and combating misinformation. The suggested method employed a diverse dataset encompassing a wide range of topics. The method evaluates the performance of five ML models: Artificial Neural Networks (ANNs), Convolutional Neural Networks (CNNs), Long Short-Term Memory networks (LSTMs), Decision Trees (DTs), and Support Vector Machines with Radial Basis Function (SVM-RBF) kernels. The presented methodology included thorough data preprocessing, detailed parameter tuning during model training, and robust statistical analyses to ensure fair and accurate performance comparisons. The results demonstrate that the combination of Term Frequency-Inverse Document Frequency (TF-IDF) with ANN and CNN achieved the highest accuracy of 99.13%, showcasing the effectiveness of these approaches in text-based news classification. The LSTM model followed closely with an accuracy of 98.59%, while the DT and SVM-RBF models achieved accuracies of 85.67% and 90.22%, respectively. These findings highlight the superior performance of deep learning (DL) models when combined with effective feature extraction techniques such as TF-IDF. The models offer practical utility and show promising potential for integration into editorial workflows to facilitate pre-publication news verification. Furthermore, statistical test methods such as Analysis of Variance (ANOVA) and Tukey&#x2019;s Honestly Significant Difference (HSD) tests are also performed. The obtained results clarify significant performance differences among the evaluated models, highlighting their unique capabilities and comparative strengths in the context of fake news detection. Hence, the presented study reinforces the importance of artificial intelligence based tools in promoting media reliability and provides a foundation for future advancements in automated misinformation detection systems.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Text verification</kwd>
<kwd>fake news detection</kwd>
<kwd>machine learning</kwd>
<kwd>deep learning</kwd>
<kwd>CNN</kwd>
<kwd>LSTM</kwd>
<kwd>news classification systems</kwd>
<kwd>misinformation detection</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>In the digital age, the news media landscape has undergone a transformative expansion, offering a wide array of sources that serve as chroniclers of people times, shape public opinion, and support the democratic process and crucial pillars supporting the democratic process [<xref ref-type="bibr" rid="ref-1">1</xref>]. This proliferation brings significant challenges for verifying the authenticity of disseminated information [<xref ref-type="bibr" rid="ref-2">2</xref>]. Misinformation is widespread, often fueled by clickbait headlines and polarizing content shared on social media and other platforms [<xref ref-type="bibr" rid="ref-3">3</xref>]. The significant impact of news on our lives is evident in recent global events [<xref ref-type="bibr" rid="ref-4">4</xref>]. Whether it&#x2019;s staying informed about the pandemic or following the stock market rally, people heavily depend on the news. Studies have found that much of the news on social media is intentionally misleading and is generally categorized under the broader term &#x201C;fake news&#x201D; [<xref ref-type="bibr" rid="ref-5">5</xref>]. Fake news is false information presented as news with the intent to mislead. It has been confirmed that spreading fake news impacts sociopolitical domains, human behavior, and the sovereignty of a country [<xref ref-type="bibr" rid="ref-6">6</xref>]. It has also been noted that Artificial Intelligence (AI) is a new tool for detecting and verifying fake news on social media platforms in a short time [<xref ref-type="bibr" rid="ref-7">7</xref>]. In the same line, sophisticated technologies should be used to stop the spread of fake news [<xref ref-type="bibr" rid="ref-8">8</xref>]. The increased use of AI in journalism marks a pivotal shift toward addressing these challenges, making a new era of news creation, dissemination, and consumption [<xref ref-type="bibr" rid="ref-9">9</xref>]. AI now parses large news streams, detects emerging patterns, and can even draft stories, expanding the scale and speed of reporting while raising new risks to accuracy and reliability. Unlike many existing studies that rely on single-run performance metrics, this research establishes a statistically significant benchmark by validating model efficacy across 20 independent runs. The robustness of our results is confirmed through rigorous ANOVA testing, yielding a substantial F-statistic of 2981.91, thereby offering a level of validation and reproducibility often missing in standard deep learning evaluations. The presented study addresses this risk&#x2014;the spread of fake news&#x2014;by applying multiple machine learning models to distinguish authentic content from fabrications. Although LSTM models are generally effective for sequential data, their sequence-modeling capability is not leveraged in this specific experimental setting due to the use of TF-IDF features. The results show high-confidence classification of genuine articles, underscoring AI&#x2019;s practical role in news verification and support of journalistic integrity. Integrating the model into practices is a key step in automating pre-publication checks and enhancing media integrity.</p>
<p>The next sections of this paper is structured as follows. <xref ref-type="sec" rid="s2">Section 2</xref> delves into existing literature and bridging past research with the present inquiry into AI&#x2019;s application in news validation. <xref ref-type="sec" rid="s3">Section 3</xref> outlines computational approach and analytical design, detailing the strategies employed to assess the efficacy of ML models in news classification. The discussion on the experimental hypothesis and modeling setup is prepared in <xref ref-type="sec" rid="s4">Section 4</xref>, which outlines the research hypotheses and the structured framework created. <xref ref-type="sec" rid="s5">Section 5</xref> presents the empirical results. Finally, <xref ref-type="sec" rid="s6">Section 6</xref> summarizes key findings and suggests directions for future research in the critical and evolving field.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<p>A recent survey in [<xref ref-type="bibr" rid="ref-10">10</xref>] consolidates empirical fake-news detection studies across major Natural Language Processing (NLP) and applied-AI venues, contrasting classical ML with deep models and focusing on reported algorithms and metrics; it exposes gaps in modality coverage and robustness evaluation, robustness-aware design. ZoFia is a two-stage zero-shot framework that (i) uses Hierarchical Salience with a Soft Cosine with Maximal Marginal Relevance (SC-MMR) selector to retrieve fresh external evidence and (ii) conducts a multi large language model, role-based debate to deliver interpretable judgments; it outperforms zero-shot and many few-shot baselines on two public datasets [<xref ref-type="bibr" rid="ref-11">11</xref>]. The co-attention mechanism in a Combined Graph neural network model (CMCG) fuses two Graph Neural Network (GNN) streams&#x2014;user profiles and user preferences (news content, user history, and sharing cascades)&#x2014;linked via a co-attention module to model who shares and what is shared, achieving 98.53% on GossipCop and 96.77% on PolitiFact, underscoring the benefits of profile&#x2013;preference&#x2013;propagation fusion over content-only baselines [<xref ref-type="bibr" rid="ref-12">12</xref>]. Tajrian et al. present a structured review of fake-news research, organizing it along two axes: how fake news is analyzed (knowledge, style, propagation, and source) and how it is detected (manual vs. AI-driven automatic methods) [<xref ref-type="bibr" rid="ref-13">13</xref>]. They also examine political news through sentiment analysis, showing how media framing shapes public perception. Furthermore, deep learning has introduced novel approaches to news classification. Zhou and Zafarani [<xref ref-type="bibr" rid="ref-14">14</xref>] used deep neural networks to distinguish between real and fake news stories. Their model demonstrates remarkable accuracy, highlighting the potential of deep learning in enhancing the reliability of news shared on social media platforms. Another pivotal area of investigation within the realm of news classification is the challenge posed by imbalanced datasets, particularly in non-English languages. For Bangla news classification, Hasib et al. balance a 437,948-item corpus using Random Under-Sampling (RUS) and Synthetic Minority Oversampling Technique (SMOTE), then benchmark classical ML (logistic regression, decision tree, Stochastic Gradient Descent (SGD)) against ANN, CNN, and Bidirectional Encoder Representations from Transformers (BERT) [<xref ref-type="bibr" rid="ref-15">15</xref>]. BERT tops performance with 99.04% accuracy on the balanced set vs. 72.23% on the imbalanced set, underscoring both the benefit of rebalancing and the advantage of transformer models [<xref ref-type="bibr" rid="ref-15">15</xref>]. Authors in [<xref ref-type="bibr" rid="ref-16">16</xref>] presented a study focusing on the classification, detection, and sentiment analysis of digital news using ML techniques. Their research addressed several challenges associated with digital news. Their findings show the Fake News Detection Model, with an accuracy of 87%, and a sentiment analysis model, with 89% accuracy. Kumar et al. benchmark classic and neural models (Naive Bayes, SVM, Passive-Aggressive, Random Forest, Logistic Regression, LSTM, BERT) on the ISOT dataset (44,898 samples) for fake-news detection, finding SVM achieves the best precision (99.88%), narrowly ahead of Random Forest and Passive-Aggressive [<xref ref-type="bibr" rid="ref-17">17</xref>]. Mishra and Sadia deliver a comprehensive survey of fake-news detection, synthesizing ML and DL approaches across major social platforms while cataloging datasets, features, and model families. They distill strengths and limitations&#x2014;e.g., generalization gaps, evolving topics, and modality/propagation cues&#x2014;providing a clear roadmap of effective techniques and open challenges [<xref ref-type="bibr" rid="ref-18">18</xref>].</p>
<p>Recent developments in the field have been significantly shaped by the advent of Transformer-based architectures. Vaswani et al. introduced the attention mechanism [<xref ref-type="bibr" rid="ref-19">19</xref>], which paved the way for models like BERT [<xref ref-type="bibr" rid="ref-20">20</xref>]. Their study utilized several ML and deep learning techniques to categorize news articles accurately. Their findings demonstrated remarkable results, achieving an accuracy of up to 94%.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<p>The presented work explores various machine learning models to address the nuanced task of classifying text data into fake and true news articles. The suggested approach highlights the use of multiple computational techniques as shown in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>. Initially, introducing the foundational concepts of ANN, which mimic the human brain&#x2019;s neural structure to capture complex relationships within the data. Moving forward, elucidating the CNN as a powerhouse in processing grid-like topologies of data, or in the case of this study, vector-based features extracted from text, by learning spatial hierarchies of features. The methodology further extends to LSTMs. Showcasing their exceptional ability to retain information across extended sequences, these models are especially well-suited for tasks involving time-series analysis or the processing of sequential text data.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Experimental pipeline overview.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-1.tif"/>
</fig>
<p>Additionally, the DT model is explored, which provides a transparent decision-making path through a tree-like structure of decisions and outcomes. Lastly, the SVM-RBF is investigated, renowned for its effectiveness in high-dimensional spaces and non-linear data separability. Each model offers unique perspectives and mechanisms for feature extraction and classification that allow for the assesment of their efficacy individually and collectively. This diversified methodology not only enhances the generalization of this study but also contributes novel insights into the robustness of ML applications to discern the integrity of news articles. As depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the process begins with data input and splitting into training, validation, and testing sets. TF-IDF embedding is used for feature extraction. Five models&#x2014;ANN, CNN, LSTM, DT, and SVM-RBF&#x2014;perform classification. Outputs are labeled as real or fake news based on evaluation metrics.</p>
<p>Artificial intelligence tools such as ChatGPT are used in a limited and responsible manner during the writing process of this work. The tools usage is used solely for enhancing the academic style and refining sentence structures. These tools did not contribute to the model design, data analysis, or interpretation of the obtained results. All the methodological decisions, experiments and scientific conclusions were made exclusively by the manuscript authors.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Dataset Understanding and Preprocessing</title>
<p>The Fake and Real News dataset [<xref ref-type="bibr" rid="ref-21">21</xref>] provides the necessary information to assess the integrity of news articles. The dataset is organized in .csv format and comprises two main classes: Fake and True datasets. The fake data contains 17,903 different values for the title class, while the true data has 20,826 unique values for the title class and 21,192 for the text class. <xref ref-type="fig" rid="fig-2">Fig. 2</xref> illustrates the frequency distribution of the fake and true class labels, indicating minimal differences between the two classes.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Category-wise distribution of news articles indicating a roughly balanced dataset for classification.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-2.tif"/>
</fig>
<p>The overall stability of the dataset is confirmed, with 52.3% of the data labeled as true and 47.7% as fake. Additionally, <xref ref-type="fig" rid="fig-3">Fig. 3</xref> presents the distribution of fake news across various subjects, showing that political news has the highest count of fake articles. It demonstrates that fake news articles tend to be longer in length compared to true articles. It is mainly in terms of word count for article titles. Differentiating between real and fake articles can be more challenging considering the main text field.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Subject distribution across news categories. The chart compares the number of fake (blue) and true (orange) articles across various subjects. Politics and world news dominate, while government and regional news have lower representation.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-3.tif"/>
</fig>
<sec id="s3_1_1">
<label>3.1.1</label>
<title>Exploratory Data Analysis and Visualization</title>
<p>Exploratory data analysis (EDA) is a critical first step in the data science workflow, bridging data collection and more sophisticated inferential or predictive analytics. In news classification, EDA is paramount as it unveils underlying structures, detects outliers, and extracts insightful patterns that can inform the direction of further analytical endeavors. Leveraging the vast informational expanse of the used dataset, which comprises 44,898 articles from critical periods in contemporary history, it is embarked on a journey to illuminate the multifaceted nature of news narratives. The mathematical underpinnings of the performed analysis are rooted in probability and statistics. By visualizing the frequency distribution of fake vs. true news, this not only quantify the prevalence of each category but also apply a visual lens to discern the symmetry, skewness, and kurtosis of data distribution. This forms the bedrock for hypothesis testing and ML models that follow, imbuing an analysis with robustness derived from mathematical rigour. A bar plot illustrates the dataset&#x2019;s overall fake and true news article distribution (<xref ref-type="fig" rid="fig-2">Fig. 2</xref>). This visualization is key to understanding each news type&#x2019;s relative balance and prevalence inside the corpus. The subject distribution among the articles was also analyzed. A bar plot captures the frequency of subjects for both fake and true news articles, providing insights into the topics that are more prevalent in one category over the other is shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>. <xref ref-type="fig" rid="fig-4">Fig. 4</xref> presents side-by-side word clouds for fake and true news, where subfigure 4a emphasizes sensationalism, while subfigure 4b highlights authenticity anchors in true reporting. These clouds give a quick qualitative sense of the rhetoric and language patterns that characterize both types of news. As demonstrated in <xref ref-type="fig" rid="fig-5">Fig. 5a</xref>, the distribution of title lengths across the corpus of news articles reveals a central tendency with a peak around 50&#x2013;60 characters, suggesting a common editorial preference.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Comparative word clouds illustrating linguistic patterns in (<bold>a</bold>) fake and (<bold>b</bold>) true news datasets.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Length distributions across the dataset: (<bold>a</bold>) titles and (<bold>b</bold>) full texts. Shorter lengths dominate, yet long-form tails persist, reflecting a balance between brevity and comprehensive coverage.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-5.tif"/>
</fig>
<p>The distribution&#x2019;s tail, extending towards longer title lengths, illustrates the diversity in title construction within the dataset. Understanding these patterns is crucial, as title length can influence reader engagement and reflect on the stylistic choices differentiating genuine news from disinformation. <xref ref-type="fig" rid="fig-5">Fig. 5b</xref> presents the distribution of text lengths within the used dataset, highlighting a solid preference for conciseness in news articles. The peak in the lower range of the histogram indicates that shorter articles are more prevalent, potentially reflecting editorial standards or reader engagement metrics that favour brevity. The long tail toward the higher length values suggests less frequent but more in-depth reporting in the dataset. Analyzing the length distribution helps in understanding the dataset&#x2019;s composition and can also serve as an indicator of content depth and complexity. Bar chart 2 showcases the balance between fake and true news articles within the dataset, providing a stark visual representation of their relative frequencies. Bar chart 3 illustrates the prevalence of subjects across fake and true news, highlighting thematic disparities and their correlation with news authenticity. It offers a concise overview of topic susceptibility to misinformation, enhancing the grasp of news dissemination dynamics.</p>
<p><xref ref-type="fig" rid="fig-5">Fig. 5</xref> presents side-by-side length distributions for titles and full texts. Subfigure 5a shows a pronounced tendency toward succinct titles designed to capture attention quickly; the Kernel Density Estimation (KDE) curve traces a smooth frequency profile that underscores this brevity while allowing for occasional longer titles to convey complex narratives. Subfigure 5b illustrates the broader variability in article body lengths. The distribution peaks at shorter texts and decays gradually, with the KDE highlighting concentration around median lengths and a long tail of in-depth reports. Together, these patterns reflect editorial strategies that balance readability and engagement with the need for comprehensive coverage.</p>
<p><xref ref-type="fig" rid="fig-6">Fig. 6</xref> summarizes corpus-level sentiment patterns for fake vs. true news (scores &#x2212;1 to &#x002B;1). The histogram shows fake articles clustering around mildly negative sentiment, while true news exhibits a wider, more balanced spread&#x2014;consistent with varied reporting tones. The boxplot reinforces this: fake news skews slightly negative, suggesting emotionally charged or sensational language, whereas true news spans neutral to positive and negative. These contrasts point to systematic emotional manipulation in fake content and offer cues for authenticity assessment. The analyses provide a compact baseline for subsequent pattern mining, leveraging conventional statistics with modern visualization to surface structure in the data.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Sentiment analysis of news articles.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-6.tif"/>
</fig>
</sec>
<sec id="s3_1_2">
<label>3.1.2</label>
<title>Tokenization</title>
<p>The dataset central to this investigation consists of a meticulously curated collection of news articles, each tagged with a &#x2018;fake&#x2019; or &#x2018;true&#x2019; label. These articles encompass a broad spectrum of topics meticulously selected to ensure equitable representation across categories. The preprocessing phase for model training involved steps such as tokenization, elimination of stop words, and data vectorization. This included applying the TF-IDF technique for feature representation. The authors in [<xref ref-type="bibr" rid="ref-22">22</xref>] capture the meaning of each term across the corpus, aiming to optimize the textual data for ML applications. The dataset was used in its complete form, comprising a distribution of &#x2018;fake&#x2019; and &#x2018;true&#x2019; articles, totalling 44,898 entries. While not perfectly equal, the dataset is sufficiently balanced to mitigate significant bias in model training and evaluation.</p>
</sec>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>TF-IDF Feature Extraction</title>
<p>This study employs a methodical method to explore detecting fake news on digital platforms using NLP techniques. News is collected from publicly available datasets, ensuring a balanced representation of fake and real news. Text preprocessing removes stopwords, punctuations, and irrelevant characters, followed by tokenization and stemming to standardize terms. TF-IDF is utilized to transform text data into numerical feature vectors, reflecting the importance of each term within the overall corpus. Term frequency emphasizes how often a word appears in a specific news article, while inverse document frequency downplays the impact of frequently occurring terms. The TF-IDF method quantifies a term&#x2019;s importance in a document relative to a corpus. Term Frequency (TF) measures the ratio of a term&#x2019;s count in a document to the total terms in that document. Inverse Document Frequency (IDF) is computed as <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>N</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>D</mml:mi><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, where <italic>N</italic> is the total number of documents, and <italic>DF</italic>(<italic>t</italic>) is the document frequency of the term. The TF-IDF score is calculated by multiplying TF with IDF, giving higher importance to words that appear frequently in a document but less commonly across the entire corpus. This generates a feature matrix that serves as input for training and evaluating classification models. To enhance model performance and minimize overfitting, hyperparameter tuning is applied. The study highlights the effectiveness of TF-IDF in uncovering unique patterns associated with the spread of fake news on social media platforms.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Classification and Taxonomy Modelling</title>
<p>An ANN is structured with layers of interconnected nodes resembling the neural networks in the human brain [<xref ref-type="bibr" rid="ref-23">23</xref>]. It consists of input (<italic>I</italic>), hidden (H), and output (O) layers. Activation functions introduce non-linearity, which is essential for learning complex patterns.
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>B</mml:mi></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref> represents the weighted sum, where <italic>W</italic><sub><italic>k</italic></sub> denotes the weight associated with the <italic>k</italic><sup>th</sup> input node <italic>I</italic><sub><italic>k</italic></sub>, and <italic>B</italic> is the bias term. The loss function calculates the Mean Squared Error (MSE) over n instances, comparing actual <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and predicted <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> outputs, guiding the network&#x2019;s training phase.</p>
<p>CNNs are built to handle data with a grid-like structure&#x2014;such as images or sequential text&#x2014;by learning spatial feature hierarchies through a series of layers, including convolutional, pooling (subsampling), activation, normalization, and fully connected layers [<xref ref-type="bibr" rid="ref-24">24</xref>,<xref ref-type="bibr" rid="ref-25">25</xref>]. Each layer plays a crucial role in the feature extraction and classification process. The convolutional layer is the core building block of a CNN. It applies a set of learnable filters to the input, activating certain features at certain spatial positions. In this experiment, CNNs are used to learn local patterns in the feature space via convolution over TF-IDF dimensions. Also, LSTMs operate on TF-IDF vectors as generic numerical inputs, meaning their gating and memory mechanisms do not exploit temporal dynamics, which explains their comparatively reduced advantage in this experimental configuration.
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:munderover><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:munderover><mml:mi>F</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>.</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref> details the convolution operation, where <italic>F</italic>(<italic>m</italic>, <italic>n</italic>) represents the filter kernel of size <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>M</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, and <italic>X</italic> is the input feature map. The result is a feature map <italic>G</italic> that emphasizes the presence of detected features in the input. Pooling layers reduce the dimensions of the data by combining the outputs of neuron clusters at one layer into a single neuron in the next layer.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mi>m</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>M</mml:mi><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi>n</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:munder><mml:mi>X</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>M</mml:mi><mml:mo>+</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>y</mml:mi><mml:mo>.</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> shows max pooling, where the maximum value over a <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mo stretchy="false">(</mml:mo><mml:mi>M</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> region is taken as the pooled output, effectively downsampling the feature map <italic>X</italic> to reduce its dimensions and allow the network to focus on the most prominent features. After the convolution operation, an activation function is applied to introduce non-linearity into the model, enabling it to capture and learn more intricate patterns. The Rectified Linear Unit (ReLU) activation function, which is commonly used due to its simplicity and efficiency. It replaces all negative pixel values in the feature map with zero. Normalization layers adjust and scale activations to speed up the training process and improve model generalization. Batch normalization is a widely used method.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mi>B</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03BC;</mml:mi></mml:mrow><mml:msqrt><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mtext>&#x03F5;</mml:mtext></mml:msqrt></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> describes batch normalization, where <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> are the mean and variance of a feature across a mini-batch, <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> and <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> are learnable parameters of scale and shift, and <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>&#x03F5;</mml:mi></mml:math></inline-formula> is a small constant to avoid division by zero. After several convolutional and pooling layers, the fully connected layer processes the high-level extracted features by flattening them into a vector format, enabling classification into distinct labels. In a fully connected layer, where <italic>W</italic> is the weight matrix, <italic>b</italic> is the bias vector, and <italic>x</italic> is the input vector. This layer combines all the learned features to make a final classification. Within a CNN, these layers operate collaboratively to carry out both feature extraction and classification, which makes CNNs particularly effective for applications like image recognition, natural language processing, and&#x2014;as applied in this study&#x2014;differentiating fake from real news articles by analyzing their content and stylistic elements.</p>
<p>LSTMs process sequences by retaining memories of previous inputs using gates [<xref ref-type="bibr" rid="ref-26">26</xref>]. These gates control the flow of information, making LSTMs adept at understanding time-series or sequential data.
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The forget gate <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref> decides the extent to which previous state <italic>H</italic><sub><italic>t</italic>&#x2212;1</sub> influences the current, with <italic>W</italic><sub><italic>f</italic></sub>, <italic>I</italic><sub><italic>t</italic></sub>, and <italic>B</italic><sub><italic>f</italic></sub> denoting the weight matrix, current input, and bias, respectively.
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-6">Eq. (6)</xref> represents the input gate, determining new information&#x2019;s incorporation into the cell state, with parameters analogous to <xref ref-type="disp-formula" rid="eqn-5">Eq. (5)</xref>.
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>C</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>The cell state update <xref ref-type="disp-formula" rid="eqn-7">Eq. (7)</xref> combines past state <italic>C</italic><sub><italic>t</italic>&#x2212;1</sub> and new information weighted by the forget <italic>g</italic><sub><italic>f</italic></sub> and input <italic>g</italic><sub><italic>i</italic></sub> gates&#x2019; outputs, enabling long-term dependency learning.
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:msub><mml:mi>H</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">]</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>B</mml:mi><mml:mrow><mml:mi>o</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-8">Eq. (8)</xref> details the output gate, which filters the information to be passed as the current output from the cell state, guided by weights <italic>W</italic><sub><italic>o</italic></sub> and bias <italic>B</italic><sub><italic>o</italic></sub>.</p>
<p>DTs implement a tree-like model of decisions, using branches to represent the decision paths and leaves to represent outcomes [<xref ref-type="bibr" rid="ref-27">27</xref>]. They classify instances by navigating through the branches based on feature values until reaching a leaf node corresponding to a decision outcome.
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>c</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>log</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-9">Eq. (9)</xref> defines the entropy of a set <italic>S</italic>, where <italic>p</italic><sub><italic>i</italic></sub> represents the proportion of the samples belonging to class <italic>i</italic> within <italic>S</italic>. Entropy quantifies the level of impurity or randomness in a dataset, serving as a key factor in directing the decision-making steps during tree construction.
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>I</mml:mi><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:munder><mml:mfrac><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo>|</mml:mo></mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>S</mml:mi><mml:mo>|</mml:mo></mml:mrow></mml:mfrac><mml:mi>H</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p>Information gain <xref ref-type="disp-formula" rid="eqn-10">Eq. (10)</xref> calculates the reduction in entropy or impurity due to splitting the set <italic>S</italic> on attribute <italic>A</italic>. Here, <italic>T</italic> represents the subsets formed from splitting <italic>S</italic> by <italic>A</italic>, and |<italic>S</italic><sub><italic>t</italic></sub>| is the size of subset <italic>t</italic>. Decision trees offer a transparent classification approach, allowing the decision path from root to leaf to be clearly followed and interpreted, which makes them well-suited for scenarios that demand clarity in decision-making [<xref ref-type="bibr" rid="ref-28">28</xref>].</p>
<p>SVMs with the RBF kernel are powerful tools for classifying data that is not linearly separable in the input space [<xref ref-type="bibr" rid="ref-29">29</xref>]. They transform the data into a higher-dimensional space in which it becomes linearly separable.
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>z</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The RBF kernel <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref> facilitates this projection, where <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> is a parameter that determines the spread of the kernel and hence the decision boundary&#x2019;s complexity, <italic>x</italic> and <italic>z</italic> are input feature vectors.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>w</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mi>C</mml:mi><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-12">Eq. (12)</xref> outlines the objective function of SVM optimization, aiming to minimize the margin&#x2019;s width <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msup><mml:mrow><mml:mo symmetric="true">&#x2016;</mml:mo><mml:mi>w</mml:mi><mml:mo symmetric="true">&#x2016;</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> and the penalty term <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:msub><mml:mi>&#x03BE;</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> for misclassified points, controlled by the parameter <italic>C</italic>. SVM with RBF kernel is highly effective in high-dimensional spaces, making it a robust classifier for text and image data where linear separability cannot be assumed.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experimental Hypothesis and Setup</title>
<p>Based on the assumption that advanced ML models&#x2014;particularly CNNs and LSTMs&#x2014;are capable of accurately distinguishing between fake and real news articles, this study investigates the subtle textual differences that define each category. It is hypothesized that these models can effectively identify and leverage the differential patterns, stylistic features, and thematic disparities between fake and true news articles for classification purposes. Methodical experimental approach is done by using a diverse set of ML models, specifically ANN, CNN, LSTM, DT, and SVM-RBF, which were trained on the refined data set. Each model&#x2019;s detailed parameters and architectural specifications are elaborated in <xref ref-type="table" rid="table-1">Table 1</xref>, with selections informed by extensive preliminary tuning to optimize performance. Then employing a standard hold-out strategy, the dataset was partitioned into training (80%) and testing (20%) subsets. This partition facilitates an assessment of the models&#x2019; capacity for generalization to novel data. Finally the effectiveness of each model in correctly classifying news articles was measured using evaluation metrics including accuracy, precision, recall, and F1 score, providing a comprehensive perspective on overall performance.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Detailed parameters and architecture specifics of the models utilized in the experiment. For deep learning models (ANN, CNN, LSTM), the Adam optimizer was used with a learning rate of 0.001 and categorical cross-entropy loss.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Model</th>
<th>Parameters</th>
<th>Architecture or Layers</th>
</tr>
</thead>
<tbody>
<tr>
<td>ANN</td>
<td>Epochs: 100, Batch: 32, Dropout: 0.5</td>
<td>Input(TF-IDF Vector), Dense(128, ReLU), Dense(64, ReLU), Output(Sigmoid)</td>
</tr>
<tr>
<td>CNN</td>
<td>Filter: 128, Kernel: 5, Pool: 2</td>
<td>Conv1D(128), MaxPool(2), Conv1D(64), GlobalMaxPool, Dense(1)</td>
</tr>
<tr>
<td>LSTM</td>
<td>Units: 100, Dropout: 0.2</td>
<td>LSTM(100), Dense(50, ReLU), Dense(1, Sigmoid)</td>
</tr>
<tr>
<td>DT</td>
<td>Criterion: Gini, Splitter: Best</td>
<td>Max Depth: None, Min Samples Split: 2</td>
</tr>
<tr>
<td>SVM-RBF</td>
<td>C: 1.0, Gamma: Scale</td>
<td>Kernel: RBF, Tolerance: 0.001</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><bold><italic>Hypotheses Testing and Statistical Significance Analysis</italic></bold></p>
<p>This section outlines the suggested approach to statistically analyze the classification accuracies of the used ML models (ANN, CNN, LSTM, DT, SVM-RBF) over multiple runs. The aim is to identify whether significant differences exist not only between individual pairs of models but also in a one-to-many comparison fashion, assessing each model against the collective performance of others. To evaluate the performance differences between each pair of models, a series of paired <italic>t</italic>-tests [<xref ref-type="bibr" rid="ref-30">30</xref>] is employed. This method allows us to compare the mean accuracy scores of two models over 20 runs, assuming paired observations are normally distributed. A significant t-statistic, determined against the critical t-value from the t-distribution table at <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>, suggests a significant difference in the performance of the two compared models. For a broader comparison of each model&#x2019;s performance against the collective performance of others, the Bonferroni-adjusted ANOVA test [<xref ref-type="bibr" rid="ref-31">31</xref>] is utilized. This adjustment is crucial to maintain the overall Type I error rate while conducting multiple comparisons. The ANOVA test was adjusted for multiple comparisons, with the Bonferroni correction factor applied to the significance level <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>. The F-statistic is calculated then compared against the critical F-value from the F-distribution table at a predetermined significance level (usually <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>). A significant F-statistic (exceeding the critical F-value) suggests that at least one model&#x2019;s mean accuracy is significantly different from the others, warranting rejection of H<sub>0</sub>. Given a significant ANOVA result, a post-hoc analysis is conducted to pinpoint which specific models&#x2019; means differ significantly. The Tukey&#x2019;s HSD test [<xref ref-type="bibr" rid="ref-32">32</xref>] is employed for this purpose, offering a pairwise comparison among the models&#x2019; accuracy means while controlling for the Type I error rate. Models with a mean difference exceeding the HSD value are considered to have significantly different accuracies, confirming H<sub>1</sub> for those models. The application of the ANOVA test, followed by Tukey&#x2019;s HSD post-hoc analysis, facilitates a comprehensive understanding of the comparative performance landscape of these ML models in the task of news classification. This statistical framework underscores a commitment to rigour and precision in validating advanced ML techniques for enhancing media integrity and information verification processes. Following identifying significant differences via the adjusted ANOVA test, proceeding with a post-hoc analysis using Tukey&#x2019;s HSD test to ascertain specific models that differ in performance. The combination of paired <italic>t</italic>-tests for individual model comparisons, alongside a Bonferroni-adjusted ANOVA for a comprehensive assessment, ensures a thorough statistical examination of the used ML models&#x2019; efficacy in classifying news articles. By systematically analyzing performance disparities, this multifaceted statistical approach aims to validate the effectiveness of advanced ML techniques in distinguishing between fake and true news, thereby offering potent tools for media verification and integrity. The ANOVA test is chosen due to its effectiveness in identifying differences in group means in scenarios involving multiple groups.</p>
<p>As detailed in <xref ref-type="table" rid="table-1">Table 1</xref>, the model parameters and architectural nuances are pivotal in contextualizing the experimental findings. The systematic selection of model configurations directly influences the robustness of the classification outcomes. The experimental setup and model training were conducted within a robust computational environment designed to support the intensive processing demands of ML workflows. This section outlines the technical specifications and software stack to facilitate the research. The implementation and testing of ML models were supported by comprehensive hardware, software tools, and libraries. Where the machine learning models were trained using a batch size of 32 and an initial learning rate of 0.001, which was dynamically adjusted via a scheduler based on validation loss. Training proceeded for a maximum of 100 epochs, with early stopping applied based on validation accuracy to mitigate overfitting. Training time varied by model complexity, with CNN and LSTM architectures requiring roughly 2&#x2013;3 h on the designated GPU hardware. The dataset was randomly partitioned into 80% for training and 20% for testing, maintaining a stratified label distribution across both subsets. Model performance was assessed through a hold-out validation strategy, using test set metrics to evaluate generalizability. All experiments were executed in a controlled environment to ensure consistent and reproducible outcomes.</p>

</sec>
<sec id="s5">
<label>5</label>
<title>Experimental Findings Analysis and Discussion</title>
<p>In this research, an in-depth evaluation is performed to assess the effectiveness of five distinct models: ANN, CNN, LSTMs, DTs, and SVM-RBF. Each model underwent 20 independent training and evaluation runs to ensure a robust assessment of its performance. The accuracy metric was recorded for each run, providing a basis for the subsequent statistical analysis. The obtained findings reveal distinct performance characteristics across the models, with ANN and CNN models demonstrating exceptional capability in classifying news articles. The LSTM model, while slightly less accurate, showcased its proficiency in handling feature-rich data, a critical attribute for text-based tasks. In contrast, the classical ML models, DT and SVM-RBF, lagged in performance, underscoring the challenges these models face with complex, high-dimensional datasets. The experimental runs yielded the following mean accuracies with their corresponding standard deviations (SD) over 20 iterations as summarized in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>. The bar chart reports mean <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mo>&#x00B1;</mml:mo><mml:mrow><mml:mtext>SD</mml:mtext></mml:mrow></mml:math></inline-formula> for each model (ANN, CNN, LSTM, DT, and SVM&#x2013;RBF), highlighting the comparative performance across architectures.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Model performance over 20 runs: mean accuracy (%) with error bars showing standard deviation for ANN, CNN, LSTM, DT, and SVM&#x2013;RBF.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_76156-fig-7.tif"/>
</fig>
<p>The analysis was started with an ANOVA test to confirm whether the observed model performance differences were statistically significant. This test returned an F-statistic of 2981.91 and a <italic>p</italic>-value less than 0.001. It demonstrates significant differences in model accuracies. The result necessitated additional exploration through post-hoc analysis to identify the specific models among differences that occurred. Using Tukey&#x2019;s HSD test for pairwise comparison of model accuracies. Differences were significant, as shown in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Summary of Tukey&#x2019;s HSD test for pairwise model comparison.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Comparison</th>
<th>Mean Diff.</th>
<th><italic>p</italic>-adj</th>
<th>Confidence Interval</th>
<th>Reject Null?</th>
</tr>
</thead>
<tbody>
<tr>
<td>ANN vs. CNN</td>
<td>0.0</td>
<td>1.000</td>
<td>[&#x2212;0.0045, 0.0045]</td>
<td>No</td>
</tr>
<tr>
<td>ANN vs. DT</td>
<td>&#x2212;0.1345</td>
<td>0.000</td>
<td>[&#x2212;0.139, &#x2212;0.13]</td>
<td>Yes</td>
</tr>
<tr>
<td>ANN vs. LSTM</td>
<td>&#x2212;0.0054</td>
<td>0.0106</td>
<td>[&#x2212;0.0099, &#x2212;0.0009]</td>
<td>Yes</td>
</tr>
<tr>
<td>ANN vs. SVM-RBF</td>
<td>&#x2212;0.089</td>
<td>0.000</td>
<td>[&#x2212;0.0935, &#x2212;0.0846]</td>
<td>Yes</td>
</tr>
<tr>
<td>CNN vs. DT</td>
<td>&#x2212;0.1345</td>
<td>0.000</td>
<td>[&#x2212;0.139, &#x2212;0.13]</td>
<td>Yes</td>
</tr>
<tr>
<td>CNN vs. LSTM</td>
<td>&#x2212;0.0054</td>
<td>0.0106</td>
<td>[&#x2212;0.0099, &#x2212;0.0009]</td>
<td>Yes</td>
</tr>
<tr>
<td>CNN vs. SVM-RBF</td>
<td>&#x2212;0.089</td>
<td>0.000</td>
<td>[&#x2212;0.0935, &#x2212;0.0846]</td>
<td>Yes</td>
</tr>
<tr>
<td>DT vs. LSTM</td>
<td>0.1292</td>
<td>0.000</td>
<td>[0.1247, 0.1336]</td>
<td>Yes</td>
</tr>
<tr>
<td>DT vs. SVM-RBF</td>
<td>0.0455</td>
<td>0.000</td>
<td>[0.041, 0.05]</td>
<td>Yes</td>
</tr>
<tr>
<td>LSTM vs. SVM-RBF</td>
<td>&#x2212;0.0837</td>
<td>0.000</td>
<td>[&#x2212;0.0882, &#x2212;0.0792]</td>
<td>Yes</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>There is no significant performance difference between ANN and CNNs. In contrast, the notable performance differences between these previous models and LSTM, DT, and SVM-RBF indicate that ANN and CNN are more efficient. Importantly, the decision tree model exhibited the weakest performance, and SVM-RBF also underperformed compared to LSTM. It highlights LSTM&#x2019;s robustness in capturing data dependencies, even though its performance is slightly lower than that of ANN and CNN when utilizing TF-IDF features, which lack explicit sequential time-steps. The comparable effectiveness of both ANN and CNN models suggests that tasks involving complex pattern recognition or high-dimensional data processing could greatly benefit from these architectures. Furthermore, the low performance of LSTM, relative to ANN and CNN, may indicate a trade-off between capturing temporal dependencies and overall predictive accuracy when the input representation is non-sequential. The trade-off is important, particularly in applications where model complexity and training time are significant factors. The classical models, such as DT and SVM-RBF, may not perform as well as CNN and ANN models. The variation in model performance highlights the necessity of choosing a model that aligns with the specific requirements. <xref ref-type="table" rid="table-3">Table 3</xref> compares with other related studies with various data.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Comparison of proposed framework accuracy vs. state of the art.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Ref.</th>
<th>Dataset</th>
<th>Methods</th>
<th>Benchmark (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td>[<xref ref-type="bibr" rid="ref-33">33</xref>]</td>
<td>WELFAKE</td>
<td>TF&#x2013;IDF with BNB</td>
<td>90</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-34">34</xref>]</td>
<td>ISOT</td>
<td>ML Algorithms</td>
<td>96.36</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-35">35</xref>]</td>
<td>WELFAKE</td>
<td>BERT &#x002B; Bi-LSTM</td>
<td>98.1</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-36">36</xref>]</td>
<td>Kaggle</td>
<td>SVM</td>
<td>&#x003E;90</td>
</tr>
<tr>
<td>[<xref ref-type="bibr" rid="ref-37">37</xref>]</td>
<td>Kaggle</td>
<td>BERT with MBIC</td>
<td>98.69</td>
</tr>
<tr>
<td><bold>Ours</bold></td>
<td><bold>Kaggle</bold></td>
<td><bold>TF&#x2013;IDF with ANN, CNN</bold></td>
<td><bold>99.13</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion and Future Work</title>
<p>This study set out to tackle a contemporary challenge in digital news verification by employing various machine learning models to distinguish between genuine and fabricated news headlines. Through careful experimentation and thorough data analysis, the presented study demonstrates that AI can effectively enhance the media&#x2019;s credibility. The results indicate that CNN and ANN achieve the highest accuracy of 99.13%. Crucially, this study validates these findings through extensive statistical testing, including ANOVA and Tukey&#x2019;s HSD analysis across 20 independent runs. This rigorous evaluation confirms that deep learning architectures significantly outperform classical baselines (such as DT and SVM-RBF) in capturing intricate textual patterns, proving their efficacy even when utilizing standard high-dimensional features like TF-IDF. The superior performance of the ANN and CNN models highlights the increasing significance of neural networks in text classification tasks where robust feature mapping is required. The outcomes of this research hold value beyond the academic realm, offering tangible benefits for journalists, media outlets, and providers of IT solutions. With the predictive capabilities of CNN and LSTM, media stakeholders can implement automated systems to efficiently scan large volumes of news content and identify any spam articles. Technological advancement is crucial for ensuring the prevalence of factual reporting worldwide and fostering informed public discourse. However, while this work represents a significant advancement, it is important to recognize its limitations. The exceptionally high accuracy observed in this study may be partially attributed to the specific linguistic characteristics of the dataset, where fake news often exhibits distinct lexical patterns distinguishable by TF-IDF. Misinformation tactics are becoming increasingly sophisticated, and language constantly evolves, necessitating regular updates to machine learning models and validation across more diverse datasets to prevent overfitting. In the future, the features of news content could be enhanced by incorporating more multimodal data, such as images and videos, to improve the effectiveness of fake news detection systems. Additionally, exploring transfer and unsupervised learning approaches offers significant potential for advancing the automated understanding and classification of news content. The present research can be extended into a critical area of digital journalism that focuses on optimizing machine learning in the increasingly complex landscape of journalistic practice. As a society situated at the intersection of media and technology, the study highlights the advancements made in this domain while emphasizing the need for greater collaboration to push the boundaries of AI while preserving the credibility of news.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to thank the Deanship of Scientific Research at Shaqra University for supporting this work. Also, the authors acknowledge the use of AI language assistance tools for improving the academic presentation and readability of the manuscript.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>The authors received no specific funding for this study.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Raed Alotaibi, writing and visualization; Muhammad Atta Othman Ahmed, conceptualization, software, writing and preparation; Omar Reyad, idea proposal, review and editing and supervision; Nahla Fathy Omran, data curation and investigation. All authors reviewed and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The dataset file that supports the findings of this work is publicly available as indicated in the references.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alghamdi</surname> <given-names>J</given-names></string-name>, <string-name><surname>Luo</surname> <given-names>S</given-names></string-name>, <string-name><surname>Lin</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>A comprehensive survey on machine learning approaches for fake news detection</article-title>. <source>Multimed Tools Appl</source>. <year>2024</year>;<volume>83</volume>(<issue>17</issue>):<fpage>51009</fpage>&#x2013;<lpage>67</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11042-023-17470-8</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bertini</surname> <given-names>F</given-names></string-name>, <string-name><surname>Benetton</surname> <given-names>A</given-names></string-name>, <string-name><surname>Montesi</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Ensuring news integrity against online information disorder through text watermarking and blockchain</article-title>. <source>Blockchain Res Appl</source>. <year>2025</year>:<fpage>100414</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.bcra.2025.100414</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ali</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Latif</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ghauri</surname> <given-names>SA</given-names></string-name>, <string-name><surname>Song</surname> <given-names>OY</given-names></string-name>, <string-name><surname>Abbasi</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Malik</surname> <given-names>AJ</given-names></string-name></person-group>. <article-title>Linguistic features and Bi-LSTM for identification of fake news</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>13</issue>):<fpage>2942</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12132942</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Olan</surname> <given-names>F</given-names></string-name>, <string-name><surname>Jayawickrama</surname> <given-names>U</given-names></string-name>, <string-name><surname>Arakpogun</surname> <given-names>EO</given-names></string-name>, <string-name><surname>Suklan</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Fake news on social media: the impact on society</article-title>. <source>Inf Syst Front</source>. <year>2024</year>;<volume>26</volume>(<issue>2</issue>):<fpage>443</fpage>&#x2013;<lpage>58</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10796-022-10242-z</pub-id>; <pub-id pub-id-type="pmid">35068999</pub-id></mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lv</surname> <given-names>J</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>L</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>L</given-names></string-name>, <string-name><surname>Li</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Multi-modal fake news detection: a comprehensive survey on deep learning technology, advances, and challenges</article-title>. <source>J King Saud Univ Comput Inf Sci</source>. <year>2025</year>;<volume>37</volume>(<issue>9</issue>):<fpage>306</fpage>. doi:<pub-id pub-id-type="doi">10.1007/s44443-025-00317-7</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Harris</surname> <given-names>S</given-names></string-name>, <string-name><surname>Hadi</surname> <given-names>HJ</given-names></string-name>, <string-name><surname>Ahmad</surname> <given-names>N</given-names></string-name>, <string-name><surname>Ali Alshara</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Multi-domain Urdu fake news detection using pre-trained ensemble model</article-title>. <source>Sci Rep</source>. <year>2025</year>;<volume>15</volume>(<issue>1</issue>):<fpage>8705</fpage>. doi:<pub-id pub-id-type="doi">10.1038/s41598-025-91054-4</pub-id>; <pub-id pub-id-type="pmid">40082485</pub-id></mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Vural</surname> <given-names>NE</given-names></string-name>, <string-name><surname>Kalaman</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Using artificial intelligence systems in news verification: an application on X</article-title>. <source>&#x0130;leti&#x015F;im Kuram Ve Ara&#x015F;t&#x0131;rma Dergisi</source>. <year>2024</year>;<volume>67</volume>:<fpage>127</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.47998/ikad.1466830</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Jouhar</surname> <given-names>J</given-names></string-name>, <string-name><surname>Pratap</surname> <given-names>A</given-names></string-name>, <string-name><surname>Tijo</surname> <given-names>N</given-names></string-name>, <string-name><surname>Mony</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Fake news detection using python and machine learning</article-title>. In: <conf-name>Proceedings of the 5th International Conference on Innovative Data Communication Technologies and Application (ICIDCA 2024); 2024 Jan 10&#x2013;11</conf-name>; <publisher-loc>Coimbatore, India</publisher-loc>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sonni</surname> <given-names>AF</given-names></string-name>, <string-name><surname>Hafied</surname> <given-names>H</given-names></string-name>, <string-name><surname>Irwanto</surname> <given-names>I</given-names></string-name>, <string-name><surname>Latuheru</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Digital newsroom transformation: a systematic review of the impact of artificial intelligence on journalistic practices, news narratives, and ethical challenges</article-title>. <source>J Medium</source>. <year>2024</year>;<volume>5</volume>(<issue>4</issue>):<fpage>1554</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.3390/journalmedia5040097</pub-id>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alshuwaier</surname> <given-names>FA</given-names></string-name>, <string-name><surname>Alsulaiman</surname> <given-names>FA</given-names></string-name></person-group>. <article-title>Fake news detection using machine learning and deep learning algorithms: a comprehensive review and future perspectives</article-title>. <source>Computers</source>. <year>2025</year>;<volume>14</volume>(<issue>9</issue>):<fpage>394</fpage>. doi:<pub-id pub-id-type="doi">10.3390/computers14090394</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Jiang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>T</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>M</given-names></string-name></person-group>. <article-title>ZoFia: zero-shot fake news detection with entity-guided retrieval and multi-LLM interaction</article-title>. <comment>arXiv:2511.01188. 2025</comment>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khedairia</surname> <given-names>S</given-names></string-name>, <string-name><surname>Bennour</surname> <given-names>A</given-names></string-name>, <string-name><surname>Nahas</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chefrour</surname> <given-names>A</given-names></string-name>, <string-name><surname>Marie</surname> <given-names>RR</given-names></string-name>, <string-name><surname>Al-Sarem</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A co-attention mechanism into a combined GNN-based model for fake news detection</article-title>. <source>Comput Mater Contin</source>. <year>2025</year>;<volume>85</volume>(<issue>1</issue>):<fpage>1267</fpage>&#x2013;<lpage>85</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2025.066601</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Tajrian</surname> <given-names>M</given-names></string-name>, <string-name><surname>Rahman</surname> <given-names>A</given-names></string-name>, <string-name><surname>Kabir</surname> <given-names>MA</given-names></string-name>, <string-name><surname>Islam</surname> <given-names>MR</given-names></string-name></person-group>. <article-title>A review of methodologies for fake news analysis</article-title>. <source>IEEE Access</source>. <year>2023</year>;<volume>11</volume>:<fpage>73879</fpage>&#x2013;<lpage>93</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3294989</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Zhou</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zafarani</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A survey of fake news: fundamental theories, detection methods, and opportunities</article-title>. <comment>arXiv: 1812.00315. 2018</comment>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hasib</surname> <given-names>KM</given-names></string-name>, <string-name><surname>Towhid</surname> <given-names>NA</given-names></string-name>, <string-name><surname>Faruk</surname> <given-names>KO</given-names></string-name>, <string-name><surname>Al Mahmud</surname> <given-names>J</given-names></string-name>, <string-name><surname>Mridha</surname> <given-names>MF</given-names></string-name></person-group>. <article-title>Strategies for enhancing the performance of news article classification in Bangla: handling imbalance and interpretation</article-title>. <source>Eng Appl Artif Intell</source>. <year>2023</year>;<volume>125</volume>:<fpage>106688</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.engappai.2023.106688</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ahmed</surname> <given-names>J</given-names></string-name>, <string-name><surname>Ahmed</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Classification, detection and sentiment analysis using machine learning over next generation communication platforms</article-title>. <source>Microprocess Microsyst</source>. <year>2023</year>;<volume>98</volume>:<fpage>104795</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.micpro.2023.104795</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ansari</surname> <given-names>MIH</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>K</given-names></string-name></person-group>. <article-title>A fake news classification and identification model based on machine learning approach</article-title>. In: <conf-name>Proceedings of the Information and Communication Technology for Competitive Strategies (ICTCS 2022); 2022 Dec 9&#x2013;10</conf-name>; <publisher-loc>Chandigarh, India. Singapore</publisher-loc>: <publisher-name>Springer Nature</publisher-name>; <year>2023</year>. p. <fpage>473</fpage>&#x2013;<lpage>84</lpage>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mishra</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sadia</surname> <given-names>H</given-names></string-name></person-group>. <article-title>A comprehensive analysis of fake news detection models: a systematic literature review and current challenges</article-title>. <source>Eng Proc</source>. <year>2023</year>;<volume>59</volume>(<issue>1</issue>):<fpage>28</fpage>. doi:<pub-id pub-id-type="doi">10.3390/engproc2023059028</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Vaswani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shazeer</surname> <given-names>N</given-names></string-name>, <string-name><surname>Parmar</surname> <given-names>N</given-names></string-name>, <string-name><surname>Uszkoreit</surname> <given-names>J</given-names></string-name>, <string-name><surname>Jones</surname> <given-names>L</given-names></string-name>, <string-name><surname>Gomez</surname> <given-names>AN</given-names></string-name>, <etal>et al.</etal></person-group> <chapter-title>Attention is all you need</chapter-title>. In: <source>Advances in neural information processing systems</source>. <publisher-loc>Red Hook, NY, USA</publisher-loc>: <publisher-name>Curran Associates, Inc</publisher-name>.; <year>2017</year>. p. <fpage>5998</fpage>&#x2013;<lpage>6008</lpage>. doi:<pub-id pub-id-type="doi">10.65215/2q58a426</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Devlin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Chang</surname> <given-names>MW</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>K</given-names></string-name>, <string-name><surname>Toutanova</surname> <given-names>K</given-names></string-name></person-group>. <article-title>BERT: pre-training of deep bidirectional transformers for language understanding</article-title>. In: <conf-name>Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers); 2019 Jun 2&#x2013;7</conf-name>; <publisher-loc>Minneapolis, MN, USA</publisher-loc>. p. <fpage>4171</fpage>&#x2013;<lpage>86</lpage>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><surname>Bisaillon</surname> <given-names>C</given-names></string-name></person-group>. <article-title>Fake and real news dataset</article-title>. <comment>2019[cited 2025 Jan 1]</comment>. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/clmentbisaillon/fake-and-real-news-dataset">https://www.kaggle.com/datasets/clmentbisaillon/fake-and-real-news-dataset</ext-link>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>CH</given-names></string-name>, <string-name><surname>Yin</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>F</given-names></string-name></person-group>. <article-title>A text similarity measurement combining word semantic information with TF-IDF method: a text similarity measurement combining word semantic information with TF-IDF method</article-title>. <source>Chin J Comput</source>. <year>2011</year>;<volume>34</volume>(<issue>5</issue>):<fpage>856</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.3724/sp.j.1016.2011.00856</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Okwu</surname> <given-names>MO</given-names></string-name>, <string-name><surname>Tartibu</surname> <given-names>LK</given-names></string-name></person-group>. <source>Metaheuristic optimization: nature-inspired algorithms swarm and computational intelligence, theory and applications</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>; <year>2021</year>. p. <fpage>133</fpage>&#x2013;<lpage>45</lpage>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>El-Rahiem</surname> <given-names>BA</given-names></string-name>, <string-name><surname>Ahmed</surname> <given-names>MAO</given-names></string-name>, <string-name><surname>Reyad</surname> <given-names>O</given-names></string-name>, <string-name><surname>El-Rahaman</surname> <given-names>HA</given-names></string-name>, <string-name><surname>Amin</surname> <given-names>M</given-names></string-name>, <string-name><surname>El-Samie</surname> <given-names>FA</given-names></string-name></person-group>. <article-title>An efficient deep convolutional neural network for visual image classification</article-title>. In: <conf-name>Proceedings of the International Conference on Advanced Machine Learning Technologies and Applications (AMLTA2019); 2019 Mar 28&#x2013;30</conf-name>; <publisher-loc>Cairo, Egypt. Cham, Switzerland</publisher-loc>: <publisher-name>Springer International Publishing</publisher-name>; <year>2019</year>. p. <fpage>23</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Sohail</surname> <given-names>A</given-names></string-name>, <string-name><surname>Zahoora</surname> <given-names>U</given-names></string-name>, <string-name><surname>Qureshi</surname> <given-names>AS</given-names></string-name></person-group>. <article-title>A survey of the recent architectures of deep convolutional neural networks</article-title>. <source>Artif Intell Rev</source>. <year>2020</year>;<volume>53</volume>(<issue>8</issue>):<fpage>5455</fpage>&#x2013;<lpage>516</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10462-020-09825-6</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Si</surname> <given-names>X</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A review of recurrent neural networks: LSTM cells and network architectures</article-title>. <source>Neural Comput</source>. <year>2019</year>;<volume>31</volume>(<issue>7</issue>):<fpage>1235</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.1162/neco_a_01199</pub-id>; <pub-id pub-id-type="pmid">31113301</pub-id></mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Costa</surname> <given-names>VG</given-names></string-name>, <string-name><surname>Pedreira</surname> <given-names>CE</given-names></string-name></person-group>. <article-title>Recent advances in decision trees: an updated survey</article-title>. <source>Artif Intell Rev</source>. <year>2023</year>;<volume>56</volume>(<issue>5</issue>):<fpage>4765</fpage>&#x2013;<lpage>800</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10462-022-10275-5</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Krishna</surname> <given-names>NLSR</given-names></string-name>, <string-name><surname>Adimoolam</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Fake news detection system using decision tree algorithm and compare textual property with support vector machine algorithm</article-title>. In: <conf-name>Proceedings of the 2022 International Conference on Business Analytics for Technology and Security (ICBATS); 2022 Feb 16&#x2013;17</conf-name>; <publisher-loc>Dubai, United Arab Emirates</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Hu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>B</given-names></string-name></person-group>. <article-title>Deep learning for fake news detection: a comprehensive survey</article-title>. <source>AI Open</source>. <year>2022</year>;<volume>3</volume>:<fpage>133</fpage>&#x2013;<lpage>55</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.aiopen.2022.09.001</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Al-Mutair</surname> <given-names>H</given-names></string-name>, <string-name><surname>Berri</surname> <given-names>J</given-names></string-name></person-group>. <article-title>MSDSI-FND: multi-stage detection model of influential users&#x2019; fake news in online social networks</article-title>. <source>Computers</source>. <year>2025</year>;<volume>14</volume>(<issue>12</issue>):<fpage>517</fpage>. doi:<pub-id pub-id-type="doi">10.3390/computers14120517</pub-id>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cabin</surname> <given-names>RJ</given-names></string-name>, <string-name><surname>Mitchell</surname> <given-names>RJ</given-names></string-name></person-group>. <article-title>To bonferroni or not to bonferroni: when and how are the questions</article-title>. <source>Bull Ecol Soc Am</source>. <year>2000</year>;<volume>81</volume>(<issue>3</issue>):<fpage>246</fpage>&#x2013;<lpage>8</lpage>. doi:<pub-id pub-id-type="doi">10.1016/0197-2456(88)90095-5</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdi</surname> <given-names>H</given-names></string-name>, <string-name><surname>Williams</surname> <given-names>LJ</given-names></string-name></person-group>. <article-title>Tukey&#x2019;s honestly significant difference (HSD) test</article-title>. <source>Encycl Res Des</source>. <year>2010</year>;<volume>3</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>5</lpage>. doi:<pub-id pub-id-type="doi">10.4135/9781412961288.n181</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Mohsen</surname> <given-names>F</given-names></string-name>, <string-name><surname>Chaushi</surname> <given-names>B</given-names></string-name>, <string-name><surname>Abdelhaq</surname> <given-names>H</given-names></string-name>, <string-name><surname>Karastoyanova</surname> <given-names>D</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>K</given-names></string-name></person-group>. <article-title>Automated detection of misinformation: a hybrid approach for fake news detection</article-title>. <source>Future Internet</source>. <year>2024</year>;<volume>16</volume>(<issue>10</issue>):<fpage>352</fpage>. doi:<pub-id pub-id-type="doi">10.3390/fi16100352</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ribeiro Bezerra</surname> <given-names>JF</given-names></string-name></person-group>. <article-title>Content-based fake news classification through modified voting ensemble</article-title>. <source>J Inf Telecommun</source>. <year>2021</year>;<volume>5</volume>(<issue>4</issue>):<fpage>499</fpage>&#x2013;<lpage>513</lpage>. doi:<pub-id pub-id-type="doi">10.1080/24751839.2021.1963912</pub-id>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Al-Quayed</surname> <given-names>F</given-names></string-name>, <string-name><surname>Javed</surname> <given-names>D</given-names></string-name>, <string-name><surname>Jhanjhi</surname> <given-names>NZ</given-names></string-name>, <string-name><surname>Humayun</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alnusairi</surname> <given-names>TS</given-names></string-name></person-group>. <article-title>A hybrid transformer-based model for optimizing fake news detection</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>:<fpage>160822</fpage>&#x2013;<lpage>34</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2024.3476432</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wierzbicki</surname> <given-names>A</given-names></string-name>, <string-name><surname>Shupta</surname> <given-names>A</given-names></string-name>, <string-name><surname>Barmak</surname> <given-names>O</given-names></string-name></person-group>. <article-title>Synthesis of model features for fake news detection using large language models</article-title>. In: <conf-name>Proceedings of the Computational Linguistics Workshop at 8th International Conference on Computational Linguistics and Intelligent Systems (CoLInS-2024); 2024 Apr 12&#x2013;13</conf-name>; <publisher-loc>Lviv, Ukraine</publisher-loc>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Kasampalis</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chatzakou</surname> <given-names>D</given-names></string-name>, <string-name><surname>Tsikrika</surname> <given-names>T</given-names></string-name>, <string-name><surname>Vrochidis</surname> <given-names>S</given-names></string-name>, <string-name><surname>Kompatsiaris</surname> <given-names>I</given-names></string-name></person-group>. <chapter-title>Bias detection and mitigation in textual data: a study on fake news and hate speech detection</chapter-title>. In: <source>Advances in information retrieval</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer Nature</publisher-name>; <year>2024</year>. p. <fpage>374</fpage>&#x2013;<lpage>83</lpage>. doi:<pub-id pub-id-type="doi">10.1007/978-3-031-56063-7_29</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>