An e-Learning Services Discovery Algorithm Based on User Satisfaction

Zheng-Zhou Zhu, Zhongfu Wu, Shangbo Zhou
{"title":"An e-Learning Services Discovery Algorithm Based on User Satisfaction","authors":"Zheng-Zhou Zhu, Zhongfu Wu, Shangbo Zhou","doi":"10.1109/NAS.2008.36","DOIUrl":null,"url":null,"abstract":"There are more and more Web services used in collaborative learning, hence it has become increasingly important to locate proper Web services in an accurate and efficient way. In this paper, an annexed algorithm, called eLSDAUS, is proposed to improve the existing semantic-based matchmaking algorithm. In the algorithm, we introduce and incorporate in a new factor - user satisfaction, which is the user's level of satisfaction about the result of service discovery. This algorithm allows users to take part in the process of e-Learning service discovery, and evaluate the result of service discovery. User's evaluation in the form of user satisfaction is fed back to the system. Adopting an amendatory function that takes the user satisfaction as an input, the system modifies the weights of each property of the advertise service, and then total match degree of service discovery up to best. Experiment indicates that the precision of the service discovery improved 5 percent as the number of advertisement services up to 1000. After learning for one week, over 93% students are satisfied with the e-Learning service discovery result.","PeriodicalId":153238,"journal":{"name":"2008 International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Networking, Architecture, and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2008.36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

There are more and more Web services used in collaborative learning, hence it has become increasingly important to locate proper Web services in an accurate and efficient way. In this paper, an annexed algorithm, called eLSDAUS, is proposed to improve the existing semantic-based matchmaking algorithm. In the algorithm, we introduce and incorporate in a new factor - user satisfaction, which is the user's level of satisfaction about the result of service discovery. This algorithm allows users to take part in the process of e-Learning service discovery, and evaluate the result of service discovery. User's evaluation in the form of user satisfaction is fed back to the system. Adopting an amendatory function that takes the user satisfaction as an input, the system modifies the weights of each property of the advertise service, and then total match degree of service discovery up to best. Experiment indicates that the precision of the service discovery improved 5 percent as the number of advertisement services up to 1000. After learning for one week, over 93% students are satisfied with the e-Learning service discovery result.
基于用户满意度的电子学习服务发现算法
协作学习中使用的Web服务越来越多,因此以准确有效的方式定位适当的Web服务变得越来越重要。本文提出了一种附加算法eLSDAUS,以改进现有的基于语义的匹配算法。在该算法中,我们引入并纳入了一个新的因素——用户满意度,即用户对服务发现结果的满意程度。该算法允许用户参与到e-Learning服务发现的过程中,并对服务发现的结果进行评价。用户的评价以用户满意度的形式反馈给系统。系统采用以用户满意度为输入的修正函数,对广告服务各属性的权重进行修改,使服务发现的总匹配度达到最佳。实验表明,当广告服务数量达到1000个时,服务发现的精度提高了5%。经过一周的学习,超过93%的学生对e-Learning服务发现结果感到满意。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信