{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:06:36Z","timestamp":1771038396842,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030757649","type":"print"},{"value":"9783030757656","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-75765-6_28","type":"book-chapter","created":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T09:08:54Z","timestamp":1620378534000},"page":"346-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Vertical Federated Learning for Higher-Order Factorization Machines"],"prefix":"10.1007","author":[{"given":"Kyohei","family":"Atarashi","sequence":"first","affiliation":[]},{"given":"Masakazu","family":"Ishihata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,8]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S1386-5056(00)00110-6","volume":"60","author":"JG Anderson","year":"2000","unstructured":"Anderson, J.G.: Security of the distributed electronic patient record: a case-based approach to identifying policy issues. Int. J. Med. Inf. 60(2), 111\u2013118 (2000)","journal-title":"Int. J. Med. Inf."},{"issue":"8","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1833","DOI":"10.1587\/transinf.2019EDP7266","volume":"103","author":"K Atarashi","year":"2020","unstructured":"Atarashi, K., Oyama, S., Kurihara, M.: Link prediction using higher-order feature combinations across objects. IEICE Trans. Inf. Syst. 103(8), 1833\u20131842 (2020)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"28_CR3","unstructured":"Blondel, M., Fujino, A., Ueda, N., Ishihata, M.: Higher-order factorization machines. In: NeurIPS, pp. 3351\u20133359 (2016)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-71703-4_18","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"J-W Byun","year":"2007","unstructured":"Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188\u2013200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71703-4_18"},{"key":"28_CR5","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM Data: Classification, Regression, and Multi-label. https:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvmtools\/datasets\/"},{"key":"28_CR6","unstructured":"Cheng, K., Fan, T., Jin, Y., Liu, Y., Chen, T., Yang, Q.: Secureboost: A lossless federated learning framework. arXiv preprint arXiv:1901.08755 (2019)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Du, W., Han, Y.S., Chen, S.: Privacy-preserving multivariate statistical analysis: linear regression and classification. In: SDM, pp. 222\u2013233 (2004)","DOI":"10.1137\/1.9781611972740.21"},{"issue":"3\u20134","key":"28_CR8","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"4","key":"28_CR9","first-page":"345","volume":"2017","author":"A Gasc\u00f3n","year":"2017","unstructured":"Gasc\u00f3n, A., et al.: Privacy-preserving distributed linear regression on high-dimensional data. PETS 2017(4), 345\u2013364 (2017)","journal-title":"PETS"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Gentry, C., et al.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Liu, Z., Smola, A.J., Wang, Y.X.: Difacto: distributed factorization machines. In: WSDM, pp. 377\u2013386 (2016)","DOI":"10.1145\/2835776.2835781"},{"key":"28_CR12","unstructured":"Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., He, B.: A survey on federated learning systems: vision, hype and reality for data privacy and protection. arXiv preprint arXiv:1907.09693 (2019)"},{"key":"28_CR13","unstructured":"Liu, Y., et al.: A communication efficient vertical federated learning framework. In: NeurIPS Workshop on Federated Learning for Data Privacy and Confidentiality (2019)"},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.jbi.2004.04.005","volume":"37","author":"B Malin","year":"2004","unstructured":"Malin, B., Sweeney, L.: How (not) to protect genomic data privacy in a distributed network: using trail re-identification to evaluate and design anonymity protection systems. J. Biomed. Inf. 37(3), 179\u2013192 (2004)","journal-title":"J. Biomed. Inf."},{"key":"28_CR15","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: AISTATS, pp. 1273\u20131282 (2017)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Zhang, Y.: Secureml: a system for scalable privacy-preserving machine learning. In: SP, pp. 19\u201338 (2017)","DOI":"10.1109\/SP.2017.12"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-preserving ridge regression on hundreds of millions of records. In: SP, pp. 334\u2013348 (2013)","DOI":"10.1109\/SP.2013.30"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Petroni, F., Corro, L.D., Gemulla, R.: Core: context-aware open relation extraction with factorization machines. In: EMNLP, pp. 1763\u20131773 (2015)","DOI":"10.18653\/v1\/D15-1204"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Rendle, S.: Factorization machines. In: ICDM, pp. 995\u20131000 (2010)","DOI":"10.1109\/ICDM.2010.127"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Web-scale k-means clustering. In: WWW, pp. 1177\u20131178 (2010)","DOI":"10.1145\/1772690.1772862"},{"key":"28_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N., et al.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Shokri, R., Shmatikov, V.: Privacy-preserving deep learning. In: CCS, pp. 1310\u20131321 (2015)","DOI":"10.1145\/2810103.2813687"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Slavkovic, A.B., Nardi, Y., Tibbits, M.M.: Secure logistic regression of horizontally and vertically partitioned distributed databases. In: ICDM Workshops, pp. 723\u2013728 (2007)","DOI":"10.1109\/ICDMW.2007.114"},{"issue":"2","key":"28_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang, Q., Liu, Y., Chen, T., Tong, Y.: Federated machine learning: concept and applications. ACM Trans. Intell. Syst. Technol. 10(2), 1\u201319 (2019)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Yu, H., Jiang, X., Vaidya, J.: Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data. In: SIGAPP SAC, pp. 603\u2013610 (2006)","DOI":"10.1145\/1141277.1141415"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/11731139_74","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H Yu","year":"2006","unstructured":"Yu, H., Vaidya, J., Jiang, X.: Privacy-preserving SVM classification on vertically partitioned data. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol. 3918, pp. 647\u2013656. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11731139_74"}],"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-030-75765-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T00:03:17Z","timestamp":1620691397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75765-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030757649","9783030757656"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75765-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 May 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"673","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":"157","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":"23% - 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":"7","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)"}}]}}