default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIsmail Ahmed A. Al-Hadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Samuel-Soma M. Ajibade, Bayan Issa, Muhammed Basheer Jasser, Farrukh Hassan, Ghassan Saleh ALDharhani, Ismail Ahmed Al-Qasem Al-Hadi, Kayode Akinlekan Akintoye, Almighty Cortezo Tabuena:
A Bibliometric Analysis and Research Landscape of Artificial Intelligence in Education. ICCSCE 2024: 304-309- 2023
- [c5]Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser
, Shamuhammet Rejepov, Hui Na Chua, Ahmad Sahban Rafsanjani, Ismail Ahmed Al-Qasem Al-Hadi:
An Optimized Hybrid Dragonfly Algorithm Applied for Solving the Optimal Reactive Power Dispatch Problem in Smart Grids. ICCSCE 2023: 269-274 - [c4]Muhammed Basheer Jasser, Lee Ming Zhen, Bayan Issa, Mee Hong Ling, Ismail Ahmed Al-Qasem Al-Hadi:
Quantifying Object-Oriented System Complexity: Introducing a Powerful Measurement Tool. ICSET 2023: 221-226 - 2021
- [j3]Waidah Ismail, Ismail Ahmed Al-Qasem Al-Hadi, Crina Grosan, Rimuljo Hendradi:
Improving patient rehabilitation performance in exercise games using collaborative filtering approach. PeerJ Comput. Sci. 7: e599 (2021) - [p1]Nurezayana Zainal, Ismail Ahmed Al-Qasem Al-Hadi, Safwan M. Ghaleb, Hafez Hussain, Waidah Ismail, Ali Y. Aldailamy:
Predicting MIRA Patients' Performance Using Virtual Rehabilitation Programme by Decision Tree Modelling. Recent Advances in Intelligent Systems and Smart Applications 2021: 451-462 - 2020
- [j2]Ismail Ahmed Al-Qasem Al-Hadi, Nurfadhlina Mohd Sharef, Md Nasir Sulaiman, Norwati Mustapha, Mehrbakhsh Nilashi:
Latent based temporal optimization approach for improving the performance of collaborative filtering. PeerJ Comput. Sci. 6: e331 (2020)
2010 – 2019
- 2018
- [c3]Ismail Ahmed Al-Qasem Al-Hadi, Nurfadhlina Mohd Sharef, Md Nasir Sulaiman, Norwati Mustapha:
Temporal Based Factorization Approach for Solving Drift and Decay in Sparse Scoring Matrix. SCDM 2018: 340-350 - 2017
- [c2]Ismail Ahmed Al-Qasem Al-Hadi, Nurfadhlina Mohd Sharef, Md Nasir Sulaiman, Norwati Mustapha:
Bacterial foraging optimization algorithm with temporal features to solve data sparsity in recommendation system. ICC 2017: 148:1-148:6 - 2016
- [j1]Ismail Ahmed A. Al-Hadi, Nurfadhlina Mohd Sharef, Md Nasir Sulaiman, Norwati Mustapha:
Ensemble Divide and Conquer Approach to Solve the Rating Scores' Deviation in Recommendation System. J. Comput. Sci. 12(6): 265-275 (2016) - 2011
- [c1]Ismail Ahmed A. Al-Hadi, Siti Zaiton Mohd Hashim, Siti Mariyam Hj. Shamsuddin:
Bacterial Foraging Optimization Algorithm for neural network learning enhancement. HIS 2011: 200-205
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
