{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:02:31Z","timestamp":1760709751849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030038397"},{"type":"electronic","value":"9783030038403"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03840-3_38","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T01:28:57Z","timestamp":1541640537000},"page":"516-527","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Novelty-Aware Matrix Factorization Based on Items\u2019 Popularity"],"prefix":"10.1007","author":[{"given":"Ludovik","family":"Coba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiotis","family":"Symeonidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Zanker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,9]]},"reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"Database Theory\u2014ICDT 2001","author":"CC Aggarwal","year":"2001","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 420\u2013434. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44503-X_27"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-1-4899-7637-6_26","volume-title":"Recommender Systems Handbook","author":"P Castells","year":"2015","unstructured":"Castells, P., Hurley, N.J., Vargas, S.: Novelty and diversity in recommender systems. In: Ricci, F., Rokach, L., Shapira, B. (eds.) Recommender Systems Handbook, pp. 881\u2013918. Springer, Boston, MA (2015). https:\/\/doi.org\/10.1007\/978-1-4899-7637-6_26"},{"key":"38_CR3","unstructured":"Charles, C., et al.: Novelty and diversity in information retrieval evaluation. In: SIGIR Conference, SIGIR 2008, pp. 659\u2013666 (2008)"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, P., Wang, S., Ma, J., Sun, J., Xiong, H.: Learning to recommend accurate and diverse items. In: Proceedings of the 26th International Conference on World Wide Web, WWW 2017, pp. 183\u2013192 (2017). https:\/\/doi.org\/10.1145\/3038912.3052585","DOI":"10.1145\/3038912.3052585"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Cremonesi, P., Koren, Y., Turrin, R.: Performance of recommender algorithms on top-n recommendation tasks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys 2010, pp. 39\u201346. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1864708.1864721","DOI":"10.1145\/1864708.1864721"},{"issue":"5","key":"38_CR6","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.ipm.2015.06.008","volume":"51","author":"M Gemmis De","year":"2015","unstructured":"De Gemmis, M., Lops, P., Semeraro, G., Musto, C.: An investigation on the serendipity problem in recommender systems. Inf. Process. Manag. 51(5), 695\u2013717 (2015). https:\/\/doi.org\/10.1016\/j.ipm.2015.06.008 . https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306457315000837","journal-title":"Inf. Process. Manag."},{"key":"38_CR7","unstructured":"Dhillon, I.S., Sra, S.: Generalized nonnegative matrix approximations with Bregman divergences. In: NIPS, pp. 283\u2013290 (2005)"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Furnas, G., Deerwester, S., Dumais, S.T.: Information retrieval using a singular value decomposition model of latent semantic structure. In: Proccedings ACM SIGIR Conference, pp. 465\u2013480 (1988)","DOI":"10.1145\/62437.62487"},{"issue":"4","key":"38_CR9","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":"38_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper, F.M., Konstan, J.A.: The MovieLens datasets. ACM Trans. Interact. Intell. Syst. 5(4), 1\u201319 (2015)","journal-title":"ACM Trans. Interact. Intell. Syst."},{"key":"38_CR11","unstructured":"Hurley, N.J.: Personalised ranking with diversity. Proceedings of the 7th ACM Conference on Recommender Systems - RecSys 2013, vol. 2, no. 1, pp. 379\u2013382 (2013). https:\/\/doi.org\/10.1145\/2507157.2507226 . http:\/\/dl.acm.org\/citation.cfm?doid=2507157.2507226"},{"issue":"5","key":"38_CR12","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11257-015-9165-3","volume":"25","author":"D Jannach","year":"2015","unstructured":"Jannach, D., Lerche, L., Kamehkhosh, I., Jugovac, M.: What recommenders recommend: an analysis of recommendation biases and possible countermeasures. User Model. User-Adap. Inter. 25(5), 427\u2013491 (2015)","journal-title":"User Model. User-Adap. Inter."},{"issue":"11","key":"38_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2891406","volume":"59","author":"D Jannach","year":"2016","unstructured":"Jannach, D., Resnick, P., Tuzhilin, A., Zanker, M.: Recommender systems - beyond matrix completion. Commun. ACM 59(11), 94\u2013102 (2016). https:\/\/doi.org\/10.1145\/2891406","journal-title":"Commun. ACM"},{"issue":"8","key":"38_CR14","doi-asserted-by":"publisher","first-page":"42","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), 42\u201349 (2009). https:\/\/doi.org\/10.1109\/MC.2009.263","journal-title":"Computer"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"DD Lee","year":"1999","unstructured":"Lee, D.D., Seung, H.S.: Learning the parts of objects by nonnegative matrix factorization. Nature 401, 788\u2013791 (1999)","journal-title":"Nature"},{"issue":"6","key":"38_CR16","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","volume":"18","author":"CJ Lin","year":"2007","unstructured":"Lin, C.J.: On the convergence of multiplicative update algorithms for nonnegative matrix factorization. IEEE Trans. Neural Netw. 18(6), 1589\u20131596 (2007)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"38_CR17","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: Cur matrix decompositions for improved data analysis. Proc. Nat. Acad. Sci. 106(3), 697\u2013702 (2009). https:\/\/doi.org\/10.1073\/pnas.0803205106 . http:\/\/www.pnas.org\/content\/106\/3\/697.abstract","journal-title":"Proc. Nat. Acad. Sci."},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Ning, X., Karypis, G.: SLIM: Sparse linear methods for top-N recommender systems. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 497\u2013506. IEEE (2011)","DOI":"10.1109\/ICDM.2011.134"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Ning, X., Karypis, G.: Sparse linear methods with side information for top-n recommendations. In: Proceedings of the Sixth ACM Conference on Recommender Systems, pp. 155\u2013162. ACM (2012)","DOI":"10.1145\/2365952.2365983"},{"key":"38_CR20","unstructured":"Rendle, S., Freudenthaler, C., Gantner, Z., Lars, S.T.: BPR: Bayesian personalized ranking from implicit feedback. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, UAI 2009, pp. 452\u2013461. AUAI Press, Arlington (2009). http:\/\/portal.acm.org\/citation.cfm?id=1795114.1795167"},{"key":"38_CR21","unstructured":"Tomeo, P., Di Noia, T., De Gemmis, M., Lops, P., Semeraro, G., Sciascio, E.D.: Exploiting regression trees as user models for intent-aware multi-attribute diversity. Technical report. http:\/\/grouplens.org\/datasets\/movielens"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Vargas, S., Castells, P.: Rank and relevance in novelty and diversity metrics for recommender systems. In: Proceedings of the Fifth ACM Conference on Recommender Systems, RecSys 2011, pp. 109\u2013116. ACM, New York (2011). https:\/\/doi.org\/10.1145\/2043932.2043955","DOI":"10.1145\/2043932.2043955"},{"issue":"9","key":"38_CR23","doi-asserted-by":"publisher","first-page":"896","DOI":"10.14778\/2311906.2311916","volume":"5","author":"H Yin","year":"2012","unstructured":"Yin, H., Cui, B., Li, J., Yao, J., Chen, C.: Challenging the long tail recommendation. Proc. VLDB Endowment 5(9), 896\u2013907 (2012)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2018 \u2013 Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03840-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T21:52:29Z","timestamp":1572558749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03840-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030038397","9783030038403"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03840-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"AI*IA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aixia2018.fbk.eu\/index.php\/home\/","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"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"210","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20% - 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"}},{"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"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}