Boosting the ranking function learning process using clustering Export

@inproceedings{citeulike:4223624, abstract = {As the Web continuously grows, the results returned by search engines are too many to review. Lately, the problem of personalizing the ranked result list based on user feedback has gained a lot of attention. Such approaches usually require a big amount of user feedback on the results, which is used as training data. In this work, we present a method that overcomes this issue by exploiting all search results, both rated and unrated, in order to train a ranking function. Given a small initial set of user feedback for some search results, we first perform clustering on all results returned by the search. Based on the clusters created, we extend the initial set of rated results, including new, unrated results. Then, we use a popular training method (Ranking SVM) to train a ranking function using the expanded set of results. The experiments show that our method approximates sufficiently the results of an "ideal" system where all results of each query should be rated in order to be used as training data, something that is not feasible in a real-world scenario.}, address = {New York, NY, USA}, author = {Giannopoulos, Giorgos and Dalamagas, Theodore and Eirinaki, Magdalini and Sellis, Timos}, booktitle = {WIDM '08: Proceeding of the 10th ACM workshop on Web information and data management}, citeulike-article-id = {4223624}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1458523}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1458502.1458523}, doi = {10.1145/1458502.1458523}, isbn = {978-1-60558-260-3}, keywords = {clustering, learning2rank, rankingsvm}, location = {Napa Valley, California, USA}, pages = {125--132}, posted-at = {2009-03-26 19:37:29}, priority = {2}, publisher = {ACM}, title = {Boosting the ranking function learning process using clustering}, url = {http://dx.doi.org/10.1145/1458502.1458523}, year = {2008} }

TY - CONF ID - citeulike:4223624 L3 - citeulike-article-id:4223624 N2 - As the Web continuously grows, the results returned by search engines are too many to review. Lately, the problem of personalizing the ranked result list based on user feedback has gained a lot of attention. Such approaches usually require a big amount of user feedback on the results, which is used as training data. In this work, we present a method that overcomes this issue by exploiting all search results, both rated and unrated, in order to train a ranking function. Given a small initial set of user feedback for some search results, we first perform clustering on all results returned by the search. Based on the clusters created, we extend the initial set of rated results, including new, unrated results. Then, we use a popular training method (Ranking SVM) to train a ranking function using the expanded set of results. The experiments show that our method approximates sufficiently the results of an "ideal" system where all results of each query should be rated in order to be used as training data, something that is not feasible in a real-world scenario. CY - Napa Valley, California, USA SN - 978-1-60558-260-3 AD - New York, NY, USA EP - 132 TI - Boosting the ranking function learning process using clustering PB - ACM T2 - WIDM '08: Proceeding of the 10th ACM workshop on Web information and data management SP - 125 KW - clustering KW - learning2rank KW - rankingsvm AU - Giannopoulos, Giorgos AU - Dalamagas, Theodore AU - Eirinaki, Magdalini AU - Sellis, Timos PY - 2008/// UR - http://dx.doi.org/10.1145/1458502.1458523 ER -