Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/37115
|
| Title: | 非對稱性加權之排名學習機制
Leaning to rank with asymmetric discordant penalty |
| Authors: | 王榮聖
Wang, Rung Sheng |
| Contributors: | 廖文宏
Liao, Wen Hung
王榮聖
Wang, Rung Sheng |
| Keywords: | 排名
排名學習
資料探勘
非對稱加權
Ranking
Learning to rank
Information retrival
Asymmetric weight
RealRankBoost |
| Date: | 2008 |
| Issue Date: | 2009-09-19 12:11:09 (UTC+8) |
| Abstract: | 資訊發達的時代，資訊取得的方式與管道比起以前更方便而多元，但龐大資料量同時也造成了我們往往很難找到真正需要資料的問題，也因此資料的排名(ranking)問題就變得十分重要。本研究目的在於運用排名學習找出良好的排名，利用人對於某特定議題所給予的排名順序找出排名規則，並應用於資料探勘上，讓電腦可自動對資料做評分，產生正確的排序，將有助於資料的搜尋。
本研究分為兩部分，第一部份為排名演算法的設計，我們改良現有的排名方法(RankBoost)，設計出另一個新的演算法(RealRankBoost)，並且用LETOR benchmark實測，作為與其他方法的比較和效果提升的證明；第二部份為非對稱加權概念的提出，我們考量排名位置所造成的資料被檢視機率不同，而給予不同的權重，使排名結果能更貼近人類的角度。
With the innovation in computer technology, we have easier ways to access information. But the huge amount of data also makes it hard for us to find what we really want. This is why ranking is important to us. The central issues of many applications are ranking, such as document retrieval, expert finding, and anti spam. The objective of this thesis is to discover a good ranking function according to specific ranking order of the human perceptions. We employ the learning-to-rank approach to automatically score and generate ranking order that helps data searching.
This thesis is divided into two parts. Firstly, we design a new learning-to-rank algorithm named RealRankBoost based on an existing method (RankBoost). We investigate the efficacy of the proposed method by performing comparative analysis using the LETOR benchmark. Secondly, we propose to assign asymmetric weightings for ranking in the sense that incorrect placement of top-ranked items should yield higher penalty. Incorporation of the asymmetric weighting technique will further make our system to mimic human ranking strategy. |
| Reference: | [1]Thorsten Joachims, “Optimizing Search Engines using Clickthrough Data,” Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), ACM, pp.133-142, 2002
[2]Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, Hang Li, “Learning to Rank: From Pairwise Approach to Listwise Approach,” Proceedings of the 24th international conference on Machine learning (ICML), pp. 129-136, 2007
[3]Ping Li, Christopher J.C. Burges, Qiang Wu, “McRank: Learning to Rank Using Multiple Classification and Gradient Boosting,” Neural Information Processing Systems(NIPS), pp. 897-904, 2007
[4]Yoav Freund, Raj Iyer, Robert E. Schapire, Yoram Singer, “An Efficient Boosting Algorithm for Combining Preferences,” International Conference on Machine Learning, 1998
[5]Ming-Feng Tsai, Tie-Yan Liu, Tao Qin, Hsin-Hsi Chen, Wei-Ying Ma, “FRank: A Ranking Method with Fidelity Loss,” Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 383-390, 2007
[6]Jun Xu, Hang Li, “AdaRank: A Boosting Algorithm for Information Retrieval,” Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 391-398, 2007
[7]Christopher J.C. Burges, “A Tutorial on Support Vector Machines for Pattern Recognition,” Data Mining and Knowledge Discovery 2, pp. 121-167, 1998
[8]Robert E. Schapire, Yoram Singer, “Improved Boosting Algorithms Using Confidence-rated Predictions,” Machine Learning, 37(3), pp. 297-336, 1999
[9]Maurice George Kendall, “Rank Correlation Methods,” Hafner, 1955
[10]Frank Rosenblatt, “The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain,” Cornell Aeronautical Laboratory, Psychological Review, v65, No. 6, pp. 386-408, 1958
[11]Marvin Minsky, Seymour Papert, “Perceptrons” Neurocomputing: foundations of research, MIT Press, pp. 157-169, 1988
[12]Jooyoung Park, Irwin W Sandberg, “Universal Approximation Using Radial- Basis-Function Networks,” Neural Computation, MIT Press, pp. 246-257, 1991
[13]J.A. Leonard, M.A. Kramer, L.H. Ungar, “Using Radial Basis Functions to Approximate a Function and Its Error Bounds,” IEEE Transactions on Neural Networks, pp. 207-224, 1991
[14]Tie-Yan Liu, Tao Qin, Jun Xu, Wenying Xiong and Hang Li, “LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval,” LR4IR 2007, in conjunction with SIGIR 2007, 2007
[15]William Hersh, Chris Buckley, T. J. Leone, David Hickam, “OHSUMED: An Interactive Retrieval Evaluation and New Large Test Collection for Research,” Proceedings of the 17th Annual ACM SIGIR Conference, pp. 192-201, 1994
[16]Nick Craswell, David Hawking, “Overview of the TREC 2004 Web Track,” The 13th Text Retrieval Conference (TREC 2004), 2004
[17]Stephen E. Robertson, “Overview of the okapi projects,” Journal of Documentation, Vol. 53, No. 1, pp.3-7, 1997 |
| Description: | 碩士
國立政治大學
資訊科學學系
96753004
97 |
| Source URI: | http://thesis.lib.nccu.edu.tw/record/#G0096753004 |
| Data Type: | thesis |
| Appears in Collections: | [資訊科學系] 學位論文
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
