Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Computer Engineering》 2015-09
Add to Favorite Get Latest Update

Online Evaluation Algorithm of Sorting Device Based on K-armed Dueling Bandits Problem

DENG Xiaojun;MAN Junfeng;OUYANG Min;College of Computer and Communication,Hunan University of Technology;  
According to evaluate various sorting devices,one can choose optimal sorting devices,and provide users with better ordered results for personalized retrieval requests based on these optimal sorting devices.In order to improve the performance of evaluation of sorting devices,this paper proposes a sampling-based efficient K-armed dueling bandits algorithm.According to current researches,it formalizes the evaluation of sorting devices as the problem of Karmed dueling bandits,and analyzes the goals of the problem under both explore-then-exploit and ongoing regret minimization models.The algorithm simulates tournament based on sampling and chooses the winner,then chooses challenger according to upper confidence bound,and at last,compares the winner and the challenger using interleaved comparison,and gets the score matrix.Experimental results show that,compared with SAVAGE algorithm and RUCB algorithm,the proposed algorithm has higher detection accuracy,less cumulative regret,and better stability.
【Fund】: 国家自然科学基金资助项目(61350011);; 湖南省自然科学基金资助项目(2015JJ2046 2014JJ2115);; 湖南省教育厅科研基金资助项目(12C0068)
【CateGory Index】: TP391.3
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved