Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hakeem Babalola Akande has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Integrating Honeypot and Intrusion Detection System to Enhance Threat Detection

    by Hakeem Babalola Akande, Agbotiname Lucky Imoize, Yousef Farhaoui, Joseph Bamidele Awotunde, Ayomide Jonathan Akintola

  • Performance Analysis of MIMO-OFDM Systems in 5G Wireless Networks

    by Akande Hakeem Babalola, Oloyede Ayopo Abdulkarim, Shakirat Aderonke Salihu, Taibat O. Adebakin


  • Top Cited Papers
    Open Access

    Utilizing an Attention-Based LSTM Model for Detecting Sarcasm and Irony in Social Media

    by Deborah Olaniyan, Roseline Oluwaseun Ogundokun, Olorunfemi Paul Bernard, Julius Olaniyan, Rytis Maskeliūnas, Hakeem Babalola Akande

    Sarcasm and irony represent intricate linguistic forms in social media communication, demanding nuanced comprehension of context and tone. In this study, we propose an advanced natural language processing methodology utilizing long short-term memory with an attention mechanism (LSTM-AM) to achieve an impressive accuracy of 99.86% in detecting and interpreting sarcasm and irony within social media text. Our approach involves innovating novel deep learning models adept at capturing subtle cues, contextual dependencies, and sentiment shifts inherent in sarcastic or ironic statements. Furthermore, we explore the potential of transfer learning from extensive language models and integrating multimodal information, such as emojis and images, to heighten the precision of sarcasm and irony detection. Rigorous evaluation against benchmark datasets and real-world social media content showcases the efficacy of our proposed models. The outcomes of this research hold paramount significance, offering a substantial advancement in comprehending intricate language nuances in digital communication. These findings carry profound implications for sentiment analysis, opinion mining, and an enhanced understanding of social media dynamics.


  • Open Access

    Review of: "Cloud Computing Paradigm in Academics"

    by Akande Hakeem

    This is an interesting paper just that: * There is need to give detail information about the 3 aforementioned analyzed cloud services which was used before choosing the best method used. * introductory part of the abstract need to be revisited. *...

  • Improving Optimization Prowess of Ant Colony Algorithm Using Bat Inspired Algorithm

    by Hakeem Babalola Akande, Oluwakemi Christiana Abikoye, Oluwatobi Noah Akande, Rasheed Gbenga Jimoh

    Metaheuristic algorithms such as Ant Colony Optimization (ACO) algorithm and Bat Optimization Algorithm (BOA) have been widely employed in solving different optimization problems in several fields. ACO is modelled based on the social behaviour of ants that look for appropriate answers to a given optimization issue by recasting it as the case of locating the least expensive path on a weighted graph. A set of parameters linked to graph components (either nodes or edges) whose values are changed by the ants during runtime constitute the pheromone model, which biases the stochastic solution generation process. However, the effectiveness of ACO declines as the quantity of packets rises, making them ineffective for reducing traffic congestion. As more packets are transmitted, their strength decreases, causing packet congestion, rendering them useless for reducing packet traffic congestion. On the contrary, BOA which was modelled after the behavior of bats has also been employed in fixing network routing issues by listening to every sound in a space and taking note of what is going on around it. In order to further improve ACO algorithm and decrease packet traffic congestion, packet loss, and the time it takes a packet to reach its destination in a network system, this study employs the strength of BOA. Results obtained revealed the prowess of BOA in improving the performance of ACO for network packet routing.