{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:00:12Z","timestamp":1742947212069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031471117"},{"type":"electronic","value":"9783031471124"}],"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-47112-4_10","type":"book-chapter","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T05:01:54Z","timestamp":1698296514000},"page":"107-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bridging the Gap: Conceptual Modeling and\u00a0Machine Learning for Web Portals"],"prefix":"10.1007","author":[{"given":"Dadhichi","family":"Shukla","sequence":"first","affiliation":[]},{"given":"Eugen","family":"Lindorfer","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Eresheim","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Buchelt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,26]]},"reference":[{"issue":"48","key":"10_CR1","doi-asserted-by":"publisher","first-page":"30079","DOI":"10.1073\/pnas.1907370117","volume":"117","author":"A Barreto","year":"2020","unstructured":"Barreto, A., Hou, S., Borsa, D., Silver, D., Precup, D.: Fast reinforcement learning with generalized policy updates. Proc. Nat. Acad. Sci. 117(48), 30079\u201330087 (2020)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"10_CR2","first-page":"293","volume":"46","author":"KY Bjerkan","year":"2020","unstructured":"Bjerkan, K.Y., Bj\u00f8rgen, A., Hjelkrem, O.A.: E-commerce and prevalence of last mile practices. Transp. Res. Proc. 46, 293\u2013300 (2020)","journal-title":"Transp. Res. Proc."},{"key":"10_CR3","unstructured":"Bork, D., Ali, S.J., Roelens, B.: Conceptual modeling and artificial intelligence: a systematic mapping study. arXiv preprint arXiv:2303.06758 (2023)"},{"key":"10_CR4","unstructured":"Brockman, G., et al.: OpenAI gym (2016)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Feltus, C., Ma, Q., Proper, H.A., Kelsen, P.: Towards AI assisted domain modeling. In: Advances in Conceptual Modeling: ER 2021 Workshops CoMoNoS, EmpER (2021)","DOI":"10.1007\/978-3-030-88358-4_7"},{"key":"10_CR6","unstructured":"Gur, I., et al.: Environment generation for zero-shot compositional reinforcement learning. In: Advances in Neural Information Processing Systems (2021)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"101909","DOI":"10.1016\/j.datak.2021.101909","volume":"134","author":"W Maass","year":"2021","unstructured":"Maass, W., Storey, V.C.: Pairing conceptual modeling with machine learning. Data Knowl. Eng. 134, 101909 (2021)","journal-title":"Data Knowl. Eng."},{"key":"10_CR8","unstructured":"Maass, W., Storey, V.C.: Why should machine learning require conceptual models? (2021)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/0361198118794044","volume":"2672","author":"K Maat","year":"2018","unstructured":"Maat, K., Konings, R.: Accessibility or innovation? Store shopping trips versus online shopping. Transp. Res. Rec. 2672, 1\u201310 (2018)","journal-title":"Transp. Res. Rec."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., et al.: Human-level control through deep reinforcement learning. Nature 518, 529\u2013533 (2015)","journal-title":"Nature"},{"key":"10_CR11","first-page":"12348","volume":"22","author":"A Raffin","year":"2021","unstructured":"Raffin, A., Hill, A., Gleave, A., Kanervisto, A., Ernestus, M., Dormann, N.: Stable-baselines3: reliable reinforcement learning implementations. J. Mach. Learn. Res. 22, 12348\u201312355 (2021)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Reinhard, P., Li, M.M., Dickhaut, E., Reh, C., Peters, C., Leimeister, J.M.: A conceptual model for labeling in reinforcement learning systems: a value co-creation perspective. In: International Conference on Design Science Research in Information Systems and Technology (2023)","DOI":"10.1007\/978-3-031-32808-4_8"},{"key":"10_CR13","unstructured":"Rummery, G.A., Niranjan, M.: On-line Q-learning using connectionist systems. University of Cambridge, Department of Engineering Cambridge, UK (1994)"},{"key":"10_CR14","unstructured":"Husin, H.S., Ismail, S.: Process mining approach to analyze user navigation behavior of a news website. In: Proceedings of the 4th International Conference on Information Science and Systems (2021)"},{"key":"10_CR15","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"10_CR16","unstructured":"Shi, T., Karpathy, A., Fan, L., Hernandez, J., Liang, P.: World of bits: an open-domain platform for web-based agents. In: International Conference on Machine Learning (2017)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Terragni, A., Hassani, M.: Analyzing customer journey with process mining: from discovery to recommendations. In: 2018 IEEE 6th International Conference on Future Internet of Things and Cloud (FiCloud) (2018)","DOI":"10.1109\/FiCloud.2018.00040"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8, 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"10_CR19","unstructured":"Yuan, G., Lu, J.: MORTAL: a tool of automatically designing relational storage schemas for multi-model data through reinforcement learning. In: Proceedings of the ER Demos and Posters 2021, International Conference on Conceptual Modeling (ER 2021) (2021)"}],"container-title":["Lecture Notes in Computer Science","Advances in Conceptual Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47112-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:14:23Z","timestamp":1710346463000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47112-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471117","9783031471124"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47112-4_10","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":"26 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ER","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"er2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/er2023.inesc-id.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair (Familiarity)","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"21","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.09+1","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.47+3.55","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":"Yes, additional reviewers listed in preface (subreviewers supervised by PC members)","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)"}}]}}