检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国电子科技集团公司第三十研究所,四川成都610041 [2]西南交通大学,四川成都610031 [3]电子科技大学,四川成都611731
出 处:《电子学报》2015年第11期2145-2150,共6页Acta Electronica Sinica
基 金:国家"973"重点基础研究发展计划(No.2013CB329103);国家自然科学基金(No.61201129;No.61271171;No.61001084);长江学者和创新团队发展计划;高等学校学科创新引智计划资助(No.B14039)
摘 要:针对如何为互联网用户从多个相同或相似的服务中进行选择的问题,提出了一种新的服务选择算法:基于Qo E(Quality of Experience)量化评估的服务选择算法(A Service Selecting Algorithm Based on Quantified Qo E Evaluation,ASSABQ).该算法基于一种层次化评分模型,从历史评分中学习获取用户偏好,根据多种评价因素计算每个可用服务的满意度,并选择满意度最高的服务给用户.与已知算法相比,ASSABQ算法的复杂度从O(n2)下降到O(n).仿真实验结果表明,在相同应用场景下,采用ASSABQ算法得到的用户满意度比已知算法提高约10%.Aiming at the problem of selecting a better service with the same or similar functions,one method is considering the users' experiences on the service quality. Then an algorithm called A Service Selecting Algorithm Based on Quantified Qo E Evaluation( ASSABQ) is proposed. The algorithm is deduced from a hierarchy rating model and the corresponding user preferences. User preferences can be acquired from analyzing the statistical data of users' satisfaction feedbacks. Each service is rated with a satisfaction score according to the algorithm. The highest scored service will be selected to the user. Experiments compare the algorithm with both different configurations and algorithms. Compared to FCE-RS algorithm,the algorithm complexity of ASSABQ is improved from O( n^2) to O( n),and the user satisfaction ratio is elevated by 10% in the same simulation scenario.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145