{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:03:58Z","timestamp":1743102238269,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031466762"},{"type":"electronic","value":"9783031466779"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-46677-9_2","type":"book-chapter","created":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:02:29Z","timestamp":1699102949000},"page":"15-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improving Open-Domain Answer Sentence Selection by\u00a0Distributed Clients with\u00a0Privacy Preservation"],"prefix":"10.1007","author":[{"given":"Weikuan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Blumenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guodong","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,5]]},"reference":[{"unstructured":"Allam, A.M.N., Haggag, M.H.: The question answering systems: a survey (2016)","key":"2_CR1"},{"unstructured":"Berant, J., Chou, A., Frostig, R., Liang, P.: Semantic parsing on Freebase from question-answer pairs. In: Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pp. 1533\u20131544. Association for Computational Linguistics, Seattle, Washington, USA, October 2013. https:\/\/aclanthology.org\/D13-1160","key":"2_CR2"},{"unstructured":"Bird, S., Klein, E., Loper, E.: Natural language processing with Python: analyzing text with the natural language toolkit. O\u2019Reilly Media, Inc. (2009)","key":"2_CR3"},{"doi-asserted-by":"crossref","unstructured":"Chen, D., Fisch, A., Weston, J., Bordes, A.: Reading wikipedia to answer open-domain questions. In: ACL (2017)","key":"2_CR4","DOI":"10.18653\/v1\/P17-1171"},{"doi-asserted-by":"publisher","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 4171\u20134186. Association for Computational Linguistics, Minneapolis, Minnesota, June 2019. https:\/\/doi.org\/10.18653\/v1\/N19-1423. https:\/\/aclanthology.org\/N19-1423","key":"2_CR5","DOI":"10.18653\/v1\/N19-1423"},{"doi-asserted-by":"publisher","unstructured":"Gao, L., Callan, J.: Unsupervised corpus aware language model pre-training for dense passage retrieval. In: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 2843\u20132853. Association for Computational Linguistics, Dublin, Ireland, May 2022. https:\/\/doi.org\/10.18653\/v1\/2022.acl-long.203. https:\/\/aclanthology.org\/2022.acl-long.203","key":"2_CR6","DOI":"10.18653\/v1\/2022.acl-long.203"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-030-72113-8_10","volume-title":"Advances in Information Retrieval","author":"L Gao","year":"2021","unstructured":"Gao, L., Dai, Z., Chen, T., Fan, Z., Van Durme, B., Callan, J.: Complement lexical retrieval model with semantic residual embeddings. In: Hiemstra, D., Moens, M.-F., Mothe, J., Perego, R., Potthast, M., Sebastiani, F. (eds.) ECIR 2021. LNCS, vol. 12656, pp. 146\u2013160. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72113-8_10"},{"doi-asserted-by":"crossref","unstructured":"Garg, S., Vu, T., Moschitti, A.: Tanda: transfer and adapt pre-trained transformer models for answer sentence selection. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, pp. 7780\u20137788 (2020)","key":"2_CR8","DOI":"10.1609\/aaai.v34i05.6282"},{"unstructured":"Ge, S., Wu, F., Wu, C., Qi, T., Huang, Y., Xie, X.: Fedner: privacy-preserving medical named entity recognition with federated learning. ArXiv abs\/2003.09288 (2020)","key":"2_CR9"},{"unstructured":"Guu, K., Lee, K., Tung, Z., Pasupat, P., Chang, M.W.: Realm: retrieval-augmented language model pre-training. In: Proceedings of the 37th International Conference on Machine Learning. ICML 2020, JMLR.org (2020)","key":"2_CR10"},{"unstructured":"Guu, K., Lee, K., Tung, Z., Pasupat, P., Chang, M.W.: Realm: Retrieval-augmented language model pre-training. ArXiv abs\/2002.08909 (2020)","key":"2_CR11"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S1351324903003176","volume":"9","author":"SM Harabagiu","year":"2003","unstructured":"Harabagiu, S.M., Maiorano, S.J., Pasca, M.: Open-domain textual question answering techniques. Nat. Lang. Eng. 9, 231\u2013267 (2003)","journal-title":"Nat. Lang. Eng."},{"unstructured":"Hardy, S., et al.: Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption. ArXiv abs\/1711.10677 (2017)","key":"2_CR13"},{"doi-asserted-by":"crossref","unstructured":"Huang, J.T., et al.: Embedding-based retrieval in facebook search. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2553\u20132561 (2020)","key":"2_CR14","DOI":"10.1145\/3394486.3403305"},{"doi-asserted-by":"publisher","unstructured":"Jiang, D., et al.: Federated topic modeling. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, pp. 1071\u20131080. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3357384.3357909. https:\/\/doi.org\/10.1145\/3357384.3357909","key":"2_CR15","DOI":"10.1145\/3357384.3357909"},{"doi-asserted-by":"publisher","unstructured":"Johnson, J., Douze, M., Jegou, H.: Billion-scale similarity search with gpus. IEEE Trans. Big Data 7(03), 535\u2013547 (2021). https:\/\/doi.org\/10.1109\/TBDATA.2019.2921572","key":"2_CR16","DOI":"10.1109\/TBDATA.2019.2921572"},{"doi-asserted-by":"publisher","unstructured":"Karpukhin, V., et al.: Dense passage retrieval for open-domain question answering. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 6769\u20136781. Association for Computational Linguistics, Online, November 2020. https:\/\/doi.org\/10.18653\/v1\/2020.emnlp-main.550. https:\/\/aclanthology.org\/2020.emnlp-main.550","key":"2_CR17","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"doi-asserted-by":"crossref","unstructured":"Kwiatkowski, T., et al.: Natural questions: a benchmark for question answering research. Transactions of the Association of Computational Linguistics (2019)","key":"2_CR18","DOI":"10.1162\/tacl_a_00276"},{"doi-asserted-by":"publisher","unstructured":"Lee, J., Sung, M., Kang, J., Chen, D.: Learning dense representations of phrases at scale. In: Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pp. 6634\u20136647. Association for Computational Linguistics, Online, August 2021. https:\/\/doi.org\/10.18653\/v1\/2021.acl-long.518. https:\/\/aclanthology.org\/2021.acl-long.518","key":"2_CR19","DOI":"10.18653\/v1\/2021.acl-long.518"},{"doi-asserted-by":"crossref","unstructured":"Lee, J., Yun, S., Kim, H., Ko, M., Kang, J.: Ranking paragraphs for improving answer recall in open-domain question answering. In: EMNLP (2018)","key":"2_CR20","DOI":"10.18653\/v1\/D18-1053"},{"doi-asserted-by":"crossref","unstructured":"Lee, K., Chang, M.W., Toutanova, K.: Latent retrieval for weakly supervised open domain question answering. ArXiv abs\/1906.00300 (2019)","key":"2_CR21","DOI":"10.18653\/v1\/P19-1612"},{"doi-asserted-by":"crossref","unstructured":"Lin, Y., Ji, H., Liu, Z., Sun, M.: Denoising distantly supervised open-domain question answering. In: ACL (2018)","key":"2_CR22","DOI":"10.18653\/v1\/P18-1161"},{"doi-asserted-by":"publisher","unstructured":"Lu, S., et al.: Less is more: Pretrain a strong Siamese encoder for dense text retrieval using a weak decoder. In: Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, pp. 2780\u20132791. Association for Computational Linguistics, Online and Punta Cana, Dominican Republic, November 2021. https:\/\/doi.org\/10.18653\/v1\/2021.emnlp-main.220. https:\/\/aclanthology.org\/2021.emnlp-main.220","key":"2_CR23","DOI":"10.18653\/v1\/2021.emnlp-main.220"},{"unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.y.: Communication-efficient learning of deep networks from decentralized data. In: Singh, A., Zhu, J. (eds.) Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 54, pp. 1273\u20131282. PMLR (20\u201322 Apr 2017). https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html","key":"2_CR24"},{"unstructured":"Nguyen, T., et al.: Ms marco: a human generated machine reading comprehension dataset, November 2016","key":"2_CR25"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1162\/089120103322753383","volume":"29","author":"M Paca","year":"2003","unstructured":"Paca, M.: Open-domain question answering from large text collections. Comput. Linguist. 29, 665\u2013667 (2003)","journal-title":"Comput. Linguist."},{"doi-asserted-by":"publisher","unstructured":"Qu, Y., et al.: RocketQA: an optimized training approach to dense passage retrieval for open-domain question answering. In: Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 5835\u20135847. Association for Computational Linguistics, Online, June 2021. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.466. https:\/\/aclanthology.org\/2021.naacl-main.466","key":"2_CR27","DOI":"10.18653\/v1\/2021.naacl-main.466"},{"doi-asserted-by":"publisher","unstructured":"Rajpurkar, P., Zhang, J., Lopyrev, K., Liang, P.: SQuAD: 100,000+ questions for machine comprehension of text. In: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pp. 2383\u20132392. Association for Computational Linguistics, Austin, Texas, November 2016. https:\/\/doi.org\/10.18653\/v1\/D16-1264.https:\/\/aclanthology.org\/D16-1264","key":"2_CR28","DOI":"10.18653\/v1\/D16-1264."},{"unstructured":"Sanh, V., Debut, L., Chaumond, J., Wolf, T.: Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. arXiv preprint arXiv:1910.01108 (2019)","key":"2_CR29"},{"doi-asserted-by":"crossref","unstructured":"Seo, M., Lee, J., Kwiatkowski, T., Parikh, A.P., Farhadi, A., Hajishirzi, H.: Real-time open-domain question answering with dense-sparse phrase index. ArXiv abs\/1906.05807 (2019)","key":"2_CR30","DOI":"10.18653\/v1\/P19-1436"},{"doi-asserted-by":"publisher","unstructured":"Shen, G., Yang, Y., Deng, Z.H.: Inter-weighted alignment network for sentence pair modeling. In: Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pp. 1179\u20131189. Association for Computational Linguistics, Copenhagen, Denmark, September 2017. https:\/\/doi.org\/10.18653\/v1\/D17-1122. https:\/\/aclanthology.org\/D17-1122","key":"2_CR31","DOI":"10.18653\/v1\/D17-1122"},{"doi-asserted-by":"publisher","unstructured":"Tran, Q.H., Lai, T., Haffari, G., Zukerman, I., Bui, T., Bui, H.: The context dependent additive recurrent neural net. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pp. 1274\u20131283.Association for Computational Linguistics, New Orleans, Louisiana, June 2018.https:\/\/doi.org\/10.18653\/v1\/N18-1115. https:\/\/aclanthology.org\/N18-1115","key":"2_CR32","DOI":"10.18653\/v1\/N18-1115"},{"doi-asserted-by":"publisher","unstructured":"Trischler, A., et al.: NewsQA: a machine comprehension dataset. In: Proceedings of the 2nd Workshop on Representation Learning for NLP, pp. 191\u2013200. Association for Computational Linguistics, Vancouver, Canada, August 2017. https:\/\/doi.org\/10.18653\/v1\/W17-2623. https:\/\/aclanthology.org\/W17-2623","key":"2_CR33","DOI":"10.18653\/v1\/W17-2623"},{"unstructured":"Wang, M., Smith, N.A., Mitamura, T.: What is the Jeopardy model? a quasi-synchronous grammar for QA. In: Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp. 22\u201332. Association for Computational Linguistics, Prague, Czech Republic, June 2007. https:\/\/aclanthology.org\/D07-1003","key":"2_CR34"},{"unstructured":"Xiong, L., et al.: Approximate nearest neighbor negative contrastive learning for dense text retrieval. arXiv preprint arXiv:2007.00808 (2020)","key":"2_CR35"},{"doi-asserted-by":"crossref","unstructured":"Yoon, S., Dernoncourt, F., Kim, D.S., Bui, T., Jung, K.: A compare-aggregate model with latent clustering for answer selection. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management (2019)","key":"2_CR36","DOI":"10.1145\/3357384.3358148"},{"doi-asserted-by":"publisher","unstructured":"Zhan, J., Mao, J., Liu, Y., Guo, J., Zhang, M., Ma, S.: Optimizing dense retrieval model training with hard negatives. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1503\u20131512. SIGIR \u201921. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3404835.3462880. https:\/\/doi.org\/10.1145\/3404835.3462880","key":"2_CR37","DOI":"10.1145\/3404835.3462880"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-46677-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T13:21:44Z","timestamp":1699104104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-46677-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031466762","9783031466779"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-46677-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2023.uqcloud.net\/","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":"Yes. Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"503","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":"216","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":"0","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":"43% - 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":"2.97","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.77","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}