{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:52:51Z","timestamp":1759693971711,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192730"},{"type":"electronic","value":"9783030192747"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19274-7_2","type":"book-chapter","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T18:09:50Z","timestamp":1556215790000},"page":"19-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Augmenting LOD-Based Recommender Systems Using Graph Centrality Measures"],"prefix":"10.1007","author":[{"given":"Bart","family":"van Rossum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8031-758X","authenticated-orcid":false,"given":"Flavius","family":"Frasincar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,26]]},"reference":[{"issue":"5","key":"2_CR1","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1109\/TKDE.2011.15","volume":"24","author":"G Adomavicius","year":"2012","unstructured":"Adomavicius, G., Kwon, Y.: Improving aggregate recommendation diversity using ranking-based techniques. IEEE Trans. Knowl. Data Eng. 24(5), 896\u2013911 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/j.ipm.2012.07.008","volume":"49","author":"IS Altingovde","year":"2013","unstructured":"Altingovde, I.S., Subakan, \u00d6.N., Ulusoy, \u00d6.: Cluster searching strategies for collaborative recommendation systems. Inf. Process. Manage. 49(3), 688\u2013697 (2013)","journal-title":"Inf. Process. Manage."},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-540-76298-0_52","volume-title":"The Semantic Web","author":"S Auer","year":"2007","unstructured":"Auer, S., Bizer, C., Kobilarov, G., Lehmann, J., Cyganiak, R., Ives, Z.: DBpedia: a nucleus for a web of open data. In: Aberer, K., et al. (eds.) ASWC\/ISWC-2007. LNCS, vol. 4825, pp. 722\u2013735. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76298-0_52"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009040101","volume":"5","author":"C Bizer","year":"2009","unstructured":"Bizer, C., Heath, T., Berners-Lee, T.: Linked data-the story so far. Int. J. Semantic Web Inf. Syst. 5(2), 1\u201322 (2009)","journal-title":"Int. J. Semantic Web Inf. Syst."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"2_CR6","unstructured":"Chapelle, O., Chang, Y.: Yahoo! Learning to rank challenge overview. In: Proceedings of the Learning to Rank Challenge, pp. 1\u201324 (2011)"},{"key":"2_CR7","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, pp. 39\u201346. ACM (2010)","DOI":"10.1145\/1864708.1864721"},{"issue":"7","key":"2_CR8","doi-asserted-by":"publisher","first-page":"e0159161","DOI":"10.1371\/journal.pone.0159161","volume":"11","author":"S Emmons","year":"2016","unstructured":"Emmons, S., Kobourov, S., Gallant, M., Borner, K.: Analysis of network clustering algorithms and cluster quality metrics at scale. PloS One 11(7), e0159161 (2016). https:\/\/journals.plos.org\/plosone\/article?id=10.1371\/journal.pone.0159161","journal-title":"PloS One"},{"issue":"7","key":"2_CR9","first-page":"745","volume":"5","author":"S Gong","year":"2010","unstructured":"Gong, S.: A collaborative filtering recommendation algorithm based on user clustering and item clustering. J. Soc. Work 5(7), 745\u2013752 (2010)","journal-title":"J. Soc. Work"},{"issue":"4","key":"2_CR10","first-page":"19:1","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper, F.M., Konstan, J.A.: The MovieLens datasets: history and context. ACM Trans. Intell. Syst. Technol. 5(4), 19:1\u201319:19 (2015). https:\/\/dblp.uni-trier.de\/rec\/bibtex\/journals\/tiis\/HarperK16","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"11","key":"2_CR11","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)","journal-title":"Commun. ACM"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-0-387-85820-3_3","volume-title":"Recommender Systems Handbook","author":"P Lops","year":"2011","unstructured":"Lops, P., de Gemmis, M., Semeraro, G.: Content-based recommender systems: state of the art and trends. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 73\u2013105. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-0-387-85820-3_3"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2017.08.015","volume":"136","author":"C Musto","year":"2017","unstructured":"Musto, C., Lops, P., de Gemmis, M., Semeraro, G.: Semantics-aware recommender systems exploiting linked open data and graph-based features. Knowl.-Based Syst. 136, 1\u201314 (2017)","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"2_CR14","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2899005","volume":"8","author":"TD Noia","year":"2016","unstructured":"Noia, T.D., Ostuni, V.C., Tomeo, P., Sciascio, E.D.: SPrank: semantic path-based ranking for top-N recommendations using linked open data. ACM Trans. Intell. Syst. Technol. 8(1), 9:1\u20139:34 (2016)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.ins.2016.11.015","volume":"382","author":"TD Noia","year":"2017","unstructured":"Noia, T.D., Rosati, J., Tomeo, P., Sciascio, E.D.: Adaptive multi-attribute diversity for recommender systems. Inf. Sci. 382, 234\u2013253 (2017)","journal-title":"Inf. Sci."},{"key":"2_CR16","unstructured":"Palumbo, E., Rizzo, G., Troncy, R.: Learning user-item relatedness from knowledge graphs for top-N item recommendation. In: Proceedings of the Eleventh ACM Conference on Recommender Systems (RecSys 2017), pp. 32\u201336. ACM (2017)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Wever, T., Frasincar, F.: A linked open data schema-driven approach for Top-N recommendations. In: Proceedings of the Symposium on Applied Computing (SAC 2017), pp. 656\u2013663. ACM (2017)","DOI":"10.1145\/3019612.3019843"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, M., Hurley, N.: Avoiding monotony: improving the diversity of recommendation lists. In: Proceedings of the 2008 ACM Conference on Recommender Systems (RecSys 2008), pp. 123\u2013130. ACM (2008)","DOI":"10.1145\/1454008.1454030"},{"issue":"10","key":"2_CR19","doi-asserted-by":"publisher","first-page":"4511","DOI":"10.1073\/pnas.1000488107","volume":"107","author":"T Zhou","year":"2010","unstructured":"Zhou, T., Kuscsik, Z., Liu, J.G., Medo, M., Wakeling, J.R., Zhang, Y.C.: Solving the apparent diversity-accuracy dilemma of recommender systems. Proc. Nat. Acad. Sci. 107(10), 4511\u20134515 (2010)","journal-title":"Proc. Nat. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19274-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T00:01:59Z","timestamp":1714003319000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19274-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192730","9783030192747"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19274-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICWE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Daejeon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"11 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icwe2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icwe2019.webengineering.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","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":"26","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":"9","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":"25% - 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":"4","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}