IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v33y2022i06ns012918312250084x.html
   My bibliography  Save this article

Intelligent gravitational search random forest algorithm for fake news detection

Author

Listed:
  • Rathika Natarajan

    (Department of Electronics and Communication Engineering, Jaya Institute of Technology, Thiruthani, Thiruvallur, Tamilnadu, India)

  • Abolfazl Mehbodniya

    (Department of Electronics and Communications Engineering, Kuwait College of Science and Technology, Doha Area, 7th Ring Road, Kuwait)

  • Kantilal Pitambar Rane

    (Department of Electronics and Telecom Engineering, KCE Society’s College of Engineering and Information Technology, Jalgaon, Maharashtra 425001, India)

  • Sonika Jindal

    (Department of Computer Science and Engineering, Shaheed Bhagat Singh State University, Firozpur, Punjab 152001, India)

  • Mohammed Faez Hasan

    (Department of Finance and Banking Sciences, Kerbala University, Karbala 56001, Iraq)

  • Luis Vives

    (Department of Computer Science, Peruvian University of Applied Sciences, Lima 15023, Peru)

  • Abhishek Bhatt

    (Department of Electronics and Telecommunication, College of Engineering Pune, Maharashtra 411005, India)

Abstract

Online social media has made the process of disseminating news so quick that people have shifted their way of accessing news from traditional journalism and press to online social media sources. The rapid rotation of news on social media makes it challenging to evaluate its reliability. Fake news not only erodes public trust but also subverts their opinions. An intelligent automated system is required to detect fake news as there is a tenuous difference between fake and real news. This paper proposes an intelligent gravitational search random forest (IGSRF) algorithm to be employed to detect fake news. The IGSRF algorithm amalgamates the Intelligent Gravitational Search Algorithm (IGSA) and the Random Forest (RF) algorithm. The IGSA is an improved intelligent variant of the classical gravitational search algorithm (GSA) that adds information about the best and worst gravitational mass agents in order to retain the exploitation ability of agents at later iterations and thus avoid the trapping of the classical GSA in local optimum. In the proposed IGSRF algorithm, all the intelligent mass agents determine the solution by generating decision trees (DT) with a random subset of attributes following the hypothesis of random forest. The mass agents generate the collection of solutions from solution space using random proportional rules. The comprehensive prediction to decide the class of news (fake or real) is determined by all the agents following the attributes of random forest. The performance of the proposed algorithm is determined for the FakeNewsNet dataset, which has sub-categories of BuzzFeed and PolitiFact news categories. To analyze the effectiveness of the proposed algorithm, the results are also evaluated with decision tree and random forest algorithms. The proposed IGSRF algorithm has attained superlative results compared to the DT, RF and state-of-the-art techniques.

Suggested Citation

  • Rathika Natarajan & Abolfazl Mehbodniya & Kantilal Pitambar Rane & Sonika Jindal & Mohammed Faez Hasan & Luis Vives & Abhishek Bhatt, 2022. "Intelligent gravitational search random forest algorithm for fake news detection," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 33(06), pages 1-19, June.
  • Handle: RePEc:wsi:ijmpcx:v:33:y:2022:i:06:n:s012918312250084x
    DOI: 10.1142/S012918312250084X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S012918312250084X
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S012918312250084X?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:ijmpcx:v:33:y:2022:i:06:n:s012918312250084x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.