Advancing explainable MOOC recommendation systems: a morphological operations-based framework on partially ordered neutrosophic fuzzy hypergraphs

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Mehbooba Shareef, Babita Roslind Jose, Jimson Mathew, Dayananda Pruthviraja
{"title":"Advancing explainable MOOC recommendation systems: a morphological operations-based framework on partially ordered neutrosophic fuzzy hypergraphs","authors":"Mehbooba Shareef,&nbsp;Babita Roslind Jose,&nbsp;Jimson Mathew,&nbsp;Dayananda Pruthviraja","doi":"10.1007/s10462-024-11018-4","DOIUrl":null,"url":null,"abstract":"<div><p>Recommendation systems constitute an integral part of nearly all digital service platforms. However, the common assumption in most recommendation systems in the literature is that similar users will be interested in similar items. This assumption holds only sometimes due to the inherent inhomogeneity of user-item interactions. To address this challenge, we introduce a novel recommendation system that leverages partially ordered neutrosophic hypergraphs to model higher-order relationships among users and items. The partial ordering of nodes enables the system to develop efficient top-N recommendations with very high Normalized Discounted Cumulative Gain (NDCG). Our approach incorporates the morphological operation of dilation, applied to user clusters obtained through fuzzy spectral clustering of the hypergraph, to generate the requisite number of recommendations. Explanations for recommendations are obtained through morphological erosion applied on the dual of the embedded hypergraph. Through rigorous testing in educational and e-commerce domains, it has been proved that our method outperforms state-of-the-art techniques and demonstrates excellent performance for various evaluation parameters. The NDCG value, a measure of ranking quality, surpasses 0.10, and the Hit Ratio (HR) consistently falls within the range of 0.25 to 0.30. The Root Mean Square Error (RMSE) values are minimal, reaching as low as 0.4. These results collectively position our algorithm as a good choice for generating recommendations with proper explanations, making it a promising solution for real-world applications.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"58 2","pages":""},"PeriodicalIF":10.7000,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10462-024-11018-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-024-11018-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Recommendation systems constitute an integral part of nearly all digital service platforms. However, the common assumption in most recommendation systems in the literature is that similar users will be interested in similar items. This assumption holds only sometimes due to the inherent inhomogeneity of user-item interactions. To address this challenge, we introduce a novel recommendation system that leverages partially ordered neutrosophic hypergraphs to model higher-order relationships among users and items. The partial ordering of nodes enables the system to develop efficient top-N recommendations with very high Normalized Discounted Cumulative Gain (NDCG). Our approach incorporates the morphological operation of dilation, applied to user clusters obtained through fuzzy spectral clustering of the hypergraph, to generate the requisite number of recommendations. Explanations for recommendations are obtained through morphological erosion applied on the dual of the embedded hypergraph. Through rigorous testing in educational and e-commerce domains, it has been proved that our method outperforms state-of-the-art techniques and demonstrates excellent performance for various evaluation parameters. The NDCG value, a measure of ranking quality, surpasses 0.10, and the Hit Ratio (HR) consistently falls within the range of 0.25 to 0.30. The Root Mean Square Error (RMSE) values are minimal, reaching as low as 0.4. These results collectively position our algorithm as a good choice for generating recommendations with proper explanations, making it a promising solution for real-world applications.

推荐系统几乎是所有数字服务平台的组成部分。然而,文献中大多数推荐系统的共同假设是,相似的用户会对相似的项目感兴趣。由于用户与物品之间互动的内在不一致性,这一假设有时并不成立。为了应对这一挑战,我们引入了一种新颖的推荐系统,利用部分有序中性超图来模拟用户和物品之间的高阶关系。节点的部分排序使该系统能够开发出具有极高归一化贴现累积收益(NDCG)的高效 Top-N 推荐。我们的方法结合了扩张的形态学操作,应用于通过超图的模糊谱聚类获得的用户聚类,以生成必要数量的推荐。通过对嵌入超图的对偶进行形态侵蚀,可获得推荐的解释。通过在教育和电子商务领域的严格测试,证明我们的方法优于最先进的技术,并在各种评估参数方面表现出卓越的性能。衡量排名质量的 NDCG 值超过了 0.10,命中率(HR)始终在 0.25 至 0.30 之间。均方根误差(RMSE)值极小,低至 0.4。这些结果共同将我们的算法定位为生成具有适当解释的推荐的良好选择,使其成为现实世界应用中的一个有前途的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信