{"title":"会话查询聚合","authors":"Dongyi Guan, G. Yang","doi":"10.1145/2665994.2666001","DOIUrl":null,"url":null,"abstract":"Session search retrieves documents for a sequence of queries in a session. Prior research demonstrated that query aggregation is an effective technique for session search. This paper proposes a novel query aggregation scheme based on the discount factor in reinforcement learning. Moreover, we compare various query aggregation schemes and investigate the best scheme for aggregating queries in session search. Evaluation conducted over TREC 2011 and 2012 shows that the proposed scheme works the best and outperforms the TREC best system as well as learned weights by learning to rank.","PeriodicalId":346862,"journal":{"name":"DUBMOD '14","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Query Aggregation in Session Search\",\"authors\":\"Dongyi Guan, G. Yang\",\"doi\":\"10.1145/2665994.2666001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Session search retrieves documents for a sequence of queries in a session. Prior research demonstrated that query aggregation is an effective technique for session search. This paper proposes a novel query aggregation scheme based on the discount factor in reinforcement learning. Moreover, we compare various query aggregation schemes and investigate the best scheme for aggregating queries in session search. Evaluation conducted over TREC 2011 and 2012 shows that the proposed scheme works the best and outperforms the TREC best system as well as learned weights by learning to rank.\",\"PeriodicalId\":346862,\"journal\":{\"name\":\"DUBMOD '14\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DUBMOD '14\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2665994.2666001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DUBMOD '14","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2665994.2666001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Session search retrieves documents for a sequence of queries in a session. Prior research demonstrated that query aggregation is an effective technique for session search. This paper proposes a novel query aggregation scheme based on the discount factor in reinforcement learning. Moreover, we compare various query aggregation schemes and investigate the best scheme for aggregating queries in session search. Evaluation conducted over TREC 2011 and 2012 shows that the proposed scheme works the best and outperforms the TREC best system as well as learned weights by learning to rank.