<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    sn
   </journal-id>
   <journal-title-group>
    <journal-title>
     Social Networking
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2169-3285
   </issn>
   <issn publication-format="print">
    2169-3323
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/sn.2025.142002
   </article-id>
   <article-id pub-id-type="publisher-id">
    sn-142851
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Computer Science 
     </subject>
     <subject>
       Communications
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    A Review of Methods for Detecting Rumors on Social Networks Using Social Circle Mining
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Alaa
      </surname>
      <given-names>
       Alassaf
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Delel
      </surname>
      <given-names>
       Rhouma
      </given-names>
     </name> 
     <xref ref-type="aff" rid="aff1"> 
      <sup>1</sup>
     </xref> 
     <xref ref-type="aff" rid="aff2"> 
      <sup>2</sup>
     </xref>
    </contrib>
   </contrib-group> 
   <aff id="aff1">
    <addr-line>
     aDepartment of Computer Science, College of Computer, Qassim University, Buraydah, Saudi Arabia
    </addr-line> 
   </aff> 
   <aff id="aff2">
    <addr-line>
     aMARS Research Laboratory LR17ES05, University of Sousse, Sousse, Tunisia
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     27
    </day> 
    <month>
     05
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    14
   </volume> 
   <issue>
    02
   </issue>
   <fpage>
    15
   </fpage>
   <lpage>
    44
   </lpage>
   <history>
    <date date-type="received">
     <day>
      21,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      27,
     </day>
     <month>
      March
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      27,
     </day>
     <month>
      April
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Currently, social platforms provide places for people not only to gather information but also to generate and propagate rumors. Consequently, rumor detection has become a major global task for mining fake information from social networks. Although social circles have the capacity to describe users’ behavior preferences and to impact the scope and spreading speed of rumors, numerous studies have ignored them when designing rumor prediction models. To address this oversight, we conducted a technical investigation and comparison of state-of-the-art procedures for detecting rumors, focusing on the role of data mining in social circles. This survey will assist researchers in determining the most effective techniques and appropriate future research directions.
   </abstract>
   <kwd-group> 
    <kwd>
     Rumor Detection
    </kwd> 
    <kwd>
      Social Network Analysis
    </kwd> 
    <kwd>
      Social Circles
    </kwd> 
    <kwd>
      Graph Mining
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Our lives and interactions with others are significantly affected by social media today. In the past, people relied on voice transmitters such as mongers and drums to communicate, limiting the spread of news to just a few kilometers. Subsequently, people turned to print media, such as newspapers and magazines, and later to radio and television. However, a barrier between journalists and the public prevents the latter from sharing their opinions and ideas on a wide scale. Then came social media, which expanded the scope of knowledge and participation for exchange among participants. Through social media platforms such as Facebook and X (formerly Twitter), in a few seconds, information published by one person can reach millions of individuals <xref ref-type="bibr" rid="scirp.142851-1">
     [1]
    </xref>.</p>
   <p>The era of social media began two decades ago and has continuously gained popularity. Platforms such as LinkedIn, MySpace, Facebook, YouTube, X, Google+, Instagram, WhatsApp, and Snapchat caused a major revolution in our communication and social life <xref ref-type="bibr" rid="scirp.142851-2">
     [2]
    </xref>. The ease and flexibility of social media platforms, especially X, where anyone can share and collect information about news regardless of its veracity, have made them fertile ground for rumor mongers to spread misleading information that may prompt disturbances and unexpected responses <xref ref-type="bibr" rid="scirp.142851-3">
     [3]
    </xref>. Owing to the unorganized nature of these platforms, rumors spread widely. Therefore, studying and analyzing rumors on social media platforms is a crucial topic in the field of social media analysis <xref ref-type="bibr" rid="scirp.142851-4">
     [4]
    </xref>.</p>
   <p>
    <xref ref-type="bibr" rid="scirp.142851-"></xref>Data are continuously generated by social networks every minute. Studies have demonstrated that Facebook users share 684,000 pieces of material in a single minute, while X users send more than 100,000 tweets. Hand-listing rumors from such a massive dataset is not feasible <xref ref-type="bibr" rid="scirp.142851-5">
     [5]
    </xref>. Numerous studies have analyzed the problem of rumors spreading on social networks using various techniques such as machine learning and deep learning. However, they have often neglected the key role of users in determining the spread of rumors. Even among studies investigating rumor sources, few have examined the impact of social media mining on rumor detection <xref ref-type="bibr" rid="scirp.142851-6">
     [6]
    </xref>. Therefore, this study seeks to analyze the techniques used in rumor detection, focusing on social circle mining in rumor detection and the associated challenges. The main contributions of this study are as follows.</p>
   <p>In this study, we used a systematic literature review (SLR) methodology <xref ref-type="bibr" rid="scirp.142851-7">
     [7]
    </xref> to examine the basic concepts related to rumor detection on social media. We also investigated several methods and approaches designed to detect rumors on social media platforms, focusing on the role of social circle mining and the challenges facing this research area.</p>
   <p>The remainder of this paper is organized as follows: In the second section, we review the most important definitions of rumors from previous studies. In the third section, we divided the methods used for rumor detection into four categories. In the fourth section, we present the concepts of social media, rumors, and social circle mining for rumor detection. The technical details of the various models are compared in the fifth section. In the sixth section, the challenges related to rumor detection in social networks are discussed. The seventh section concludes the study.</p>
  </sec><sec id="s2">
   <title>2. Rumor Definition</title>
   <p>There are two common ways to describe a rumor. Rumors are often understood to be “distorted, exaggerated, irrational, and inauthentic information” <xref ref-type="bibr" rid="scirp.142851-8">
     [8]
    </xref>. In academic studies, rumors are usually described as messages that have not been verified or validated, such as “an unverified proposition that is in general circulation” <xref ref-type="bibr" rid="scirp.142851-9">
     [9]
    </xref> or “an unverified message passed from one person to another that refers to an object, person, or situation” <xref ref-type="bibr" rid="scirp.142851-10">
     [10]
    </xref>, including rumors that are subsequently shown to be untrue as well as those later confirmed as correct <xref ref-type="bibr" rid="scirp.142851-11">
     [11]
    </xref>. “Unverified and instrumentally relevant information statements in circulation” <xref ref-type="bibr" rid="scirp.142851-12">
     [12]
    </xref> are considered rumors, regardless of whether this unconfirmed information is later confirmed as wholly untrue, somewhat true, or neither. Another definition describes a rumor within the context of breaking news stories as a “circulating story of questionable veracity, which is credible though hard to verify, and produces sufficient skepticism and/or anxiety to motivate finding out the actual truth” <xref ref-type="bibr" rid="scirp.142851-13">
     [13]
    </xref>.</p>
   <p>This study embraces the standard academic definition of a rumor, which states that a rumor is a message that has not yet been verified by the recipient and is unreliable in terms of accuracy <xref ref-type="bibr" rid="scirp.142851-14">
     [14]
    </xref>. Rumors in this study are considered widely circulated statements or pieces of information that have not been verified as true or false, which are often spread by word of mouth or through social media and lead to misleading information or social confusion if not verified.</p>
  </sec><sec id="s3">
   <title>3. Literature Review of Rumor Detection Methods</title>
   <p>A contemporary tale or report with questionable or ambiguous veracity may be considered a rumor. A rumor may also be described as an association that begins with one or more sources and develops over time. The veracity of any given occurrence is determined via rumor detection. Research on developing rumor detection and prediction systems has gained considerable popularity following increased reliance on social media for news and important information. When performing rumor detection, several issues must be addressed, such as the variety of data, identifying the most recent rumors from historical data, and determining the source of the rumor. A rumor classification system generally consists of four components: situation classification, truth classification, tracking, and detection. When building rumor classification systems, temporal characteristics must be determined because rumors usually appear with breaking news that the system has not previously encountered. Therefore, the system must be able to deal with new, unexpected rumors and detect them automatically and immediately <xref ref-type="bibr" rid="scirp.142851-4">
     [4]
    </xref>.</p>
   <p>Related to rumor detection, rumor prediction first appeared in 2017, with the goal of predicting the possibility that a message will become a rumor at the time of publication rather than—as with rumor detection—merely identifying rumors after they occur. In determining whether a message or information may become a rumor in the future, rumor prediction requires quick and immediate decisions before the rumor spreads and places people at risk. Prediction systems may face difficulties related to short sentences and the volume of data flow. However, it is important to identify rumors as soon as possible before the process becomes overly complicated <xref ref-type="bibr" rid="scirp.142851-5">
     [5]
    </xref>. <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> displays the steps in detecting rumors, classifying stances, and predicting truth.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Flowchart of the rumor detection and classification process.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2680339-rId16.jpeg?20250527030730" />
   </fig>
   <p>The spread of rumors negatively impacts people’s lives. Therefore, obtaining reliable information during crises is of utmost importance. The current strategies for rooting out rumors on social media platforms incorporate a series of tools and methods that identify, trace, and suppress misinformation through various computational, statistical, and machine-learning techniques to distinguish between facts and rumors in the information posted on social media <xref ref-type="bibr" rid="scirp.142851-15">
     [15]
    </xref>. In the following section, we outline the most recent and important approaches used in previous studies for detecting rumors.</p>
   <sec id="s3_1">
    <title>3.1. Machine Learning-Based Approaches</title>
    <p>Machine learning (ML) is a branch of artificial intelligence (AI). Using algorithms learned via a large dataset, ML builds models with the ability to perform tasks without explicit learning, ranging from image classification to future prediction procedures <xref ref-type="bibr" rid="scirp.142851-16">
      [16]
     </xref>. Lying at the intersection of several scientific disciplines, ML is a rapidly growing field encompassing computer science, statistics, data science, and AI. ML has made significant strides with the advancement of algorithms and the abundance of data available through the Internet <xref ref-type="bibr" rid="scirp.142851-17">
      [17]
     </xref>. Rumor detection using ML frameworks is an exciting and rapidly developing research area. The ML process flow is depicted in <xref ref-type="fig" rid="fig2">
      Figure 2
     </xref>, where the best characteristics are taken from the input and then categorized in a binary classification system as rumors (R) or non-rumors (NR).</p>
    <fig id="fig2" position="float">
     <label>Figure 2</label>
     <caption>
      <title>Figure 2. Use of machine learning for rumor detection.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2680339-rId17.jpeg?20250527030730" />
    </fig>
    <p>In a supervised learning approach, models classify posts as rumors or not by training on a labeled dataset. This can be accomplished using several algorithms, including logistic regression, decision trees, the Naive Bayes algorithm, and support vector machines (SVM) <xref ref-type="bibr" rid="scirp.142851-18">
      [18]
     </xref>. Rumors can be accurately detected by filtering and analyzing language features using the supervised ML framework bifold <xref ref-type="bibr" rid="scirp.142851-19">
      [19]
     </xref>.</p>
    <p>1) Methodology of Supervised Approaches</p>
    <p>A substantial body of research on supervised approaches can be traced back to Castillo et al.’s <xref ref-type="bibr" rid="scirp.142851-20">
      [20]
     </xref> foundational study on assessing the reliability of information disseminated through social media networks examination of the reliability of information distributed through social media networks. Castillo et al. <xref ref-type="bibr" rid="scirp.142851-20">
      [20]
     </xref>, who were the first to develop features for evaluating credibility on Twitter <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>, based their research on the notion that users can assess the reliability of information using specific cues found in social media environments.</p>
    <p>Castillo et al. created a dataset to investigate Twitter’s trustworthiness. A team of human assessors then assigned a label to each issue based on two criteria: NEWS, which provides a fact that may be of interest to others, and CHAT, which is a message based on the author’s personal ideas and/or chats with friends. Another panel of judges rated each item’s trustworthiness within these categories <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>. Subsequently, a collection of attributes was extracted to construct a classifier that automatically ascertains whether a subject is associated with noteworthy data or occurrences and, if so, automatically evaluates the subject’s degree of believability. Four categories of features were distinguished: propagation-based, message-based, user-based, and topic-based features <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>.</p>
    <p>The best-first selection approach was used to select features that contributed most to the task. Sampling with replacement was used to select a random sample from the training dataset, and a uniform distribution was used to determine the likelihood of obtaining an instance from each of the three classes (NEWS, CHAT, and UNSURE). A variety of supervised learning techniques were used <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>.</p>
    <p>2) Nonparametric Machine Learning Models</p>
    <p>The term nonparametric refers to models in which the underlying data distribution is not assumed to have a fixed shape or a fixed number of parameters. Instead, they adjust to the structure of the data, which can be used with both supervised and unsupervised ML models. In classifying fake news according to its prevalence level, in addition to the use of textual information (text and headlines) and content features, preventive strategies can also be implemented to create early predictions regarding the spread of fake news <xref ref-type="bibr" rid="scirp.142851-22">
      [22]
     </xref>.</p>
    <p>3) Logistic Regression Model</p>
    <p>Logistic regression models are statistical models used to estimate the probability of a binary event, such as yes/no, true/false, and, in our context, common/uncommon, using one or more independent variables <xref ref-type="bibr" rid="scirp.142851-23">
      [23]
     </xref>. Logistic regression has been used in the health sector to classify health-related rumors. According to a study on rumor veracity categorization, the length of rumor headlines or statements and the use of pictures in rumor statements were adversely connected with the chance that a rumor was real. The following characteristics were positively connected with the likelihood that a rumor would be true: hyperlinks, the names of people or places mentioned in the rumor, and hints about the source of information <xref ref-type="bibr" rid="scirp.142851-24">
      [24]
     </xref>.</p>
    <p>Using regression tasks, fact-checking platforms are developing computational methods to predict the popularity of false rumors, focusing on immediate contextual information, such as rumor content and user profile information <xref ref-type="bibr" rid="scirp.142851-25">
      [25]
     </xref>.</p>
    <p>4) Support Vector Machines (SVMs)</p>
    <p>In the 1950s, the SVM method first appeared, subsequently developing as a kernel computer <xref ref-type="bibr" rid="scirp.142851-16">
      [16]
     </xref>. The SVM is a supervised ML model that is applied to classification and regression problems and works by ideally dividing data points into different classes to determine the ideal hyperplane in the feature space <xref ref-type="bibr" rid="scirp.142851-26">
      [26]
     </xref>.</p>
    <p>In this study, Qin et al. used an SVM on a training set and based rumor prediction on a fixed threshold technique to maximize prediction accuracy. Furthermore, they used pseudo-feedback, novelty-based, and content-based features. The proposed method can reliably forecast whether an item eventually becomes a rumor, enabling the refutation of false information before it spreads and causes harm to society. Rumor prediction significantly increases the precision of cutting-edge rumor detection software <xref ref-type="bibr" rid="scirp.142851-5">
      [5]
     </xref>.</p>
    <p>5) Random Forest (RF)</p>
    <p>The RF model, which is also widely used for categorization, uses several decision trees. In this model, each decision tree serves as a classifier, and a random sampling algorithm aggregates all classification results before the final classification decision is reached. RF has been demonstrated to be a highly accurate and reliable algorithm compared with various rumor-refuting microblogs <xref ref-type="bibr" rid="scirp.142851-27">
      [27]
     </xref>. However, it has not been proven to be as effective as XGBoost in identifying users who are more likely to deny rumors <xref ref-type="bibr" rid="scirp.142851-28">
      [28]
     </xref>.</p>
    <p>6) Extreme Gradient Boosting (XGBoost)</p>
    <p>XGBoost is a recently developed algorithm that is increasingly popular in data analysis and industrial circles. In contrast to RF, it trains trees in a serial and interactive manner, as opposed to a parallel and autonomous manner, using a different type of tree called the classification and regression tree (CART) <xref ref-type="bibr" rid="scirp.142851-29">
      [29]
     </xref>.</p>
    <p>XGBoost was used in a study to determine which users were more inclined to deny rumors. The prediction model was enhanced by text analysis using natural language processing (NLP), which also demonstrated high generalizability and the absence of any significant group behavior characteristics in the retweeted prediction. A valid and robust distinguishing XGBoost model was then trained and validated to predict who would retweet disaster-related rumor-refuting microblogs <xref ref-type="bibr" rid="scirp.142851-28">
      [28]
     </xref>.</p>
    <p>The XGBoost model has been used, along with several content-, user-, and topic-based features, to automatically detect rumors in Arabic <xref ref-type="bibr" rid="scirp.142851-30">
      [30]
     </xref>. In another study, an XGBoost classification model was trained utilizing NLP, together with other user characteristics, such as user sentiment and current interests, allowing it to examine the relationship between user characteristics and rumor-disputing behavior in five major rumor categories—economics, society, politics, disasters, and the military <xref ref-type="bibr" rid="scirp.142851-31">
      [31]
     </xref>.</p>
    <p>The unsupervised learning approach involves training models on unlabeled data with the goal of uncovering underlying structures or hidden patterns in the data. Illustrative techniques encompass anomaly detection and dimensionality reduction (principal component analysis, t-small number ensemble), as well as clustering (K-means, linear clustering) <xref ref-type="bibr" rid="scirp.142851-16">
      [16]
     </xref> <xref ref-type="bibr" rid="scirp.142851-32">
      [32]
     </xref>.</p>
    <p>1) Feature Analysis</p>
    <p>Feature analysis is an unsupervised learning method that aims to identify hidden patterns or structures in data. In our context, many features have been examined for rumor detection, such as retweet rate and word distribution characteristics. A study concluded that the retweet rate was insufficient to distinguish rumors from other items. In contrast, the differences in word distribution may be an important indicator for classifying rumors <xref ref-type="bibr" rid="scirp.142851-33">
      [33]
     </xref>.</p>
    <p>2) Clustering</p>
    <p>Clustering is a method that uses models to group data points based on the similarity of the data. It seeks to identify groups in a dataset that occur naturally without labels. Examples of clustering algorithms include K-means, hierarchical clustering, and DBSCAN <xref ref-type="bibr" rid="scirp.142851-34">
      [34]
     </xref>.</p>
    <p>A study on clustering Twitter political rumor detection used five structural and chronological characteristics. In the first phase, tweets with consistent address links were grouped. In contrast, in phase two, similar clusters debating continuous news were combined into a single cluster with similar circular functions <xref ref-type="bibr" rid="scirp.142851-35">
      [35]
     </xref>. Using clustering to group similar tweets and semantic and sentiment analyses to identify differences in information supplied by various sources, these techniques work together to help uncover rumors on Twitter <xref ref-type="bibr" rid="scirp.142851-36">
      [36]
     </xref>.</p>
    <p>This method uses unlabeled data by generating supplementary tasks to enhance the primary supervised task. To better identify and detect rumors, the self-supervised rumor detection (SRD) framework employs contrastive learning on heterogeneous information sources and is part of the unsupervised learning subcategory. This technique does not rely on labels from other sources but instead on the data itself to generate supervisory signals. The applications used in this framework include NLP, computer vision, and speech recognition. Common techniques include removing the signal from the image, which includes filling in the missing parts of the image, contrastive learning, and word prediction using language models such as BERT (bidirectional encoder representations from transformers) <xref ref-type="bibr" rid="scirp.142851-37">
      [37]
     </xref>.</p>
    <p>1) Contrastive Learning</p>
    <p>By improving the model’s capacity to discern between accurate and inaccurate information, contrastive learning has the potential to be a valuable tool for identifying rumors. It has been used in conjunction with other technologies, which enhanced performance <xref ref-type="bibr" rid="scirp.142851-38">
      [38]
     </xref>.</p>
    <p>2) BERT Models</p>
    <p>Researchers have demonstrated that using BERT in different ways significantly enhances the accuracy of rumor detection compared with traditional methods <xref ref-type="bibr" rid="scirp.142851-39">
      [39]
     </xref> <xref ref-type="bibr" rid="scirp.142851-40">
      [40]
     </xref>. Such increases are owing to BERT’s enhanced capacity to comprehend the subtleties and contextual meaning of language used in rumors.</p>
   </sec>
   <sec id="s3_2">
    <title>3.2. Deep Learning-Based Approaches</title>
    <p>Deep learning is a subfield of ML that employs multilayered artificial neural networks (ANNs), popularly known as “deep” neural networks (DNNs), to represent complex patterns in data. Neural networks can acquire knowledge from vast datasets because of their inherent design, which emulates the cognitive processes of the human brain. Deep learning works well for applications such as audio and picture recognition and NLP <xref ref-type="bibr" rid="scirp.142851-41">
      [41]
     </xref> <xref ref-type="bibr" rid="scirp.142851-42">
      [42]
     </xref> and has demonstrated to be a clear winner over traditional classifiers in a variety of ML applications, including speech recognition, object identification, and sentiment categorization. The goal of DNN-based techniques is to automatically develop deep representations of rumor data <xref ref-type="bibr" rid="scirp.142851-43">
      [43]
     </xref>. The use of deep learning for rumor detection is illustrated in <xref ref-type="fig" rid="fig3">
      Figure 3
     </xref>.</p>
    <fig id="fig3" position="float">
     <label>Figure 3</label>
     <caption>
      <title>Figure 3. Deep learning for rumor detection.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2680339-rId18.jpeg?20250527030731" />
    </fig>
    <p>Several deep learning methods are employed for rumor detection on social media. The subsections below outline some common approaches.</p>
    <p>A diverse class of feedforward neural networks, RNNs are mostly employed to handle variable-length sequential or time series data. RNNs are used in a variety of applications, such as categorization and sequence creation <xref ref-type="bibr" rid="scirp.142851-3">
      [3]
     </xref>. Given their structure, RNNs form models of rumor data as sequential data, capturing the dynamic temporal signals characteristic of rumor diffusion through direct cycle connections between units <xref ref-type="bibr" rid="scirp.142851-43">
      [43]
     </xref>. For instance, integrating an RNN model with a Word2Vec model provides a novel approach to rumor detection. This hybrid model comprises two primary components: Word2Vec and long short-term memory (LSTM)-RNN. A common problem faced in detecting rumors in breaking news is overlapping topics and out-of-vocabulary (OOV) items; parallel training of components helps mitigate such issues, providing a powerful solution for detecting rumors in real time. An RNN-based approach was used to leverage both the propagation patterns and linguistic content of posts for early rumor detection, allowing the RNN to learn the relationships between posts and their content <xref ref-type="bibr" rid="scirp.142851-44">
      [44]
     </xref>.</p>
    <p>The CSI model, which refers to the components that make up the model: Capture, Score, and Integrate, is an innovative rumor detection technique that combines text, user comments, and promotions. The use of an RNN enables the understanding of the dynamics involved in the spread of rumors. The hybrid CSI model enhances accuracy and reliability by integrating several data profiles. Furthermore, it offers valuable insights for further studies by generating concealed user and object representation. The CSI model represents a significant advancement in rumor detection. Providing a comprehensive reaction to misinformation shared on social media enables swift intervention and mitigation <xref ref-type="bibr" rid="scirp.142851-45">
      [45]
     </xref>.</p>
    <p>A CNN utilizes a structure that models significant semantic features, thereby enabling it to extract local and global features and reveal high-level interactions <xref ref-type="bibr" rid="scirp.142851-43">
      [43]
     </xref>. Recent research has revealed constraints in using RNNs for the early identification of rumors because they rely heavily on recent input data. A solution to this problem was the development of a convolutional approach for misinformation identification (CAMI). The proposed approach uses doc2vec to represent clusters of microblog entries and a two-layer CNN for classification, enabling the efficient extraction of crucial information and high performance <xref ref-type="bibr" rid="scirp.142851-46">
      [46]
     </xref>.</p>
    <p>In another study, a novel event adversarial neural network (EANN) was developed specifically for detecting multimodal false news, particularly for recent events. The EANN incorporates modules for event discrimination, bogus news identification, and multimodal feature extraction. It incorporates CNNs to extract characteristics from both textual and visual data <xref ref-type="bibr" rid="scirp.142851-47">
      [47]
     </xref>.</p>
    <p>These neural networks are designed to operate with graph-structured data. GNNs are especially helpful for tasks in which relationships and interactions between entities are crucial. Among its most important applications, social network analysis is used to detect communities, predict user behavior, and identify influential users, with other applications including recommendation systems and NLP. The global structural characteristics from graphs or trees are better captured by a graph convolutional network (GCN) than by the aforementioned deep learning models. Driven by CNN’s achievements of CNNs in computer vision, GCN have proven their performance at the forefront of several tasks using graph data. Several recent studies have used GCNs to detect and predict rumors on social media networks <xref ref-type="bibr" rid="scirp.142851-48">
      [48]
     </xref>.</p>
    <p>Deep learning methods often overlook the structures of wide dispersions in rumor detection. The bi-directional graph convolutional network (Bi-GCN) model explores both the propagation and dispersion characteristics of rumors using a top-down directed graph and an opposite graph of rumor diffusion. The proposed model has been proven to be effective in early rumor detection on Twitter <xref ref-type="bibr" rid="scirp.142851-49">
      [49]
     </xref>.</p>
    <p>A gated GNN-based algorithm <xref ref-type="bibr" rid="scirp.142851-50">
      [50]
     </xref> called propagation graph neural network (PGNN) can generate powerful representations for each node in the graph. The global embedding with PGNN (GLO-PGNN) and ensemble learning with PGNN (ENS-PGNN) models adopt different classification strategies and include attention mechanisms to dynamically adjust the node weights to further improve performance.</p>
    <p>The use of a unified GNN model and a community-enhanced vulnerability propagation method can improve rumor prediction and identify user vulnerabilities <xref ref-type="bibr" rid="scirp.142851-51">
      [51]
     </xref>. A gated GNN was used to learn semantic dependencies across segments in a graph-based pivotal semantic mining framework <xref ref-type="bibr" rid="scirp.142851-52">
      [52]
     </xref>. Given the many shortcomings of previous techniques and the need for improved reliability and accuracy of detection mechanisms, these sophisticated models and methodologies mark a substantial advancement in the field of rumor and false news identification.</p>
   </sec>
   <sec id="s3_3">
    <title>3.3. Hybrid Approaches</title>
    <p>Hybrid models combine more than one approach to increase the accuracy and effectiveness of the model. In the context of detecting rumors, hybridization often combines traditional ML methods with deep learning to enhance the effectiveness of the model and its ability to detect rumors <xref ref-type="bibr" rid="scirp.142851-4">
      [4]
     </xref>.</p>
    <p>In rumor detection, hybrid methods can be classified as follows:</p>
    <p>This model combines several features that enable it to predict rumors with higher accuracy. The combination of features such as text, user behavior, and network structure increase the model’s effectiveness and accuracy <xref ref-type="bibr" rid="scirp.142851-38">
      [38]
     </xref> <xref ref-type="bibr" rid="scirp.142851-40">
      [40]
     </xref> <xref ref-type="bibr" rid="scirp.142851-53">
      [53]
     </xref> <xref ref-type="bibr" rid="scirp.142851-54">
      [54]
     </xref>.</p>
    <p>The ensemble learning approach can combine the capabilities of more than one model in prediction to improve and increase efficiency, which makes it superior to single models in terms of their accuracy and flexibility. Examples of common methods for this approach include boosting, stacking, and bagging <xref ref-type="bibr" rid="scirp.142851-38">
      [38]
     </xref>.</p>
    <p>Multimodal approaches employ several features together to offer a comprehensive view of a situation. In predictions, these approaches can use a combination of text, images, and audio to enhance model functioning <xref ref-type="bibr" rid="scirp.142851-55">
      [55]
     </xref>-<xref ref-type="bibr" rid="scirp.142851-57">
      [57]
     </xref>.</p>
    <p>More than one algorithm can be exploited to explore the benefits that these methods provide since most ML algorithms, and many neural network structures can be complemented with deep learning methods for higher levels of accuracy and enhanced analysis <xref ref-type="bibr" rid="scirp.142851-39">
      [39]
     </xref> <xref ref-type="bibr" rid="scirp.142851-54">
      [54]
     </xref> <xref ref-type="bibr" rid="scirp.142851-56">
      [56]
     </xref> <xref ref-type="bibr" rid="scirp.142851-58">
      [58]
     </xref> <xref ref-type="bibr" rid="scirp.142851-59">
      [59]
     </xref>.</p>
    <p>This method uses several deep learning techniques, like CNNs and RNNs, to create a more accurate and useful model or way of predicting or extracting features that make use of the strengths and weaknesses of many neural network designs <xref ref-type="bibr" rid="scirp.142851-38">
      [38]
     </xref> <xref ref-type="bibr" rid="scirp.142851-40">
      [40]
     </xref> <xref ref-type="bibr" rid="scirp.142851-55">
      [55]
     </xref> <xref ref-type="bibr" rid="scirp.142851-56">
      [56]
     </xref> <xref ref-type="bibr" rid="scirp.142851-59">
      [59]
     </xref>.</p>
   </sec>
   <sec id="s3_4">
    <title>3.4. Network-Based Approaches</title>
    <p>For rumor detection, network-based approaches have been proposed that focus on the structure of social networks to identify how information and rumors are distributed and spread across them. Community discovery algorithms, centrality measures, and influence modeling often aid in the identification of influential nodes or groups within a community, which is a major factor in the spread of rumors across the network. By tracking the information spread and rumor pathways in hypothetical networks, network-based approaches expect to forecast, observe, and eventually control the harm and negative consequences of rumors <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>.</p>
    <p>The reliability analysis of rumor propagation modeling is currently one of the most well-known multidisciplinary study areas regarding this topic. Existing studies have primarily focused on three areas:</p>
    <p>The enhancement of the classical rumor propagation model based on factors, such as, heterogeneous user representation, was proposed for automatically distinguishing rumors from credible messages posted on social media <xref ref-type="bibr" rid="scirp.142851-21">
      [21]
     </xref>. The analysis of rumor propagation on online social platforms through the integration of other disciplinary theories, such as game theory, where social anxiety is considered, the intensity of rumors, and public perceptions of rumors and anti-rumors are considered important factors <xref ref-type="bibr" rid="scirp.142851-60">
      [60]
     </xref>. The combination of more than one technology that focuses on prominent nodes to reduce the propagation of rumors in online social networks has been shown to increase the effectiveness of control mechanisms when high-centrality users are the focus of attention <xref ref-type="bibr" rid="scirp.142851-61">
      [61]
     </xref>.</p>
    <p>Social networks enable individuals to participate in the exchange of information, providing large amounts of diverse data. It is worth noting that conventional techniques for social circle finding, similar to community detection, use clustering through statistical inference from a network topology perspective. In contrast, global mining requires considerable resources due to the size of social networks. Because of this difficulty, many academics have concentrated on mining the social circles of users’ egocentric networks. Most social circle-finding algorithms are only applicable to specific datasets, making it difficult to work directly with them to detect rumors <xref ref-type="bibr" rid="scirp.142851-6">
      [6]
     </xref> <xref ref-type="bibr" rid="scirp.142851-62">
      [62]
     </xref>.</p>
   </sec>
   <sec id="s3_5">
    <title>3.5. Transformer-Based Architectures</title>
    <p>Following the remarkable success of transformer-based embeddings in natural language tasks, researchers have become interested in applying them to classify rumors on social media platforms. Unlike traditional word embedding methods, the former excels at capturing the contextual meaning of a text by examining words to the left and right, producing textual representations that are ideal for detecting rumors <xref ref-type="bibr" rid="scirp.142851-63">
      [63]
     </xref>. A novel approach, called the ‘Memory-Enhanced Transformer with Graph Convolutional Networks’ (GCNs-MT), was presented for detecting rumors on social media platforms <xref ref-type="bibr" rid="scirp.142851-64">
      [64]
     </xref>. By combining GCNs with long-short-term memory cells and multi-head attention mechanisms in transformers to capture local and global dependencies in rumor propagation, we have proven our ability and efficiency in detecting rumors, addressing the challenges posed by the rapid spread of rumors on social media platforms.</p>
    <p>As fake news and rumors spread rapidly, it is important to develop a model for automatic rumor detection. The transformer-based multimodal interactive fusion (TMIF) model <xref ref-type="bibr" rid="scirp.142851-65">
      [65]
     </xref> relies on a transformer to map multimodal feature representations to the same data domain for fusion purposes. It can capture multilevel dependencies between multimodal content while minimizing the impact of multimodal heterogeneity. Furthermore, it demonstrated superior performance in the early detection of rumors.</p>
   </sec>
  </sec><sec id="s4">
   <title>4. Social Media</title>
   <p>Social media (SM) is an umbrella term for various online platforms, including blogs, social networks, and virtual worlds. The phrase “social media” was originally used in 1994 by the Matisse online media environment in Tokyo, Japan. Initially, SM platforms were created and introduced during the preliminary stages of commercial Internet. SM, now recognized as one of the most significant applications of the Internet, has substantially expanded in terms of platform diversity and user engagement over time. SM has many uses, not just sharing photos and promoting and advertising <xref ref-type="bibr" rid="scirp.142851-66">
     [66]
    </xref>.</p>
   <p>This section provides a comprehensive overview of the literature on SM, including its definitions and uses from 1994 to 2019, and offers recommendations for managers and researchers. The findings of this literature review demonstrate how the definitions of SM have evolved, concentrating increasingly less on individuals and their interactions and more on user-generated content and sharing. Social networks (SN), SM, and virtual communities (VC) are three groups into which definitions may be divided <xref ref-type="bibr" rid="scirp.142851-66">
     [66]
    </xref>. Just as a computer network is a collection of computers connected by a network of cables, an SN links individuals and groups. An SN is a collection of individuals (or organizations or other social entities) connected by a network of social interactions, such as friendships, coworking, or information sharing <xref ref-type="bibr" rid="scirp.142851-67">
     [67]
    </xref>.</p>
   <p>Social networking is becoming essential for finding and disseminating knowledge on diverse topics. Social media analytics is an emerging research area of immense interest to the information systems community. The goal of these analytics is to evaluate data from SM platforms; however, there are few comprehensive discussions or models available, and the field remains underdeveloped <xref ref-type="bibr" rid="scirp.142851-67">
     [67]
    </xref>. Social network analysts aim to comprehensively describe and analyze relationships, identify patterns, track information flow, and understand the impact of these networks on individuals and organizations <xref ref-type="bibr" rid="scirp.142851-67">
     [67]
    </xref>. Discovering, collecting, and preparing SM data poses many challenges to researchers, including the large volume and diversity of data, in addition to the need for more advanced algorithms to process them <xref ref-type="bibr" rid="scirp.142851-67">
     [67]
    </xref> <xref ref-type="bibr" rid="scirp.142851-68">
     [68]
    </xref>. One proposed solution is to create advanced software structures, visual analyses, and innovative algorithms to help discover topics.</p>
   <sec id="s4_1">
    <title>4.1. Rumors on Social Media</title>
    <p>The examination of rumors on SM has become a major area of interest in SM analysis. Several researchers have examined the way in which unverified information moves in these digital spaces with the sole aim of understanding these dynamics and their effects. Such research has made significant contributions to the study of rumor propagation and has benefited our understanding of how false information moves in online spaces. Several studies have also contributed to describing the various dimensions in which rumors operate in the quest to explain the inter- or intraspecific relationships between human behaviors, network structures, and how information flows in these digital ecosystems.</p>
    <p>The dynamics of rumor propagation have been investigated in multiple studies that have sought to reveal the strands of a rumor on the paths that people follow on SM networks. Many of these studies have used computational models, network analyses, and empirical studies to scrutinize how rumors start, gain, and lose momentum, spread across diversified user groups, and sometimes go viral. Most of these studies have employed network-based approaches and empirical analyses to study the patterns of rumor dissemination on X/Twitter. Network-based approaches, such as social network analysis, have identified influential users and network structures that provide avenues through which rumors can have longer lifespans <xref ref-type="bibr" rid="scirp.142851-6">
      [6]
     </xref>.</p>
    <p>Platforms such as Twitter/X and Reddit provide publicly available data, enabling researchers to more effectively study and track rumor spread patterns, user interactions, and content characteristics due to their open and accessible nature. In contrast, other social media platforms such as WhatsApp and Snapchat are important for rumor detection research due to their widespread use. Rumors on these platforms often spread through direct user interactions, making tracking difficult due to their closed nature, which limits the availability of public datasets, which are critical for rumor detection research. Researchers are therefore exploring innovative algorithms such as metadata analysis or leveraging trust mechanisms to address such challenges <xref ref-type="bibr" rid="scirp.142851-69">
      [69]
     </xref> <xref ref-type="bibr" rid="scirp.142851-70">
      [70]
     </xref>.</p>
    <p>Studies have demonstrated the varied characteristics of rumors about SM. For instance, rumors can go viral, which means they spread quickly and widely through SM platforms because users are all connected to each other <xref ref-type="bibr" rid="scirp.142851-71">
      [71]
     </xref>. Rumors can take advantage of the fact that the truth about a story is not known, making them more ambiguous and allowing individuals to form assumptions about the truth. Moreover, rumors are strengthened by individual beliefs, fears, or desires when shared through social circles. Rumors are also interesting because they change as they travel from friend to friend, or in our case, platform to platform; thus, they are harder to track and control <xref ref-type="bibr" rid="scirp.142851-71">
      [71]
     </xref>. To account for this semantic drift in rumors, models require innovative techniques. For example, using temporal segmentations instead of random segmentations to train models on past data and test them on future data <xref ref-type="bibr" rid="scirp.142851-72">
      [72]
     </xref>. Dynamic embedding models, such as those based on word2vec or BERT, are also a good method for monitoring changes in word meanings and context over time <xref ref-type="bibr" rid="scirp.142851-39">
      [39]
     </xref>. Analyzing the path of rumor propagation by incorporating contextual implications of propagation paths provides a deeper understanding of rumor propagation, both structurally and semantically. Combining these two factors enhances the model’s ability to adapt to the changing nature of rumors <xref ref-type="bibr" rid="scirp.142851-61">
      [61]
     </xref>.</p>
    <p>Furthermore, the spread of rumors is not solely reliant on their content; the structural properties of the underlying social networks also play a crucial role. Some methodologies have emphasized the need to debunk rumors in real time on social networks using the hybrid clustered shuffled frog-leaping algorithm with particle swarm optimization (SFLA-PSO), as well as taking advantage of trust relationships <xref ref-type="bibr" rid="scirp.142851-58">
      [58]
     </xref>.</p>
    <p>The present study, which examined friendship maintenance in social networks, highlighted the importance of trust in these digital relationships. The spread of rumors often threatens the dynamics of social networks; therefore, understanding how rumor propagation interferes with these dynamics is crucial <xref ref-type="bibr" rid="scirp.142851-58">
      [58]
     </xref> <xref ref-type="bibr" rid="scirp.142851-73">
      [73]
     </xref>.</p>
    <p>
     <xref ref-type="bibr" rid="scirp.142851-"></xref>Both <xref ref-type="bibr" rid="scirp.142851-58">
      [58]
     </xref> and <xref ref-type="bibr" rid="scirp.142851-73">
      [73]
     </xref> made substantial contributions to the field by exploring the creation of a comprehensive trust mechanism. Their research highlights the significance of trust levels in online social network (OSN)-based social relationships, emphasizing this aspect over intimacy levels. Rumor detection in social networks can be a complex task because the state of information verification can change over time. Several recent studies have explored temporal classification to address the dynamic nature of rumors <xref ref-type="bibr" rid="scirp.142851-74">
      [74]
     </xref>. For example, the rumor detection method used in this study constructs a distributed spreading tree where the weight of each edge represents the temporal interval between connected posts. This method incorporates temporal information to model the spread of rumors over time, which improves the accuracy of rumor prediction and reduces the din <xref ref-type="bibr" rid="scirp.142851-75">
      [75]
     </xref>.</p>
    <p>As illustrated in <xref ref-type="fig" rid="fig4">
      Figure 4
     </xref>, at the rumor generation stage, a rumor frequently goes through numerous iterations of content within the social circle before making its way across social networks.</p>
    <fig id="fig4" position="float">
     <label>Figure 4</label>
     <caption>
      <title>Figure 4. Information diffusion process during the rumor-generation phase.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2680339-rId19.jpeg?20250527030735" />
    </fig>
   </sec>
   <sec id="s4_2">
    <title>4.2. Social Circle Mining (SCM)</title>
    <p>Social circle mining is an analytical system that helps us understand the structure of social networks on digital platforms, such as online communities, and their functioning. SCM is used to extract, interpret, and analyze social circles from networks and employs various methodologies, including network science, ML, and data mining, to uncover communities and relationships within large networks <xref ref-type="bibr" rid="scirp.142851-76">
      [76]
     </xref>. The primary purpose of SCM is to identify and characterize clusters or groups of individuals with strong interconnections or shared interests within a wider social network <xref ref-type="bibr" rid="scirp.142851-77">
      [77]
     </xref> <xref ref-type="bibr" rid="scirp.142851-78">
      [78]
     </xref>. SCM uses methods including the traditional K-means clustering algorithm <xref ref-type="bibr" rid="scirp.142851-79">
      [79]
     </xref> and hierarchical clustering <xref ref-type="bibr" rid="scirp.142851-80">
      [80]
     </xref>, as well as advanced algorithms such as community discovery algorithms based on module optimization or spectral clustering. Such methods uncover the structure of social networks, which leads to a deeper understanding of how they are organized <xref ref-type="bibr" rid="scirp.142851-81">
      [81]
     </xref> <xref ref-type="bibr" rid="scirp.142851-82">
      [82]
     </xref>.</p>
    <p>A practical example of this is the use of social circle mining <xref ref-type="bibr" rid="scirp.142851-6">
      [6]
     </xref>, which extracts highly homogeneous social circles from user context, and combines them with social interaction to detect rumors. This method, called RDMSC, is processed and used in GCN encoders with an attention mechanism to learn and combine the two types of features for classification, as shown in <xref ref-type="fig" rid="fig5">
      Figure 5
     </xref>. The results demonstrate that the RDMSC method achieved superior rumor detection capabilities of up to 95%, outperforming state-of-the-art baselines on three real-world datasets.</p>
    <fig id="fig5" position="float">
     <label>Figure 5</label>
     <caption>
      <title>Figure 5. Overview of rumor detection model RDMSC.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/2680339-rId20.jpeg?20250527030735" />
    </fig>
    <p>Consider a practical example where SCM is integrated with a deep learning model for rumor detection. Data is collected from tweets related to a trending topic. The data is cleaned by removing retweets, filtering out non-English tweets, and normalizing text data. Hierarchical clustering is used to identify groups of users who frequently interact with each other. Features such as the number of interactions within each circle, sentiment of tweets, and frequency of keyword usage are extracted. These features are integrated into an LSTM (Long Short-Term Memory) network to capture temporal dependencies and patterns in the data. The LSTM network is trained to classify tweets as rumors or non-rumors based on the extracted features. The model’s performance is evaluated using a validation dataset, and it is refined based on the results. Such examinations enable the study of various social media research problems, such as echo chambers or filter bubbles, how information is diffused, the important factors contributing to information becoming viral in each social circle, and the trajectory of information diffusion (such as rumor debunking) <xref ref-type="bibr" rid="scirp.142851-83">
      [83]
     </xref> <xref ref-type="bibr" rid="scirp.142851-84">
      [84]
     </xref>. Moreover, SCM also helps deliver targeted content because, through SCM, a platform can ascertain social circles based on user interaction and shared interests, such as movies, stock market information, or religious factors, enabling platforms to prompt collective behavior by targeting groups with those shared interests <xref ref-type="bibr" rid="scirp.142851-82">
      [82]
     </xref> <xref ref-type="bibr" rid="scirp.142851-85">
      [85]
     </xref>. Furthermore, SCM holds significant promise for rumor detection and mitigation. SCM is capable of understanding how rumors spread within a particular community by analyzing the structural properties of social circles, such as identifying influential nodes in a diffusion process and mapping diffusion paths <xref ref-type="bibr" rid="scirp.142851-6">
      [6]
     </xref> <xref ref-type="bibr" rid="scirp.142851-84">
      [84]
     </xref>. Furthermore, this capacity can facilitate the development of proactive strategies to intervene and counteract the spread of misinformation. It can also help mitigate its impact by targeting influential nodes and disrupting the pathways of rumor diffusion within these social circles.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Comparisons</title>
   <p>We conducted a literature survey on rumor detection methods (Section 4), focusing on the use of social circle mining. We classified rumor detection methods into four categories: machine learning (ML), deep learning, hybrid, and network-based approaches. ML approaches are characterized by their speed and efficiency in processing large amounts of data. Their predictions may improve over time, but they may be complex to develop and maintain, as social network data are characterized by rapid development. Deep learning approaches can process large amounts of data with high accuracy and recognize complex patterns in the data. However, they require expensive computational resources. Hybrid approaches can provide the advantages of both categories by combining ML and deep learning methods. Most recent studies have adopted this approach to enhance efficiency in rumor detection and the ability of models to adapt to different patterns. However, hybrid approaches may be comparatively more complex and expensive. Finally, network-based approaches, including social network mining, provide broad and rapid access to large amounts of data and immediate updates. In addition to their ability to analyze interactions on social networks to help understand how rumors spread, such approaches may face challenges related to privacy, security, and obtaining irrelevant information.</p>
   <p>Regarding rumor detection using transformer-based architectures, such as ChatGPT models, despite their powerful rumor detection capabilities, there are some ethical issues, including privacy concerns, as they require exceptionally large datasets for training, raising concerns about collecting this data. Moreover, the built-in bias in the data they were trained on led to discriminatory results in rumor detection. Furthermore, these transformers can be used maliciously to spread rumors and manipulate public opinion.</p>
   <p>A technical comparison of these various approaches is provided in the following tables (<xref ref-type="table" rid="tableTables 1-4">
     Tables 1-4
    </xref>).</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.142851-"></xref>Table 1. Comparison of machine-learning approaches for rumor detection.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="8.83%"><p style="text-align:center">Study</p></td> 
      <td class="custom-bottom-td acenter" width="14.70%"><p style="text-align:center">Detection Method</p></td> 
      <td class="custom-bottom-td acenter" width="15.57%"><p style="text-align:center">Subcategory</p></td> 
      <td class="custom-bottom-td acenter" width="26.08%"><p style="text-align:center">Description/Approach</p></td> 
      <td class="custom-bottom-td acenter" width="15.73%"><p style="text-align:center">Dataset Used</p></td> 
      <td class="custom-bottom-td acenter" width="19.09%"><p style="text-align:center">Results/Evaluation</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-30">
         [30]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="14.70%"><p style="text-align:center">Extreme Gradient Boosting Method</p></td> 
      <td class="custom-top-td acenter" width="15.57%"><p style="text-align:center">Arabic Tweet Rumor Detection</p></td> 
      <td class="custom-top-td acenter" width="26.08%"><p style="text-align:center">Used XGBoost to detect rumors in Arabic tweets, employing a comprehensive feature set and achieving high accuracy.</p></td> 
      <td class="custom-top-td acenter" width="15.73%"><p style="text-align:center">Public Arabic Tweet Dataset</p></td> 
      <td class="custom-top-td acenter" width="19.09%"><p style="text-align:center">Achieved 97.18% accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-22">
         [22]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Machine Learning Models for Virality Prediction</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Fake News Virality Prediction</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Predicted the virality of fake news at an early stage using textual features, distinguishing between true and fake news propagation.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Discussed preventive strategies based on prediction accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-28">
         [28]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Machine Learning Methods</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Disaster-Related Rumor Refuters</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Compared various ML techniques for identifying disaster-related anti-rumor spreaders, using sentiment and text similarity analysis for prediction.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Sina Weibo Users and Microblogs</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Developed a robust XGBoost model for prediction.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-5">
         [5]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Content and Novelty-Based Features</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Rumor Prediction</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Introduced a new task for predicting potential future rumors, combining content and novelty features to improve detection accuracy.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Improved accuracy in rumor prediction.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-21">
         [21]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Heterogeneous User Representation Model</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Rumor Detection</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Developed a model that uses heterogeneous user representation to differentiate between rumors and credible messages by analyzing information propagation patterns.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Effective in distinguishing rumors based on propagation patterns.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-31">
         [31]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">XGBoost and NLP Techniques</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Rumor Refuter Feature Analysis</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Analyzed user features and sentiment using NLP and XGBoost to identify potential rumor refuters, showing differences across rumor categories.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Sina Weibo Users and Microblogs</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Revealed significant feature differences among refuters.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-24">
         [24]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Logistic Regression</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Health Rumors</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Investigated features distinguishing true from false health rumors using 453 health rumors and a logistic regression model.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Online reference of health rumors in China</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Lengths of headlines/statements and presence of pictures negatively correlated with truthfulness; elements such as numbers and hyperlinks positively correlated. Dread rumors are more likely to be true.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-20">
         [20]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Classification</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Twitter Credibility</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Assessed the credibility of tweets related to trending topics using features from posting behavior, text, and external citations.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Twitter postings related to trending topics</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">Precision and recall ranged from 70% to 80% for classifying credibility.</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-25">
         [25]
        </xref></p></td> 
      <td class="custom-bottom-td acenter" width="14.70%"><p style="text-align:center">Regression &amp; Classification</p></td> 
      <td class="custom-bottom-td acenter" width="15.57%"><p style="text-align:center">Popularity Prediction</p></td> 
      <td class="custom-bottom-td acenter" width="26.08%"><p style="text-align:center">Predicted future popularity of false rumors using post- and user-level information; introduced the BERT-Weibo-Rumor model.</p></td> 
      <td class="custom-bottom-td acenter" width="15.73%"><p style="text-align:center">19,256 false rumor cases from Weibo</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">KG-Fusion model outperformed baselines with an RMSE of 1.54 and Pearson’s r of 0.636. Popular rumors used more conjunctions and punctuation.</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td custom-top-td acenter" width="100.00%" colspan="6"><p style="text-align:center">Unsupervised-Based Approaches</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-33">
         [33]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="14.70%"><p style="text-align:center">Rule-Based Detection</p></td> 
      <td class="custom-top-td acenter" width="15.57%"><p style="text-align:center">Twitter Rumors</p></td> 
      <td class="custom-top-td acenter" width="26.08%"><p style="text-align:center">Analyzed rumor spread after a disaster and developed a system to detect rumor candidates on Twitter.</p></td> 
      <td class="custom-top-td acenter" width="15.73%"><p style="text-align:center">Twitter data from disaster events</p></td> 
      <td class="custom-top-td acenter" width="19.09%"><p style="text-align:center">The proposed algorithm detected rumors with acceptable accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-35">
         [35]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Rule-Based Detection</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Political Rumors</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Detected extreme political rumors on Twitter by identifying extreme users and using structural and timeline features.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Twitter data on political rumors</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">The rule-based method provided high precision and recall for detecting political rumors, with some rules achieving 100% precision.</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-36">
         [36]
        </xref></p></td> 
      <td class="custom-bottom-td acenter" width="14.70%"><p style="text-align:center">Classification</p></td> 
      <td class="custom-bottom-td acenter" width="15.57%"><p style="text-align:center">Misinformation Detection</p></td> 
      <td class="custom-bottom-td acenter" width="26.08%"><p style="text-align:center">Detected misinformation on Twitter in real-time by comparing tweets from verified news channels and general users.</p></td> 
      <td class="custom-bottom-td acenter" width="15.73%"><p style="text-align:center">Twitter data and the Twitter Grapevine prototype</p></td> 
      <td class="custom-bottom-td acenter" width="19.09%"><p style="text-align:center">Large number of topics flagged as suspicious with high accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td custom-top-td acenter" width="100.00%" colspan="6"><p style="text-align:center">Self-supervised-Based Approaches</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-40">
         [40]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="14.70%"><p style="text-align:center">Models BERT</p></td> 
      <td class="custom-top-td acenter" width="15.57%"><p style="text-align:center">Arabic Fake News Detection</p></td> 
      <td class="custom-top-td acenter" width="26.08%"><p style="text-align:center">Used mini-BERT with Arabic language embedding for fake news detection in Arabic, compared with ML classifiers.</p></td> 
      <td class="custom-top-td acenter" width="15.73%"><p style="text-align:center">Arabic fake news dataset</p></td> 
      <td class="custom-top-td acenter" width="19.09%"><p style="text-align:center">Mini-BERT-based classifiers outperformed ML classifiers, showing improved performance with increased training data.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-39">
         [39]
        </xref> </p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Models BERT</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Rumor Classification</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Combined BERT-OPCNN for feature extraction with FIAC and Bi-LSTM for classification of rumor text.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">Various rumor datasets</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">FIAC embedding with BERT-OPCNN outperformed existing techniques in rumor classification.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-38">
         [38]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Contrastive Learning</p></td> 
      <td class="acenter" width="15.57%"><p style="text-align:center">Rumor Tracking</p></td> 
      <td class="acenter" width="26.08%"><p style="text-align:center">Proposed SimCLRT framework for tracking rumors using contrastive learning; included variants SimCLRT-CNN, SimCLRT-Linear, and SimCLRT-RNN.</p></td> 
      <td class="acenter" width="15.73%"><p style="text-align:center">PHEME and RumorEval datasets</p></td> 
      <td class="acenter" width="19.09%"><p style="text-align:center">SimCLRT models outperformed baselines; SimCLRT-CNN showed the best performance overall.</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <table-wrap id="table2">
    <label>
     <xref ref-type="table" rid="table2">
      Table 2
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.142851-"></xref>Table 2. Comparison of deep learning approaches for rumor detection.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="7.36%"><p style="text-align:center">Study</p></td> 
      <td class="custom-bottom-td acenter" width="19.12%"><p style="text-align:center">Detection Method</p></td> 
      <td class="custom-bottom-td acenter" width="12.64%"><p style="text-align:center">Subcategory</p></td> 
      <td class="custom-bottom-td acenter" width="26.09%"><p style="text-align:center">Description/Approach</p></td> 
      <td class="custom-bottom-td acenter" width="16.92%"><p style="text-align:center">Dataset Used</p></td> 
      <td class="custom-bottom-td acenter" width="17.87%"><p style="text-align:center">Results/Evaluation</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-86">
         [86]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="19.12%"><p style="text-align:center">Convolutional Neural Network (CNN)</p></td> 
      <td class="custom-top-td acenter" width="12.64%"><p style="text-align:center">Deep Learning (CNN)</p></td> 
      <td class="custom-top-td acenter" width="26.09%"><p style="text-align:center">Proposed CAMI, a CNN-based approach for misinformation identification and early detection.</p></td> 
      <td class="custom-top-td acenter" width="16.92%"><p style="text-align:center">Two large-scale datasets</p></td> 
      <td class="custom-top-td acenter" width="17.87%"><p style="text-align:center">CAMI effectively identified misinformation and achieved early detection.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-47">
         [47]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Event Adversarial Neural Network (EANN)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Deep Learning (Hybrid)</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Framework with multimodal feature extractor, fake news detector, and event discriminator.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Multimedia datasets (Weibo, Twitter)</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">EANN outperformed state-of-the-art methods in fake news detection and learned transferable features.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-3">
         [3]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">RNN-based Detection</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Breaking News Rumors</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Detected breaking news rumors using word embeddings and RNNs, addressing topic shift issues in rumor detection.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Real-life rumor dataset</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">The model outperformed state-of-the-art methods in precision, recall, and F1 score.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-44">
         [44]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Tree-Structured RNN</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Twitter Rumors</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Detected rumors on Twitter using tree-structured recursive neural networks to handle sentiment expression and user bias.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Twitter datasets in English and Chinese</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">The method significantly outperformed baseline algorithms in detecting rumors.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-45">
         [45]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Hybrid Deep Model</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Fake News Detection</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Combined text, user response, and source characteristics for fake news detection using the CSI model.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Real-world news data</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">The CSI model achieved higher accuracy than existing models and provided meaningful latent representations.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-57">
         [57]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Gated Graph Neural Network (GNN)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Deep Learning (GNN)</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Used a graph-based approach to model content and semantic dependencies for rumor detection.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Real-world datasets</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">Outperformed existing methods by addressing redundant information and improving detection accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-86">
         [86]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Evidence-Providing Rumor Detection (EPRD)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Hybrid Approaches</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Incorporated prior knowledge and current comments using GraphSAGE and attention mechanisms.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Two real-world Twitter datasets</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">Best performance in rumor detection and early detection compared with baselines.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-51">
         [51]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Graph Neural Network (GNN)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Hybrid Approaches</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Predicted viral rumors and vulnerable users using a unified GNN model with multitask learning.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Datasets with annotations</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">Showed significant improvements in rumor detection, virality prediction, and user vulnerability scoring.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-50">
         [50]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Propagation Graph Neural Network (PGNN)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Deep Learning (GNN)</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Constructed a propagation graph and used PGNN with attention mechanisms for rumor detection.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Real-world Twitter dataset</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">Achieved better performance than state-of-the-art methods for rumor detection and early detection tasks.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="7.36%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-49">
         [49]
        </xref></p></td> 
      <td class="acenter" width="19.12%"><p style="text-align:center">Bi-Directional Graph Convolutional Networks (Bi-GCN)</p></td> 
      <td class="acenter" width="12.64%"><p style="text-align:center">Deep Learning (GNN)</p></td> 
      <td class="acenter" width="26.09%"><p style="text-align:center">Used Bi-GCN to capture both propagation and dispersion characteristics of rumors.</p></td> 
      <td class="acenter" width="16.92%"><p style="text-align:center">Various benchmarks</p></td> 
      <td class="acenter" width="17.87%"><p style="text-align:center">Demonstrated superior performance over existing approaches in detecting rumors on social media.</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <table-wrap id="table3">
    <label>
     <xref ref-type="table" rid="table3">
      Table 3
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.142851-"></xref>Table 3. Comparison of hybrid approaches for rumor detection.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="10.15%"><p style="text-align:center">Study</p></td> 
      <td class="custom-bottom-td acenter" width="17.80%"><p style="text-align:center">Detection Method</p></td> 
      <td class="custom-bottom-td acenter" width="16.01%"><p style="text-align:center">Subcategory</p></td> 
      <td class="custom-bottom-td acenter" width="26.60%"><p style="text-align:center">Description/Approach</p></td> 
      <td class="custom-bottom-td acenter" width="12.86%"><p style="text-align:center">Dataset Used</p></td> 
      <td class="custom-bottom-td acenter" width="16.58%"><p style="text-align:center">Results/Evaluation</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-40">
         [40]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="17.80%"><p style="text-align:center">Mini-BERT-based Deep Learning Classifiers</p></td> 
      <td class="custom-top-td acenter" width="16.01%"><p style="text-align:center">Arabic Fake News Detection</p></td> 
      <td class="custom-top-td acenter" width="26.60%"><p style="text-align:center">Used mini-BERT for sentiment analysis of Arabic fake news and compared it with ML classifiers. Applied holdout validation schemes to evaluate performance.</p></td> 
      <td class="custom-top-td acenter" width="12.86%"><p style="text-align:center">Arabic Fake News Dataset</p></td> 
      <td class="custom-top-td acenter" width="16.58%"><p style="text-align:center">Mini-BERT-based classifiers outperformed ML classifiers.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-53">
         [53]
        </xref></p></td> 
      <td class="acenter" width="17.80%"><p style="text-align:center">Rumor Detection Framework</p></td> 
      <td class="acenter" width="16.01%"><p style="text-align:center">Social Media Rumors</p></td> 
      <td class="acenter" width="26.60%"><p style="text-align:center">Proposed a framework that visualizes topic structures in time series, extracts rumor candidates, and verifies them using additional media sources.</p></td> 
      <td class="acenter" width="12.86%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="16.58%"><p style="text-align:center">Not specified</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-55">
         [55]
        </xref></p></td> 
      <td class="acenter" width="17.80%"><p style="text-align:center">Hybrid CNN and RNN Models</p></td> 
      <td class="acenter" width="16.01%"><p style="text-align:center">Fake News Classification</p></td> 
      <td class="acenter" width="26.60%"><p style="text-align:center">Proposesda framework using a combination of CNN and RNN models to classify fake news on Twitter with an accuracy of 82%.</p></td> 
      <td class="acenter" width="12.86%"><p style="text-align:center">Twitter Posts Dataset</p></td> 
      <td class="acenter" width="16.58%"><p style="text-align:center">Achieved 82% accuracy.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-54">
         [54]
        </xref></p></td> 
      <td class="acenter" width="17.80%"><p style="text-align:center">Feature Extraction from Crowd Responses</p></td> 
      <td class="acenter" width="16.01%"><p style="text-align:center">Rumor Detection in Chinese</p></td> 
      <td class="acenter" width="26.60%"><p style="text-align:center">Focused on detecting rumors on Weibo by extracting features from retweets and comments, employing clustering analysis and a classifier based on observed feature distribution.</p></td> 
      <td class="acenter" width="12.86%"><p style="text-align:center">Weibo Dataset</p></td> 
      <td class="acenter" width="16.58%"><p style="text-align:center">New features improved classification effectiveness.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-59">
         [59]
        </xref></p></td> 
      <td class="acenter" width="17.80%"><p style="text-align:center">Unsupervised Learning Model</p></td> 
      <td class="acenter" width="16.01%"><p style="text-align:center">User Behavior-based Detection</p></td> 
      <td class="acenter" width="26.60%"><p style="text-align:center">Combined RNNs and autoencoders to detect rumors based on users’ behaviors, achieving high accuracy and F1 measure.</p></td> 
      <td class="acenter" width="12.86%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="16.58%"><p style="text-align:center">Accuracy of 92.49% and F1 measure of 89.16%.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="10.15%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-58">
         [58]
        </xref></p></td> 
      <td class="acenter" width="17.80%"><p style="text-align:center">Hybrid Clustered SFLA-PSO Algorithm</p></td> 
      <td class="acenter" width="16.01%"><p style="text-align:center">Rumor Refutation</p></td> 
      <td class="acenter" width="26.60%"><p style="text-align:center">Proposed a hybrid clustered shuffled frog-leaping algorithm-particle swarm optimization (HCSFLA-PSO) for timely and real-time rumor refutation, integrating new trust mechanisms and energy consumption models.</p></td> 
      <td class="acenter" width="12.86%"><p style="text-align:center">Not specified</p></td> 
      <td class="acenter" width="16.58%"><p style="text-align:center">Demonstrated effectiveness through numerical simulations.</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <p>Continued</p>
   <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
    <tr> 
     <td class="acenter" width="10.15%"><p style="text-align:center">
       <xref ref-type="bibr" rid="scirp.142851-39">
        [39]
       </xref></p></td> 
     <td class="acenter" width="17.80%"><p style="text-align:center">Hybrid BERT-OPCNN &amp; FIAC with Customized Bi-LSTM</p></td> 
     <td class="acenter" width="16.01%"><p style="text-align:center">Rumor Text Classification</p></td> 
     <td class="acenter" width="26.60%"><p style="text-align:center">Used a two-phase feature extraction approach combining BERT-OPCNN and FIAC with customized Bi-LSTM for rumor classification, showing improved performance over existing techniques.</p></td> 
     <td class="acenter" width="12.86%"><p style="text-align:center">Not specified</p></td> 
     <td class="acenter" width="16.58%"><p style="text-align:center">Outperformed existing techniques in classification.</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="10.15%"><p style="text-align:center">
       <xref ref-type="bibr" rid="scirp.142851-56">
        [56]
       </xref></p></td> 
     <td class="acenter" width="17.80%"><p style="text-align:center">Portable Graph Transformer-based Model</p></td> 
     <td class="acenter" width="16.01%"><p style="text-align:center">Multimodal Graph-Based Detection</p></td> 
     <td class="acenter" width="26.60%"><p style="text-align:center">Introduced PHAROS, a graph transformer-based model with multimodal homophily measures designed to handle heterophily and integrate label information.</p></td> 
     <td class="acenter" width="12.86%"><p style="text-align:center">Real and Synthetic Data</p></td> 
     <td class="acenter" width="16.58%"><p style="text-align:center">Demonstrated superiority, efficiency, and robustness.</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="10.15%"><p style="text-align:center">
       <xref ref-type="bibr" rid="scirp.142851-57">
        [57]
       </xref></p></td> 
     <td class="acenter" width="17.80%"><p style="text-align:center">Psychological Motivation-based Detection</p></td> 
     <td class="acenter" width="16.01%"><p style="text-align:center">Endogenous Psychological Motivation</p></td> 
     <td class="acenter" width="26.60%"><p style="text-align:center">Focused on the psychological motivations behind user behaviors in social networks for rumor detection, analyzing active and passive user responses.</p></td> 
     <td class="acenter" width="12.86%"><p style="text-align:center">Twitter16 Dataset</p></td> 
     <td class="acenter" width="16.58%"><p style="text-align:center">Improved accuracy by 2.1% over the baseline.</p></td> 
    </tr> 
    <tr> 
     <td class="acenter" width="10.15%"><p style="text-align:center">
       <xref ref-type="bibr" rid="scirp.142851-38">
        [38]
       </xref></p></td> 
     <td class="acenter" width="17.80%"><p style="text-align:center">Contrastive Learning Framework</p></td> 
     <td class="acenter" width="16.01%"><p style="text-align:center">Rumor Tracking</p></td> 
     <td class="acenter" width="26.60%"><p style="text-align:center">Proposed SimCLRT, a contrastive learning framework for rumor tracking those addresses tweet coverage issues, with variants showing varying performance across datasets.</p></td> 
     <td class="acenter" width="12.86%"><p style="text-align:center">PHEME, RumorEval Datasets</p></td> 
     <td class="acenter" width="16.58%"><p style="text-align:center">Outperformed baselines, with SimCLRT-CNN performing best.</p></td> 
    </tr> 
   </table>
   <table-wrap id="table4">
    <label>
     <xref ref-type="table" rid="table4">
      Table 4
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.142851-"></xref>Table 4. Comparison of network approaches for rumor detection.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td acenter" width="8.83%"><p style="text-align:center">Study</p></td> 
      <td class="custom-bottom-td acenter" width="14.70%"><p style="text-align:center">Detection Method</p></td> 
      <td class="custom-bottom-td acenter" width="13.24%"><p style="text-align:center">Subcategory</p></td> 
      <td class="custom-bottom-td acenter" width="26.48%"><p style="text-align:center">Description/Approach</p></td> 
      <td class="custom-bottom-td acenter" width="16.18%"><p style="text-align:center">Dataset Used</p></td> 
      <td class="custom-bottom-td acenter" width="20.57%"><p style="text-align:center">Results/Evaluation</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-60">
         [60]
        </xref></p></td> 
      <td class="custom-top-td acenter" width="14.70%"><p style="text-align:center">Evolutionary Game Model</p></td> 
      <td class="custom-top-td acenter" width="13.24%"><p style="text-align:center">Rumor Propagation Control</p></td> 
      <td class="custom-top-td acenter" width="26.48%"><p style="text-align:center">Analyzed rumor propagation and control in social networks using evolutionary game theory and simulation.</p></td> 
      <td class="custom-top-td acenter" width="16.18%"><p style="text-align:center">Real rumor dataset from Twitter</p></td> 
      <td class="custom-top-td acenter" width="20.57%"><p style="text-align:center">The model showed the impact of anti-rumor messages and social anxiety on rumor spread.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-61">
         [61]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Optimal Control</p></td> 
      <td class="acenter" width="13.24%"><p style="text-align:center">Rumor Propagation</p></td> 
      <td class="acenter" width="26.48%"><p style="text-align:center">Examined rumor propagation with influential and ordinary nodes; proposed control strategies for homogeneous and heterogeneous networks.</p></td> 
      <td class="acenter" width="16.18%"><p style="text-align:center">Homogeneous and heterogeneous network datasets</p></td> 
      <td class="acenter" width="20.57%"><p style="text-align:center">Government policies and immunization strategies effectively reduced rumor spread.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-74">
         [74]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Heterogeneous Modeling</p></td> 
      <td class="acenter" width="13.24%"><p style="text-align:center">Rumor Detection</p></td> 
      <td class="acenter" width="26.48%"><p style="text-align:center">Developed a new model for rumor detection based on heterogeneous user representation and information propagation patterns.</p></td> 
      <td class="acenter" width="16.18%"><p style="text-align:center">Social media data</p></td> 
      <td class="acenter" width="20.57%"><p style="text-align:center">The model effectively distinguished rumors from credible messages; rumors spread among specific user groups.</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="8.83%"><p style="text-align:center">
        <xref ref-type="bibr" rid="scirp.142851-6">
         [6]
        </xref></p></td> 
      <td class="acenter" width="14.70%"><p style="text-align:center">Homogeneity Mining</p></td> 
      <td class="acenter" width="13.24%"><p style="text-align:center">Social Circle Mining</p></td> 
      <td class="acenter" width="26.48%"><p style="text-align:center">Proposed a new algorithm for detecting rumors by exploring social circles with high homogeneity in user context.</p></td> 
      <td class="acenter" width="16.18%"><p style="text-align:center">Real-world social media datasets</p></td> 
      <td class="acenter" width="20.57%"><p style="text-align:center">The approach outperformed existing methods in detecting early-stage rumors.</p></td> 
     </tr> 
    </table>
   </table-wrap>
  </sec><sec id="s6">
   <title>6. Challenges and Future Trends</title>
   <p>Detecting rumors on social networks faces several challenges, the most prominent of which is the large volume of data generated by these social networks, as analyzing this vast amount of data requires advanced algorithms and computational models. Furthermore, this data varies in its formats and includes text, images, video clips, and other forms, which further complicates the process of rumor analysis and detection.</p>
   <p>Another challenge lies in understanding the context and meaning of the published texts, as colloquial dialects or cultural backgrounds are often relevant and can make it difficult to interpret such texts on systems, thereby leading to incorrect interpretations in detecting rumors. Additionally, spreading rumors and transmitting them from fake or fictitious accounts hinders the process of tracking rumors and ascertaining their correct sources.</p>
   <p>The scarcity of labeled data required to train rumor detection models is another challenge. Obtaining, filtering, and classifying data is a tedious task that requires considerable effort and time but is necessary for training and developing such systems. Furthermore, rumors are characterized by their sophistication and ability to change rapidly over time, which requires continuous training and updating of models. Therefore, it is imperative to keep rumor detection models sophisticated and effective on an ongoing basis.</p>
   <p>Social network mining approaches show tremendous potential for rumor detection, but they face several limitations that currently prevent their widespread use. These limitations include the availability of rich contextual data on user interactions and network structures, which makes collecting and processing them difficult at scale due to privacy and platform constraints. Second, due to the diverse types of rumors and platforms, detection models may face difficulties in generalizing, especially when dealing with new rumors. Third, rumors vary over time, so models based on static data may be less effective, resulting in the temporal drift of concepts. Furthermore, models designed for rumor detection may suffer from significant computational complexity, which may make their current use challenging <xref ref-type="bibr" rid="scirp.142851-87">
     [87]
    </xref>. Furthermore, the problem of uneven data balance (verified rumors being less common than unverified ones) reduces the accuracy of models. Furthermore, these models require significant computing resources to be implemented on large-scale social media platforms <xref ref-type="bibr" rid="scirp.142851-87">
     [87]
    </xref>. Addressing these limitations requires significant improvements in data collection, the development and design of appropriate algorithms, and improved computing infrastructure.</p>
   <p>Given these challenges, SCM for rumor detection is considered a distinctive and promising solution, given features such as network structure analysis, community detection, and the ability to explicate and understand behavioral patterns. Through this approach, it is possible to monitor the nodes that influence rumor spreading and evaluate the credibility of information published on the network by building trust levels as well as tracking the path of rumors. Despite the capabilities and features provided by SCM for rumor detection, studies in this field are limited. This indicates the need for more research and development in this field to enhance the detection of rumors on social networks.</p>
  </sec><sec id="s7">
   <title>7. Conclusion</title>
   <p>Social media has gained popularity since its emergence and has become an integral part of daily life. These platforms have become hospitable environments for the generation and spread rumors. Rumors can cause significant harm to individuals, including reputational or financial loss and other damages. This survey provides a comprehensive view of the methods currently used to detect rumors on social networks, focusing on the use of SCM to detect rumors. Thus, this manuscript addresses numerous related concepts, such as the definition of rumors, methods of rumor detection, social networks, how rumors spread within them, and mining social circles to detect rumors. We classified the commonly employed methods into four categories: machine learning-based, deep learning-based, hybrid, and network-based approaches. Machine learning and deep learning models have proven capabilities in rumor detection. However, most of these methods ignore the impact of users’ social circles on the spread of rumors. Such methods may also be challenging to handle and require continuous updates to vast amounts of data. Hybrid approaches are the most prominent and widespread methods used to take advantage of the features of all models, thereby enhancing their capabilities in detecting rumors. Studies have emphasized the importance of network-based approaches, as they consider the context and content of rumors and the spread mechanism, which is significant in detecting rumors that have been difficult for previous approaches to explain. Moreover, previous studies have emphasized the importance of SCM as an additional approach that enhances the rapid detection of rumors and provides a comprehensive view of the mechanisms of rumor spread. Furthermore, integrating SCM into traditional detection methods will allow the development of more flexible and efficient methods to address misleading information and disinformation in digital technology. However, more research is needed in this field.</p>
  </sec><sec id="s8">
   <title>Acknowledgements</title>
   <p>The authors would like to thank the Deanship of Scientific Research, Qassim University, for funding the publication of this project.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.142851-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Allcott, H. and Gentzkow, M. (2017) Social Media and Fake News in the 2016 Election. Journal of Economic Perspectives, 31, 211-236. &gt;https://doi.org/10.1257/jep.31.2.211
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Oyza, I. and M. Edwin, A. (2015) Effectiveness of Social Media Networks as a Strategic Tool for Organizational Marketing Management. The Journal of Internet Banking and Commerce, 1. &gt;https://doi.org/10.4172/1204-5357.s2-006
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alkhodair, S.A., Ding, S.H.H., Fung, B.C.M. and Liu, J. (2020) Detecting Breaking News Rumors of Emerging Topics in Social Media. Information Processing &amp; Management, 57, Article ID: 102018. &gt;https://doi.org/10.1016/j.ipm.2019.02.016
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pathak, A.R., Mahajan, A., Singh, K., Patil, A. and Nair, A. (2020) Analysis of Techniques for Rumor Detection in Social Media. Procedia Computer Science, 167, 2286-2296. &gt;https://doi.org/10.1016/j.procs.2020.03.281
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Qin, Y., Dominik, W. and Tang, C. (2018) Predicting Future Rumours. Chinese Journal of Electronics, 27, 514-520. &gt;https://doi.org/10.1049/cje.2018.03.008
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zheng, P., Huang, Z., Dou, Y. and Yan, Y. (2023) Rumor Detection on Social Media through Mining the Social Circles with High Homogeneity. Information Sciences, 642, Article ID: 119083. &gt;https://doi.org/10.1016/j.ins.2023.119083
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mengist, W., Soromessa, T. and Legese, G. (2020) Method for Conducting Systematic Literature Review and Meta-Analysis for Environmental Science Research. MethodsX, 7, Article ID: 100777. &gt;https://doi.org/10.1016/j.mex.2019.100777
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Miller, D.E. (1992) “Snakes in the Greens” and Rumor in the Innercity. The Social Science Journal, 29, 381-393. &gt;https://doi.org/10.1016/0362-3319(92)90002-y
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Rosnow, R.L. (1976) Rumor and Gossip: The Social Psychology of Hearsay. Elsevier.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bock, P.G. (1964) A Theory of Rumor Transmission. Public Opinion Quarterly, 28, 687-690. &gt;https://doi.org/10.1086/267293
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Kapferer, J.N. (1990) Rumors: Uses, Interpretations, and Images. Routledge.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     DiFonzo, N. and Bordia, P. (2007) Rumor, Gossip and Urban Legends. Diogenes, 54, 19-35. &gt;https://doi.org/10.1177/0392192107073433
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref13">
    <label>13</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zubiaga, M.L.A. and Procter, K.B.R.N. (2015) Towards Detecting Rumours in Social Media. Proceedings of the AAAI Workshop, Austin, 25-30 January 2015, 35-41.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref14">
    <label>14</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, X.F., Burton-Jones, A., Liu, D.B.J. and   Xu, A. (2014) Rumors on Social MEDIA in Disasters: Extending Transmission to Retransmission. Proceeding of the 19th Pacific Asia Conference on Information Systems. &gt;http://aisel.aisnet.org/pacis2014/49 
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref15">
    <label>15</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ahsan, M., Kumari, M. and Sharma, T.P. (2019) Rumors Detection, Verification and Controlling Mechanisms in Online Social Networks: A Survey. Online Social Networks and Media, 14, Article ID: 100050. &gt;https://doi.org/10.1016/j.osnem.2019.100050
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref16">
    <label>16</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alpaydin, E. (2020) Introduction to Machine Learning. The MIT Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref17">
    <label>17</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jordan, M.I. and Mitchell, T.M. (2015) Machine Learning: Trends, Perspectives, and Prospects. Science, 349, 255-260. &gt;https://doi.org/10.1126/science.aaa8415
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref18">
    <label>18</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gongane, V.U., Munot, M.V. and Anuse, A. (2022) Machine Learning Approaches for Rumor Detection on Social Media Platforms: A Comprehensive Survey. In: Gupta, D., Sambyo, K., Prasad, M. and Agarwal, S., Eds., Advanced Machine Intelligence and Signal Processing, Springer, 649-663. &gt;https://doi.org/10.1007/978-981-19-0840-8_50
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref19">
    <label>19</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Doerr, B., Fouz, M. and Friedrich, T. (2012) Why Rumors Spread So Quickly in Social Networks. Communications of the ACM, 55, 70-75. &gt;https://doi.org/10.1145/2184319.2184338
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref20">
    <label>20</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Castillo, C., Mendoza, M. and Poblete, B. (2011) Information Credibility on Twitter. Proceedings of the 20th international conference on World Wide Web, Hyderabad, 28 March-1 April 2011, 675-684. &gt;https://doi.org/10.1145/1963405.1963500
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref21">
    <label>21</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, Y., Xu, S. and Tourassi, G. (2015) Detecting Rumors through Modeling Information Propagation Networks in a Social Media Environment. In: Agarwal, N., Xu, K. and Osgood, N., Eds., Social Computing, Behavioral-Cultural Modeling, and Prediction, Springer, 121-130. &gt;https://doi.org/10.1007/978-3-319-16268-3_13
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref22">
    <label>22</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Esteban-Bravo, M., Jiménez-Rubido, L.D.L.M. and Vidal-Sanz, J.M. (2024) Predicting the Virality of Fake News at the Early Stage of Dissemination. Expert Systems with Applications, 248, Article ID: 123390. &gt;https://doi.org/10.1016/j.eswa.2024.123390
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref23">
    <label>23</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bertsimas, D. and King, A. (2017) Logistic Regression: From Art to Science. Statistical Science, 32, 367-384. &gt;https://doi.org/10.1214/16-sts602
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref24">
    <label>24</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, Z., Zhang, Z. and Li, H. (2015) Predictors of the Authenticity of Internet Health Rumours. Health Information &amp; Libraries Journal, 32, 195-205. &gt;https://doi.org/10.1111/hir.12115
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref25">
    <label>25</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mu, Y., Niu, P., Bontcheva, K. and Aletras, N. (2024) Predicting and Analyzing the Popularity of False Rumors in Weibo. Expert Systems with Applications, 243, Article ID: 122791. &gt;https://doi.org/10.1016/j.eswa.2023.122791
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref26">
    <label>26</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Noble, W.S. (2006) What Is a Support Vector Machine? Nature Biotechnology, 24, 1565-1567. &gt;https://doi.org/10.1038/nbt1206-1565
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref27">
    <label>27</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Fernández-Delgado, E.C.M., Barro, D.A.S. and Fernández-Delgado, A. (2014) Do We Need Hundreds of Classifiers to Solve Real World Classification Problems? Journal of Machine Learning Research, 15, 3133-3181.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref28">
    <label>28</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, S., Li, Z., Wang, Y. and Zhang, Q. (2019) Machine Learning Methods to Predict Social Media Disaster Rumor Refuters. International Journal of Environmental Research and Public Health, 16, Article 1452. &gt;https://doi.org/10.3390/ijerph16081452
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref29">
    <label>29</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, T. and Guestrin, C. (2016) XGBoost: A Scalable Tree Boosting System. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, 13-17 August 2016, 785-794. &gt;https://doi.org/10.1145/2939672.2939785
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref30">
    <label>30</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gumaei, A., Al-Rakhami, M.S., Hassan, M.M., De Albuquerque, V.H.C. and Camacho, D. (2022) An Effective Approach for Rumor Detection of Arabic Tweets Using Extreme Gradient Boosting Method. ACM Transactions on Asian and Low-Resource Language Information Processing, 21, 1-16. &gt;https://doi.org/10.1145/3461697
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref31">
    <label>31</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, Z., Zhang, Q., Wang, Y. and Wang, S. (2020) Social Media Rumor Refuter Feature Analysis and Crowd Identification Based on XGBoost and NLP. Applied Sciences, 10, Article 4711. &gt;https://doi.org/10.3390/app10144711
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref32">
    <label>32</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dey, A. (2016) Machine Learning Algorithms: A Review. International Journal of Computer Science and Information Technology, 7, 1174-1179.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref33">
    <label>33</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Takahashi, T. and Igata, N. (2012) Rumor Detection on Twitter. The 6th International Conference on Soft Computing and Intelligent Systems, and the 13th International Symposium on Advanced Intelligence Systems, Kobe, 20-24 November 2012, 452-457. &gt;https://doi.org/10.1109/scis-isis.2012.6505254
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref34">
    <label>34</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Timbers, T., Campbell, T. and Lee, M. (2022) Data Science. Chapman and Hall/CRC. &gt;https://doi.org/10.1201/9781003080978
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref35">
    <label>35</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chang, C., Zhang, Y., Szabo, C. and Sheng, Q.Z. (2016) Extreme User and Political Rumor Detection on Twitter. In: Li, J., Li, X., Wang, S., Li, J. and Sheng, Q., Eds., Advanced Data Mining and Applications, Springer, 751-763. &gt;https://doi.org/10.1007/978-3-319-49586-6_54
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref36">
    <label>36</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Jain, S., Sharma, V. and Kaushal, R. (2016) Towards Automated Real-Time Detection of Misinformation on Twitter. 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Jaipur, 21-24 September 2016, 2015-2020. &gt;https://doi.org/10.1109/icacci.2016.7732347
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref37">
    <label>37</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gao, Y., Wang, X., He, X., Feng, H. and Zhang, Y. (2022) Rumor Detection with Self-Supervised Learning on Texts and Social Graph. Frontiers of Computer Science, 17, Article No. 174611. &gt;https://doi.org/10.1007/s11704-022-1531-9
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref38">
    <label>38</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zeng, H. and Cui, X. (2022) SimCLRT: A Simple Framework for Contrastive Learning of Rumor Tracking. Engineering Applications of Artificial Intelligence, 110, Article ID: 104757. &gt;https://doi.org/10.1016/j.engappai.2022.104757
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref39">
    <label>39</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nithya, K., Krishnamoorthi, M., Easwaramoorthy, S.V., C R, D., Yoo, S. and Cho, J. (2024) Hybrid Approach of Deep Feature Extraction Using BERT-OPCNN&amp;FIAC with Customized Bi-LSTM for Rumor Text Classification. Alexandria Engineering Journal, 90, 65-75. &gt;https://doi.org/10.1016/j.aej.2024.01.056
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref40">
    <label>40</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Alawadh, H.M., Alabrah, A., Meraj, T. and Rauf, H.T. (2023) Attention-Enriched Mini-Bert Fake News Analyzer Using the Arabic Language. Future Internet, 15, Article 44. &gt;https://doi.org/10.3390/fi15020044
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref41">
    <label>41</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Pathak, A.R., Pandey, M. and Rautaray, S. (2018) Application of Deep Learning for Object Detection. Procedia Computer Science, 132, 1706-1717. &gt;https://doi.org/10.1016/j.procs.2018.05.144
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref42">
    <label>42</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tan, L., Wang, G., Jia, F. and Lian, X. (2022) Research Status of Deep Learning Methods for Rumor Detection. Multimedia Tools and Applications, 82, 2941-2982. &gt;https://doi.org/10.1007/s11042-022-12800-8
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref43">
    <label>43</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Cao, J., Guo, J., Li, X., Jin, Z., Guo, H. and Li, J. (2018) Automatic Rumor Detection on Microblogs: A Survey. arXiv: 1807.03505. 
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref44">
    <label>44</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ma, J., Gao, W. and Wong, K. (2018) Rumor Detection on Twitter with Tree-Structured Recursive Neural Networks. Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Melbourne, 15-20 July 2018. 1980-1989. &gt;https://doi.org/10.18653/v1/p18-1184
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref45">
    <label>45</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ruchansky, N., Seo, S. and Liu, Y. (2017) CSI: A Hybrid Deep Model for Fake News Detection. Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, Singapore, 6-10 November 2017, 797-806. &gt;https://doi.org/10.1145/3132847.3132877
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref46">
    <label>46</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yu, F., Liu, Q., Wu, S., Wang, L. and Tan, T. (2017) A Convolutional Approach for Misinformation Identification. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, Melbourne, 19-25 August 2017, 3901-3907. &gt;https://doi.org/10.24963/ijcai.2017/545
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref47">
    <label>47</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, Y., Ma, F., Jin, Z., Yuan, Y., Xun, G., Jha, K., et al. (2018) EANN: Event Adversarial Neural Networks for Multi-Modal Fake News Detection. Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, London, 19-23 August 2018, 849-857. &gt;https://doi.org/10.1145/3219819.3219903
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref48">
    <label>48</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, J., Zhang, W., Ma, H. and Yang, S. (2023) Rumor Detection in Social Media Based on Multi-Hop Graphs and Differential Time Series. Mathematics, 11, Article 3461. &gt;https://doi.org/10.3390/math11163461
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref49">
    <label>49</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Bian, T., Xiao, X., Xu, T., Zhao, P., Huang, W., Rong, Y., et al. (2020) Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networks. Proceedings of the AAAI Conference on Artificial Intelligence, 34, 549-556. &gt;https://doi.org/10.1609/aaai.v34i01.5393
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref50">
    <label>50</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wu, Z., Pi, D., Chen, J., Xie, M. and Cao, J. (2020) Rumor Detection Based on Propagation Graph Neural Network with Attention Mechanism. Expert Systems with Applications, 158, Article ID: 113595. &gt;https://doi.org/10.1016/j.eswa.2020.113595
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref51">
    <label>51</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, X. and Gao, W. (2024) Predicting Viral Rumors and Vulnerable Users with Graph-Based Neural Multi-Task Learning for Infodemic Surveillance. Information Processing &amp; Management, 61, Article ID: 103520. &gt;https://doi.org/10.1016/j.ipm.2023.103520
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref52">
    <label>52</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yan, Y., Wang, Y. and Zheng, P. (2023) A Graph-Based Pivotal Semantic Mining Framework for Rumor Detection. Engineering Applications of Artificial Intelligence, 118, Article ID: 105613. &gt;https://doi.org/10.1016/j.engappai.2022.105613
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref53">
    <label>53</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hashimoto, T., Kuboyama, T. and Shirota, Y. (2011) Rumor Analysis Framework in Social Media. TENCON 2011—2011 IEEE Region 10 Conference, Bali, 21-24 November 2011, 133-137. &gt;https://doi.org/10.1109/tencon.2011.6129078
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref54">
    <label>54</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Cai, G., Wu, H. and Lv, R. (2014) Rumors Detection in Chinese via Crowd Responses. 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014), Beijing, 17-20 August 2014, 912-917. &gt;https://doi.org/10.1109/asonam.2014.6921694
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref55">
    <label>55</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ajao, O., Bhowmik, D. and Zargari, S. (2018) Fake News Identification on Twitter with Hybrid CNN and RNN Models. Proceedings of the 9th International Conference on Social Media and Society, Copenhagen, 18-20 July 2018, 226-230. &gt;https://doi.org/10.1145/3217804.3217917
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref56">
    <label>56</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nguyen, T.T., Ren, Z., Nguyen, T.T., Jo, J., Nguyen, Q.V.H. and Yin, H. (2024) Portable Graph-Based Rumour Detection against Multi-Modal Heterophily. Knowledge-Based Systems, 284, Article ID: 111310. &gt;https://doi.org/10.1016/j.knosys.2023.111310
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref57">
    <label>57</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Yan, Y., Wang, Y. and Zheng, P. (2023) Rumor Detection on Social Networks Focusing on Endogenous Psychological Motivation. Neurocomputing, 552, Article ID: 126548. &gt;https://doi.org/10.1016/j.neucom.2023.126548
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref58">
    <label>58</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hu, X., Xiong, X., Wu, Y., Shi, M., Wei, P. and Ma, C. (2023) A Hybrid Clustered SFLA-PSO Algorithm for Optimizing the Timely and Real-Time Rumor Refutations in Online Social Networks. Expert Systems with Applications, 212, Article ID: 118638. &gt;https://doi.org/10.1016/j.eswa.2022.118638
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref59">
    <label>59</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chen, W., Zhang, Y., Yeo, C.K., Lau, C.T. and Lee, B.S. (2018) Unsupervised Rumor Detection Based on Users’ Behaviors Using Neural Networks. Pattern Recognition Letters, 105, 226-233. &gt;https://doi.org/10.1016/j.patrec.2017.10.014
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref60">
    <label>60</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Askarizadeh, M., Tork Ladani, B. and Manshaei, M.H. (2019) An Evolutionary Game Model for Analysis of Rumor Propagation and Control in Social Networks. Physica A: Statistical Mechanics and its Applications, 523, 21-39. &gt;https://doi.org/10.1016/j.physa.2019.01.147
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref61">
    <label>61</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Myilsamy, K., Kumar, M.S. and Kumar, A.S. (2024) Optimal Control of a Rumor Propagation Model in Online Social Network by Considering Influential Nodes. Results in Control and Optimization, 14, Article ID: 100339. &gt;https://doi.org/10.1016/j.rico.2023.100339
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref62">
    <label>62</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Khawaja, F.R., Zhang, Z., Memon, Y. and Ullah, A. (2024) Exploring Community Detection Methods and Their Diverse Applications in Complex Networks: A Comprehensive Review. Social Network Analysis and Mining, 14, Article No. 115. &gt;https://doi.org/10.1007/s13278-024-01274-1
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref63">
    <label>63</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Anggrainingsih, R., Hassan, G.M. and Datta, A. (2024) Transformer-Based Models for Combating Rumours on Microblogging Platforms: A Review. Artificial Intelligence Review, 57, Article No. 212. &gt;https://doi.org/10.1007/s10462-024-10837-9
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref64">
    <label>64</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Chang, Q., Li, X. and Duan, Z. (2024) A Novel Approach for Rumor Detection in Social Platforms: Memory-Augmented Transformer with Graph Convolutional Networks. Knowledge-Based Systems, 292, Article ID: 111625. &gt;https://doi.org/10.1016/j.knosys.2024.111625
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref65">
    <label>65</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Lv, J., Wang, X. and Shao, C. (2022) TMIF: Transformer-Based Multi-Modal Interactive Fusion for Automatic Rumor Detection. Multimedia Systems, 29, 2979-2989. &gt;https://doi.org/10.1007/s00530-022-00916-8
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref66">
    <label>66</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Aichner, T., Grünfelder, M., Maurer, O. and Jegeni, D. (2021) Twenty-five Years of Social Media: A Review of Social Media Applications and Definitions from 1994 to 2019. Cyberpsychology, Behavior, and Social Networking, 24, 215-222. &gt;https://doi.org/10.1089/cyber.2020.0134
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref67">
    <label>67</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Garton, L., Haythornthwaite, C. and Wellman, B. (2006) Studying Online Social Networks. Journal of Computer-Mediated Communication, 3, JCMC313. &gt;https://doi.org/10.1111/j.1083-6101.1997.tb00062.x
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref68">
    <label>68</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Stieglitz, S., Mirbabaie, M., Ross, B. and Neuberger, C. (2018) Social Media Analytics—Challenges in Topic Discovery, Data Collection, and Data Preparation. International Journal of Information Management, 39, 156-168. &gt;https://doi.org/10.1016/j.ijinfomgt.2017.12.002
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref69">
    <label>69</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Albesher, A.S. and Alhussain, T. (2021) Evaluating and Comparing the Usability of Privacy in WhatsAPP, Twitter, and Snapchat. International Journal of Advanced Computer Science and Applications, 12, 251-259. &gt;https://doi.org/10.14569/ijacsa.2021.0120829
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref70">
    <label>70</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, Q., Zhang, Q., Si, L. and Liu, Y. (2019) Rumor Detection on Social Media: Datasets, Methods and Opportunities. Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom: Censorship, Disinformation, and Propaganda, Hong Kong, November 2019, 66-75. &gt;https://doi.org/10.18653/v1/d19-5008
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref71">
    <label>71</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Buchanan, T. (2020) Why Do People Spread False Information Online? The Effects of Message and Viewer Characteristics on Self-Reported Likelihood of Sharing Social Media Disinformation. PLOS ONE, 15, e0239666. &gt;https://doi.org/10.1371/journal.pone.0239666
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref72">
    <label>72</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Mu, Y., Bontcheva, K. and Aletras, N. (2023) It’s about Time: Rethinking Evaluation on Rumor Detection Benchmarks Using Chronological Splits. Findings of the Association for Computational Linguistics: EACL 2023, Dubrovnik, 2-6 May 2023, 736-743. &gt;https://doi.org/10.18653/v1/2023.findings-eacl.55
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref73">
    <label>73</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, F. and Li, M. (2018) A Game Theory-Based Network Rumor Spreading Model: Based on Game Experiments. International Journal of Machine Learning and Cybernetics, 10, 1449-1457. &gt;https://doi.org/10.1007/s13042-018-0826-5
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref74">
    <label>74</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, Y. and Xu, S. (2016) Detecting Rumors through Modeling Information Propagation Networks in a Social Media Environment. IEEE Transactions on Computational Social Systems, 3, 46-62. &gt;https://doi.org/10.1109/tcss.2016.2612980
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref75">
    <label>75</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Peng, X., Wu, J., Liu, R. and Xu, K. (2024) Rumor Detection on Social Media with Temporal Propagation Structure Optimization. arXiv: 2412.08316.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref76">
    <label>76</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Leão, J.C., Brandão, M.A., Vaz de Melo, P.O.S. and Laender, A.H.F. (2018) Who Is Really in My Social Circle? Mining Social Relationships to Improve Detection of Real Communities. Journal of Internet Services and Applications, 9, Article No. 20. &gt;https://doi.org/10.1186/s13174-018-0091-6
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref77">
    <label>77</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, M., Zuo, W. and Wang, Y. (2016) An Improved Density Peaks-Based Clustering Method for Social Circle Discovery in Social Networks. Neurocomputing, 179, 219-227. &gt;https://doi.org/10.1016/j.neucom.2015.11.091
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref78">
    <label>78</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Verbeke, W. and Wuyts, S. (2006) Moving in Social Circles—Social Circle Membership and Performance Implications. Journal of Organizational Behavior, 28, 357-379. &gt;https://doi.org/10.1002/job.423
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref79">
    <label>79</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Iswed, I.M., F., Y. and S., A. (2019) Boosted Constrained K-Means Algorithm for Social Networks Circles Analysis. International Journal of Advanced Computer Science and Applications, 10, 419-423. &gt;https://doi.org/10.14569/ijacsa.2019.0100758
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref80">
    <label>80</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, C., Hao, C. and Guan, X. (2020) Hierarchical and Overlapping Social Circle Identification in Ego Networks Based on Link Clustering. Neurocomputing, 381, 322-335. &gt;https://doi.org/10.1016/j.neucom.2019.11.080
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref81">
    <label>81</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Zhang, X., Ma, Z., Zhang, Z., Sun, Q. and Yan, J. (2018) A Review of Community Detection Algorithms Based on Modularity Optimization. Journal of Physics: Conference Series, 1069, Article ID: 012123. &gt;https://doi.org/10.1088/1742-6596/1069/1/012123
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref82">
    <label>82</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Ren, S., Zhang, S. and Wu, T. (2020) An Improved Spectral Clustering Community Detection Algorithm Based on Probability Matrix. Discrete Dynamics in Nature and Society, 2020, Article ID: 4540302. &gt;https://doi.org/10.1155/2020/4540302
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref83">
    <label>83</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Horne, B.D., Nørregaard, J. and Adalı, S. (2019) Different Spirals of Sameness: A Study of Content Sharing in Mainstream and Alternative Media. Proceedings of the International AAAI Conference on Web and Social Media, 13, 257-266. &gt;https://doi.org/10.1609/icwsm.v13i01.3227
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref84">
    <label>84</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Wang, L. and Guo, Y. (2019) An Evolution Model of Rumor Spreading Based on WeChat Social Circle. Journal of Information Processing Systems, 15, 1179-1191.
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref85">
    <label>85</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Palsetia, D., Patwary, M.M.A., Agrawal, A. and Choudhary, A. (2014) Excavating Social Circles via User Interests. Social Network Analysis and Mining, 4, Article No. 170. &gt;https://doi.org/10.1007/s13278-014-0170-z
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref86">
    <label>86</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Li, J., Li, R., Ni, S. and Kao, H. (2024) EPRD: Exploiting Prior Knowledge for Evidence-Providing Automatic Rumor Detection. Neurocomputing, 563, Article ID: 126935. &gt;https://doi.org/10.1016/j.neucom.2023.126935
    </mixed-citation>
   </ref>
   <ref id="scirp.142851-ref87">
    <label>87</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Sattarov, O. and Choi, J. (2024) Detection of Rumors and Their Sources in Social Networks: A Comprehensive Survey. IEEE Transactions on Big Data. &gt;https://doi.org/10.1109/tbdata.2024.3522801
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>