{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:45:09Z","timestamp":1765889109667,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031333798"},{"type":"electronic","value":"9783031333804"}],"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-33380-4_29","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T08:05:58Z","timestamp":1685088358000},"page":"374-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["$$\\textbf{k}$$NN-Embed: Locally Smoothed Embedding Mixtures for Multi-interest Candidate Retrieval"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"El-Kishky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Markovich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenny","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Portman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aria","family":"Haghighi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS. IEEE (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"29_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. Technical report, Stanford (2006)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R., Ma, Y., Srikant, R.: Scaling up all pairs similarity search. In: WWW (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"29_CR4","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NeurIPS (2013)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Covington, P., Adams, J., Sargin, E.: Deep neural networks for youtube recommendations. In: RecSys (2016)","DOI":"10.1145\/2959100.2959190"},{"key":"29_CR6","unstructured":"Dhillon, I., Modha, D.: Concept decompositions for large sparse text data using clustering. In: Machine learning (2001)"},{"key":"29_CR7","unstructured":"El-Kishky, A., Guzm\u00e1n, F.: Massively multilingual document alignment with cross-lingual sentence-mover\u2019s distance (2020)"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"El-Kishky, A., Markovich, T., Park, S., et al.: Twhin: embedding the twitter heterogeneous information network for personalized recommendation. In: KDD (2022)","DOI":"10.1145\/3534678.3539080"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Gehrke, J., Ginsparg, P., Kleinberg, J.: Overview of the 2003 kdd cup. In: Sigkdd Explorations (2003)","DOI":"10.1145\/980972.980992"},{"key":"29_CR10","unstructured":"Goldberg, Y., Levy, O.: word2vec explained: deriving mikolov et al\u2019.s negative-sampling word-embedding method. arXiv preprint arXiv:1402.3722 (2014)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Huang, J., Sharma, A., Sun, S., Xia, L., et al.: Embedding-based retrieval in facebook search. In: SIGKDD (2020)","DOI":"10.1145\/3394486.3403305"},{"key":"29_CR12","unstructured":"Jelinek, F.: Interpolated estimation of markov source parameters from sparse data. In: PRIP (1980)"},{"key":"29_CR13","unstructured":"Johnson, J., Douze, M., J\u00e9gou, H.: Billion-scale similarity search with gpus. In: BigData (2019)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Kang, W., McAuley, J.: Candidate generation with binary codes for large-scale top-n recommendation. In: CIKM (2019)","DOI":"10.1145\/3357384.3357930"},{"key":"29_CR15","unstructured":"Khandelwal, U., Fan, A., Jurafsky, D., Zettlemoyer, L., Lewis, M.: Nearest neighbor machine translation. In: ICLR (2021)"},{"key":"29_CR16","unstructured":"Khandelwal, U., Levy, O., Jurafsky, D., Zettlemoyer, L., Lewis, M.: Generalization through memorization: nearest neighbor language models. In: ICLR (2020)"},{"key":"29_CR17","unstructured":"Kusner, M., Sun, Y., Kolkin, N., Weinberger, K.: From word embeddings to document distances. In: ICML (2015)"},{"key":"29_CR18","unstructured":"Lerer, A., et al.: Pytorch-biggraph: a large-scale graph embedding system. In: MLSys (2019)"},{"key":"29_CR19","unstructured":"Levina, E., Bickel, P.: The earth mover\u2019s distance is the mallows distance: some insights from statistics. In: ICCV. IEEE (2001)"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Liu, X., Croft, B.: Cluster-based retrieval using language models. In: SIGIR (2004)","DOI":"10.1145\/1008992.1009026"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"Y Malkov","year":"2018","unstructured":"Malkov, Y., Yashunin, D.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. TPAMI 42, 824\u2013836 (2018)","journal-title":"TPAMI"},{"key":"29_CR22","unstructured":"n: Mikolov, T., Sutskever, I., Chen, K., Corrado, G., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NeurIPS (2013)"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Pal, A., Eksombatchai, C., Zhou, Y., et al.: Pinnersage: multi-modal user embedding framework for recommendations at pinterest. In: KDD (2020)","DOI":"10.1145\/3394486.3403280"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: SIGKDD (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"29_CR25","first-page":"171","volume":"11","author":"C Van Rijsbergen","year":"1975","unstructured":"Van Rijsbergen, C., Bruce, W.: Document clustering: an evaluation of some experiments with the cranfield 1400 collection. IPM 11, 171\u2013182 (1975)","journal-title":"IPM"},{"key":"29_CR26","unstructured":"Weston, J., Makadia, A., Yee, H.: Label partitioning for sublinear ranking. In: ICML"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Wilhelm, M., Ramanathan, A., Bonomo, A.O.: Practical diversified recommendations on youtube with determinantal point processes. In: CIKM (2018)","DOI":"10.1145\/3269206.3272018"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, F., Yuan, N., Lian, D., Xie, X., Ma, W.: Collaborative knowledge base embedding for recommender systems. In: SIGKDD (2016)","DOI":"10.1145\/2939672.2939673"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33380-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:57:59Z","timestamp":1710359879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33380-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333798","9783031333804"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33380-4_29","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":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","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":"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":"813","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":"143","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":"18% - 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.5","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":"10","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)"}}]}}