{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:38:56Z","timestamp":1756190336653,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031301049"},{"type":"electronic","value":"9783031301056"}],"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-30105-6_40","type":"book-chapter","created":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:31:55Z","timestamp":1681331515000},"page":"480-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sparse Linear Capsules for\u00a0Matrix Factorization-Based Collaborative Filtering"],"prefix":"10.1007","author":[{"given":"Xuan","family":"Li","sequence":"first","affiliation":[]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Chen, C., Li, D., Lv, Q., Yan, J., Shang, L., Chu, S.M.: Gloma: embedding global information in local matrix approximation models for collaborative filtering. In: Thirty-First AAAI Conference on Artificial Intelligence (2017)","DOI":"10.1609\/aaai.v31i1.10752"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Chen, C., Li, D., Zhao, Y., Lv, Q., Shang, L.: WEMAREC: accurate and scalable recommendation through weighted and ensemble matrix approximation. In: SIGIR, pp. 303\u2013312 (2015)","DOI":"10.1145\/2766462.2767718"},{"key":"40_CR3","unstructured":"Chen, J., Yu, H., Qian, C., Chen, D.Z., Wu, J.: A receptor skeleton for capsule neural networks. In: ICML (2021)"},{"key":"40_CR4","unstructured":"Dziugaite, G.K., Roy, D.M.: Neural network matrix factorization. arXiv preprint arXiv:1511.06443 (2015)"},{"key":"40_CR5","unstructured":"Hahn, T., Pyeon, M., Kim, G.: Self-routing capsule networks. In: NeurIPS (2019)"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Hinton, G.E., Krizhevsky, A., Wang, S.: Transforming auto-encoders. In: ICANN (2011)","DOI":"10.1007\/978-3-642-21735-7_6"},{"key":"40_CR7","unstructured":"Hinton, G.E., Sabour, S., Frosst, N.: Matrix capsules with EM routing. In: ICLR (2018)"},{"key":"40_CR8","unstructured":"Jeong, T., Lee, Y., Kim, H.: Ladder capsule network. In: ICML (2019)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: KDD (2008)","DOI":"10.1145\/1401890.1401944"},{"issue":"8","key":"40_CR10","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)","journal-title":"Computer"},{"key":"40_CR11","unstructured":"Lee, J., Kim, S., Lebanon, G., Singer, Y.: Local low-rank matrix approximation. In: International Conference on Machine Learning, pp. 82\u201390 (2013)"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Li, D.S., Chen, C., Gong, Z., Lu, T., Chu, S., Gu, N.: Collaborative filtering with noisy ratings. In: SDM (2019)","DOI":"10.1137\/1.9781611975673.84"},{"key":"40_CR13","unstructured":"Li, D., Chen, C., Lv, Q., Yan, J., Shang, L., Chu, S.: Low-rank matrix approximation with stability. In: International Conference on Machine Learning, pp. 295\u2013303 (2016)"},{"key":"40_CR14","unstructured":"Mackey, L.W., Talwalkar, A., Jordan, M.I.: Divide-and-conquer matrix factorization. arXiv abs\/1107.0789 (2011)"},{"key":"40_CR15","unstructured":"Malmgren, C.: A comparative study of routing methods in capsule networks (2019)"},{"key":"40_CR16","unstructured":"Mnih, A., Salakhutdinov, R.R.: Probabilistic matrix factorization. In: Advances in Neural Information Processing Systems, pp. 1257\u20131264 (2008)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Ning, X., Desrosiers, C., Karypis, G.: A comprehensive survey of neighborhood-based recommendation methods. In: Recommender Systems Handbook (2015)","DOI":"10.1007\/978-1-4899-7637-6_2"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Ning, X., Karypis, G.: Slim: sparse linear methods for top-n recommender systems. 2011 IEEE 11th International Conference on Data Mining, pp. 497\u2013506 (2011)","DOI":"10.1109\/ICDM.2011.134"},{"key":"40_CR19","unstructured":"Sabour, S., Frosst, N., Hinton, G.E.: Dynamic routing between capsules. arXiv abs\/1710.09829 (2017)"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Salakhutdinov, R., Mnih, A.: Bayesian probabilistic matrix factorization using Markov chain Monte Carlo. In: ICML 2008 (2008)","DOI":"10.1145\/1390156.1390267"},{"key":"40_CR21","unstructured":"Srebro, N., Jaakkola, T.: Weighted low-rank approximations. In: Proceedings of the 20th International Conference on Machine Learning (ICML-2003), pp. 720\u2013727 (2003)"},{"key":"40_CR22","unstructured":"Webb, B.: Netflix update: Try this at home (2006). Blog post: https:\/\/sifter.org\/simon\/journal\/20061211.html"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Yuan, T., Cheng, J., Zhang, X., Qiu, S., Lu, H.: Recommendation by mining multiple user behaviors with group sparsity. In: AAAI (2014)","DOI":"10.1609\/aaai.v28i1.8713"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yao, L., Xu, X.: AutoSVD++: an efficient hybrid collaborative filtering model via contractive auto-encoders. In: SIGIR, pp. 957\u2013960. ACM (2017)","DOI":"10.1145\/3077136.3080689"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30105-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T20:37:12Z","timestamp":1681331832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30105-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031301049","9783031301056"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30105-6_40","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":"13 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iconip2022.apnns.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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"810","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":"359","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":"44% - 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.65","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)"}},{"value":"ICONIP 2022 consists of a two-volume set, LNCS & CCIS, which includes 146 and 213 papers","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)"}}]}}