B. E. Ghali, A. E. Qadi, M. Ouadou, D. Aboutajdine
{"title":"概率查询扩展方法使用推荐的过去用户查询","authors":"B. E. Ghali, A. E. Qadi, M. Ouadou, D. Aboutajdine","doi":"10.1109/INTECH.2012.6457806","DOIUrl":null,"url":null,"abstract":"A plenty of Query Expansion techniques have been proposed to solve the problems of information retrieval systems, but new challenges has been introduced for these methods of expansion of user queries because of the rapid growth of the size of the Web collection. In this paper we have focused our attention on the improvement of the precision of the user query by a Probabilistic Query Expansion Method. Our approach consists on the use of information contained in query logs, which includes past user queries and their clicked documents, for providing high-level recommendations. The experiment results shows that the precision of the short queries increases even if we add a few terms, but the same number of terms added don't affect the long queries precision as much as for the short queries.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Probabilistic Query Expansion method using recommended past user queries\",\"authors\":\"B. E. Ghali, A. E. Qadi, M. Ouadou, D. Aboutajdine\",\"doi\":\"10.1109/INTECH.2012.6457806\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A plenty of Query Expansion techniques have been proposed to solve the problems of information retrieval systems, but new challenges has been introduced for these methods of expansion of user queries because of the rapid growth of the size of the Web collection. In this paper we have focused our attention on the improvement of the precision of the user query by a Probabilistic Query Expansion Method. Our approach consists on the use of information contained in query logs, which includes past user queries and their clicked documents, for providing high-level recommendations. The experiment results shows that the precision of the short queries increases even if we add a few terms, but the same number of terms added don't affect the long queries precision as much as for the short queries.\",\"PeriodicalId\":369113,\"journal\":{\"name\":\"Second International Conference on the Innovative Computing Technology (INTECH 2012)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on the Innovative Computing Technology (INTECH 2012)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INTECH.2012.6457806\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTECH.2012.6457806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Probabilistic Query Expansion method using recommended past user queries
A plenty of Query Expansion techniques have been proposed to solve the problems of information retrieval systems, but new challenges has been introduced for these methods of expansion of user queries because of the rapid growth of the size of the Web collection. In this paper we have focused our attention on the improvement of the precision of the user query by a Probabilistic Query Expansion Method. Our approach consists on the use of information contained in query logs, which includes past user queries and their clicked documents, for providing high-level recommendations. The experiment results shows that the precision of the short queries increases even if we add a few terms, but the same number of terms added don't affect the long queries precision as much as for the short queries.