{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:01:55Z","timestamp":1742994115519,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030722395"},{"type":"electronic","value":"9783030722401"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72240-1_25","type":"book-chapter","created":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T14:49:01Z","timestamp":1617288541000},"page":"272-279","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SQE-GAN: A Supervised Query Expansion Scheme via GAN"],"prefix":"10.1007","author":[{"given":"Tianle","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2382-6289","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,30]]},"reference":[{"issue":"4","key":"25_CR1","first-page":"357","volume":"20","author":"G Amati","year":"2003","unstructured":"Amati, G.: Probability models for information retrieval based on divergence from randomness. Univ. Glasgow 20(4), 357\u2013389 (2003)","journal-title":"Univ. Glasgow"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Burges, C.J.C., et al.: Learning to rank using gradient descent. In: ICML, pp. 89\u201396 (2005)","DOI":"10.1145\/1102351.1102363"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Cao, G., Nie, J.Y., Gao, J., Robertson, S.: Selecting good expansion terms for pseudo-relevance feedback. In: SIGIR, pp. 243\u2013250 (2008)","DOI":"10.1145\/1390334.1390377"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2071389.2071390","volume":"44","author":"C Carpineto","year":"2013","unstructured":"Carpineto, C., Romano, G.: A survey of automatic query expansion in information retrieval. ACM Comput. Surv. 44(1), 1\u201350 (2013)","journal-title":"ACM Comput. Surv."},{"key":"25_CR5","unstructured":"Devlin, J., Chang, M., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: NAACL, pp. 4171\u20134186 (2019)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Gao, J., Xu, G., Xu, J.: Query expansion using path-constrained random walks. In: SIGIR, pp. 563\u2013572 (2013)","DOI":"10.1145\/2484028.2484058"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Imani, A., Vakili, A., Montazer, A., Shakery, A.: Deep neural networks for query expansion using word embeddings. In: ECIR, pp. 203\u2013210 (2019)","DOI":"10.1007\/978-3-030-15719-7_26"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: KDD, pp. 133\u2013142 (2002)","DOI":"10.1145\/775047.775067"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Training linear SVMs in linear time. In: KDD, pp. 217\u2013226 (2006)","DOI":"10.1145\/1150402.1150429"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Karras, T., Laine, S., Aila, T.: A style-based generator architecture for generative adversarial networks. In: CVPR, pp. 4401\u20134410 (2019)","DOI":"10.1109\/CVPR.2019.00453"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Lee, C.J., Chen, R.C., Kao, S.H., Cheng, P.J.: A term dependency-based approach for query terms ranking. In: CIKM, pp. 1267\u20131276 (2009)","DOI":"10.1145\/1645953.1646114"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Li, J., Luong, M., Jurafsky, D.: A hierarchical neural autoencoder for paragraphs and documents. In: ACL, pp. 1106\u20131115 (2015)","DOI":"10.3115\/v1\/P15-1107"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Luong, T., Pham, H., Manning, C.D.: Effective approaches to attention-based neural machine translation. In: EMNLP, pp. 1412\u20131421 (2015)","DOI":"10.18653\/v1\/D15-1166"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Lv, Y., Zhai, C.X., Chen, W.: A boosting approach to improving pseudo-relevance feedback. In: SIGIR, pp. 165\u2013174 (2011)","DOI":"10.1145\/2009916.2009942"},{"key":"25_CR15","first-page":"852","volume":"61","author":"CD Manning","year":"2009","unstructured":"Manning, C.D.: Introduction to information retrieval. J. Am. Soc. Inf. Sci. Technol. 61, 852\u2013853 (2009)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"25_CR16","unstructured":"Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. In: ICLR (2013)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Peters, M.E., et al.: Deep contextualized word representations. In: NAACL, pp. 2227\u20132237 (2018)","DOI":"10.18653\/v1\/N18-1202"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Victor Lavrenko, W.B.C.: Relevance-based language models. In: SIGIR, pp. 120\u2013127 (2001)","DOI":"10.1145\/383952.383972"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Wang, J., et al.: IRGAN: a minimax game for unifying generative and discriminative information retrieval models. In: SIGIR, pp. 515\u2013524 (2017)","DOI":"10.1145\/3077136.3080786"},{"key":"25_CR20","first-page":"229","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Zaiem, S., Sadat, F.: Sequence to sequence learning for query expansion. In: AAAI, pp. 10075\u201310076 (2019)","DOI":"10.1609\/aaai.v33i01.330110075"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Wang, Q., Si, L., Gao, J.: Learning for efficient supervised query expansion via two-stage feature selection. In: SIGIR, pp. 265\u2013274 (2016)","DOI":"10.1145\/2911451.2911539"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72240-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T04:39:51Z","timestamp":1671770391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72240-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030722395","9783030722401"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72240-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ecir2021.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"436","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}