Exploring Emotional Intelligence in Jordan’s Artificial Intelligence (AI) Healthcare Adoption: A UTAUT Framework
Keywords:
intelligence, Health, computer, engineering, managementAbstract
The integration of Artificial Intelligence (AI) has been reshaping healthcare globally. However, the AI adoption in Jordan is met with cautious progress. AI has shown substantial potential to enhance healthcare services and foster Emotional Intelligence (EI), especially in advanced economies. Despite its proven effectiveness elsewhere, the Jordanian populace is reluctant to adopt AI in the healthcare sector, with predictions for hospitalizations, medical consultations, and treatment recommendations being sluggish to gain acceptance. This study investigates the combination of Emotional Intelligence and AI adoption in the healthcare system in Jordan, guided by the Unified Theory of Acceptance and Use of Technology (UTAUT) model. In this study, a quantitative approach has been employed, whereby questionnaires were delivered through email and messaging apps to evaluate the impact of emotional intelligence on Jordanians’ willingness to adopt AI technology in the healthcare sector. The findings suggested that the UTAUT model should be further expanded to encompass emotional intelligence as its fifth construct, particularly in developing countries like Jordan, where user models for AI adoption are less explored. The implications of the study extend to healthcare planners and developers in Jordan, providing insights into factors that influence the successful adoption of AI technologies among diverse user groups. This study has provided valuable recommendations for developers of AI-based healthcare systems, enabling them to align their assistance with the perceptions and behaviors of Middle Eastern users.
Downloads
References
B. Alarcon, F. Emmes, C. Fuhs, J. Giesl, R. Gutierrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann, Improving Context-Sensitive Dependency Pairs. In Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR '08), Doha, Qatar, Lecture Notes in Artificial Intelligence, 2008. Springer-Verlag Extended version appeared as Technical Report AIB-2008-13, RWTH Aachen, Germany.
B. Alarcon, R. Gutierrez, and S. Lucas Context-Sensitive Dependency Pairs. In Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'06, Kolkata, India, Lecture Notes in Computer Science 4337, pages 298-309, 2006. Springer-Verlag
B. Alarcon, R. Gutierrez and S. Lucas, Improving the context-sensitive dependency graph. Electronic Notes in Theoretical Computer Science, 188:91-103, 2007, Elsevier.
T. Arts and J. Giesl, Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236:133-178, 2000.
F. Duran, S. Lucas, C. Marche, J. Meseguer, and X. Urbain Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation, 21(1-2):59-88, June 2008. Springer-Verlag
C. Fuhs, R. Navarro-Marset, C. Otto, J. Giesl, S. Lucas, P. Schneider-Kamp, Search Techniques for Rational Polynomial Orders. In Proceedings of the 9th International Conference on Artificial Intelligence and Symbolic Computation (AISC '08), Birmingham, UK, Lecture Notes in Computer Science 5144, pages 109-124, 2008. Springer-Verlag
J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke, Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning, 37(3): 155-203, 2006. Springer-Verlag.
F. Schernhammer and B. Gramlich Characterizing and Proving Operational Termination of Deterministic Conditional Term Rewriting Systems Technical Report E1852-2009-1, Vienna University of Technology. available here
P. Schneider-Kamp, R. Thiemann, E. Annov, M. Codish, and J. Giesl, Proving Termination using Recursive Path Orders and SAT Solving. In Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS '07), Liverpool, UK, Lecture Notes in Artificial Intelligence 4720, pages 267-282, 2007. ©Springer-Verlag
R. Thiemann and J. Giesl, The Size-Change Principle and Dependency Pairs for Termination of Term Rewriting. Applicable Algebra in Engineering, Communication and Computing, 16(4):229-270, 2005. Springer-Verlag.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.
IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
