{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T15:37:02Z","timestamp":1776526622763,"version":"3.51.2"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030438227","type":"print"},{"value":"9783030438234","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-43823-4_27","type":"book-chapter","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T22:02:35Z","timestamp":1585346555000},"page":"317-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["Decentralized Recommendation Based on Matrix Factorization: A Comparison of Gossip and Federated Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5356-2192","authenticated-orcid":false,"given":"Istv\u00e1n","family":"Heged\u0171s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9983-1060","authenticated-orcid":false,"given":"G\u00e1bor","family":"Danner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9363-1482","authenticated-orcid":false,"given":"M\u00e1rk","family":"Jelasity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,28]]},"reference":[{"key":"27_CR1","unstructured":"Ammad-ud-din, M., et al.: Federated collaborative filtering for privacy-preserving personalized recommendation system. CoRR abs\/1901.09888 (2019). http:\/\/arxiv.org\/abs\/1901.09888"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Berta, \u00c1., Bilicki, V., Jelasity, M.: Defining and understanding smartphone churn over the internet: a measurement study. In: Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P2P 2014). IEEE (2014). https:\/\/doi.org\/10.1109\/P2P.2014.6934317","DOI":"10.1109\/P2P.2014.6934317"},{"key":"27_CR3","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for federated learning on user-held data. In: NIPS Workshop on Private Multi-Party Machine Learning (2016)"},{"key":"27_CR4","unstructured":"Chen, F., Dong, Z., Li, Z., He, X.: Federated meta-learning for recommendation. CoRR abs\/1802.07876 (2018). http:\/\/arxiv.org\/abs\/1802.07876"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"6728020","DOI":"10.1155\/2018\/6728020","volume":"2018","author":"G Danner","year":"2018","unstructured":"Danner, G., Berta, \u00c1., Heged\u0171s, I., Jelasity, M.: Robust fully distributed mini-batch gradient descent with privacy preservation. Secur. Commun. Netw. 2018, 6728020 (2018). https:\/\/doi.org\/10.1155\/2018\/6728020","journal-title":"Secur. Commun. Netw."},{"key":"27_CR6","unstructured":"Dean, J., et al.: Large scale distributed deep networks. In: Proceedings of the 25th International Conference on Neural Information Processing Systems, NIPS 2012, vol. 1, pp. 1223\u20131231. Curran Associates Inc., USA (2012). http:\/\/dl.acm.org\/citation.cfm?id=2999134.2999271"},{"key":"27_CR7","unstructured":"European Commission: General data protection regulation (GDPR) (2018). https:\/\/ec.europa.eu\/commission\/priorities\/justice-and-fundamental-rights\/data-protection\/2018-reform-eu-data-protection-rules"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper, F.M., Konstan, J.A.: The movielens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5(4), 19:1\u201319:19 (2015). https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Trans. Interact. Intell. Syst."},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"62:1","DOI":"10.1145\/2854157","volume":"7","author":"I Heged\u0171s","year":"2016","unstructured":"Heged\u0171s, I., Berta, \u00c1., Kocsis, L., Bencz\u00far, A.A., Jelasity, M.: Robust decentralized low-rank matrix decomposition. ACM Trans. Intell. Syst. Technol. 7(4), 62:1\u201362:24 (2016). https:\/\/doi.org\/10.1145\/2854157","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"27_CR10","unstructured":"Konecn\u00fd, J., McMahan, H.B., Yu, F.X., Richt\u00e1rik, P., Suresh, A.T., Bacon, D.: Federated learning: Strategies for improving communication efficiency. In: Private Multi-Party Machine Learning (NIPS 2016 Workshop) (2016)"},{"issue":"8","key":"27_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y Koren","year":"2009","unstructured":"Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30\u201337 (2009). https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"27_CR12","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y Arcas, B.A.: 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, Fort Lauderdale, 20\u201322 April 2017"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Montresor, A., Jelasity, M.: Peersim: A scalable P2P simulator. In: Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P 2009), pp. 99\u2013100. IEEE, Seattle, September 2009. https:\/\/doi.org\/10.1109\/P2P.2009.5284506. http:\/\/www.inf.u-szeged.hu\/~jelasity\/cikkek\/p2p09.pdf, extended abstract","DOI":"10.1109\/P2P.2009.5284506"},{"issue":"4","key":"27_CR14","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1002\/cpe.2858","volume":"25","author":"R Orm\u00e1ndi","year":"2013","unstructured":"Orm\u00e1ndi, R., Heged\u0171s, I., Jelasity, M.: Gossip learning with linear models on fully distributed data. Concurr. Comput.: Pract. Exp. 25(4), 556\u2013571 (2013). https:\/\/doi.org\/10.1002\/cpe.2858","journal-title":"Concurr. Comput.: Pract. Exp."},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Roverso, R., Dowling, J., Jelasity, M.: Through the wormhole: low cost, fresh peer sampling for the internet. In: Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing (P2P 2013). IEEE (2013). https:\/\/doi.org\/10.1109\/P2P.2013.6688707","DOI":"10.1109\/P2P.2013.6688707"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-03869-3_50","volume-title":"Euro-Par 2009 Parallel Processing","author":"N T\u00f6lgyesi","year":"2009","unstructured":"T\u00f6lgyesi, N., Jelasity, M.: Adaptive peer sampling with newscast. In: Sips, H., Epema, D., Lin, H.-X. (eds.) Euro-Par 2009. LNCS, vol. 5704, pp. 523\u2013534. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03869-3_50"},{"key":"27_CR17","doi-asserted-by":"publisher","unstructured":"Wang, J., Cao, B., Yu, P.S., Sun, L., Bao, W., Zhu, X.: Deep learning towards mobile applications. In: IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 1385\u20131393, July 2018. https:\/\/doi.org\/10.1109\/ICDCS.2018.00139. https:\/\/arxiv.org\/pdf\/1809.03559.pdf","DOI":"10.1109\/ICDCS.2018.00139"}],"container-title":["Communications in Computer and Information Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43823-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T01:15:45Z","timestamp":1707786945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43823-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030438227","9783030438234"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43823-4_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.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":"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":"733","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":"130","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.04","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":"5.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)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}