{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T16:45:27Z","timestamp":1748537127437,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031539657"},{"type":"electronic","value":"9783031539664"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53966-4_25","type":"book-chapter","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:29Z","timestamp":1707933749000},"page":"334-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Graph Configuration Spaces with\u00a0Graph Embedding in\u00a0Engineering Domains"],"prefix":"10.1007","author":[{"given":"Michael","family":"Mittermaier","sequence":"first","affiliation":[]},{"given":"Takfarinas","family":"Saber","sequence":"additional","affiliation":[]},{"given":"Goetz","family":"Botterweck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"25_CR1","unstructured":"Building Ventilation - MATLAB Simulink. https:\/\/www.mathworks.com\/help\/simscape\/ug\/building-ventilation.html. Accessed 10 May 2023"},{"key":"25_CR2","unstructured":"MATLAB Simulink - Simulation and Model-Based Design. https:\/\/uk.mathworks.com\/products\/simulink.html. Accessed 10 May 2023"},{"key":"25_CR3","unstructured":"https:\/\/github.com\/mittermm\/LEGCS. Accessed 10 May 2023"},{"key":"25_CR4","unstructured":"Acher, M., et al.: Learning very large configuration spaces: what matters for linux kernel sizes. Inria Rennes-Bretagne Atlantique. hal-02314830 (2019)"},{"key":"25_CR5","unstructured":"Cai, C., Wang, Y.: A simple yet effective baseline for non-attributed graph classification. arXiv:1811.03508 (2022)"},{"issue":"9","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"25_CR7","unstructured":"Chami, I., Abu-El-Haija, S., Perozzi, B., R\u00e9, C., Murphy, K.: Machine learning on graphs: a model and comprehensive taxonomy. J. Mach. Learn. Res. 23, 89:1\u201389:64 (2022)"},{"key":"25_CR8","unstructured":"Chica, M., Juan, A.A., Bayliss, C., Cordon, O., Kelton, D.: Why simheuristics? benefits, limitations, and best practices when combining metaheuristics with simulation. In: Statistics and Operations Research Transactions (2020)"},{"issue":"6","key":"25_CR9","first-page":"1014","volume":"47","author":"RL Church","year":"2020","unstructured":"Church, R.L., Baez, C.A.: Generating optimal and near-optimal solutions to facility location problems. Environ. Plan. B: Urban Anal. City Sci. 47(6), 1014\u20131030 (2020)","journal-title":"Environ. Plan. B: Urban Anal. City Sci."},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Easterbrook, S., Singer, J., Storey, M.A.D., Damian, D.E.: Selecting empirical methods for software engineering research. In: Guide to Advanced Empirical Software Engineering, pp. 285\u2013311. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-1-84800-044-5_11","DOI":"10.1007\/978-1-84800-044-5_11"},{"key":"25_CR11","unstructured":"Eppstein, D., Kurz, D.: $$ k $$-best solutions of MSO problems on tree-decomposable graphs. In: 12th International Symposium on Parameterized and Exact Computation (IPEC) (2017)"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2013.01.001","volume":"229","author":"RZ Farahani","year":"2013","unstructured":"Farahani, R.Z., Miandoabchi, E., Szeto, W.Y., Rashidi-Bajgan, H.: A review of urban transportation network design problems. Eur. J. Oper. Res. 229(2), 281\u2013302 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Glinz, M.: On non-functional requirements. In: International Requirements Engineering Conference (RE), pp. 21\u201326 (2007)","DOI":"10.1109\/RE.2007.45"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. Knowl. Based Syst. 151, 78\u201394 (2018)","journal-title":"Knowl. Based Syst."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Jedlitschka, A., Ciolkowski, M., Pfahl, D.: Reporting experiments in software engineering. In: Guide to Advanced Empirical Software Engineering, pp. 201\u2013228. Springer, Heidelberg (2008)","DOI":"10.1007\/978-1-84800-044-5_8"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Juan, A.A., Kelton, W.D., Currie, C.S.M., Faulin, J.: Simheuristics applications: dealing with uncertainty in logistics, transportation, and other supply chain areas. In: WSC, pp. 3048\u20133059. IEEE (2018)","DOI":"10.1109\/WSC.2018.8632464"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.ins.2021.11.036","volume":"585","author":"DSK Karunasingha","year":"2022","unstructured":"Karunasingha, D.S.K.: Root mean square error or mean absolute error? use their ratio as well. Inf. Sci. 585, 609\u2013629 (2022)","journal-title":"Inf. Sci."},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2020","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5(1), 6 (2020)","journal-title":"Appl. Netw. Sci."},{"issue":"3","key":"25_CR19","first-page":"18","volume":"2","author":"A Liaw","year":"2002","unstructured":"Liaw, A., Wiener, M.: Classification and Regression by randomForest. R News 2(3), 18\u201322 (2002)","journal-title":"R News"},{"key":"25_CR20","unstructured":"Lopes, R., Tutenel, T., Smelik, R.M., De Kraker, K.J., Bidarra, R.: A constrained growth method for procedural floor plan generation. In: Proceedings of International Conference on Intelligent Games Simulation, pp. 13\u201320 (2010)"},{"key":"25_CR21","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.357","volume":"7","author":"I Makarov","year":"2021","unstructured":"Makarov, I., Kiselev, D., Nikitinsky, N., Subelj, L.: Survey on graph embeddings and their applications to machine learning problems on graphs. PeerJ Comput. Sci. 7, e357 (2021)","journal-title":"PeerJ Comput. Sci."},{"key":"25_CR22","unstructured":"Miao, S., Liu, M., Li, P.: Interpretable and generalizable graph learning via stochastic attention mechanism. In: International Conference on Machine Learning, pp. 15524\u201315543. PMLR (2022)"},{"key":"25_CR23","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"25_CR24","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s41019-021-00155-3","volume":"6","author":"Y Peng","year":"2021","unstructured":"Peng, Y., Choi, B., Jianliang, X.: Graph learning for combinatorial optimization: a survey of state-of-the-art. Data Sci. Eng. 6(2), 119\u2013141 (2021)","journal-title":"Data Sci. Eng."},{"key":"25_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2021.111044","volume":"182","author":"JA Pereira","year":"2021","unstructured":"Pereira, J.A., Acher, M., Martin, H., J\u00e9z\u00e9quel, J.M., Botterweck, G., Ventresque, A.: Learning software configuration spaces: a systematic literature review. J. Syst. Softw. 182, 111044 (2021)","journal-title":"J. Syst. Softw."},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Pienta, R.S., Abello, J., Kahng, M., Chau, D.H.: Scalable graph exploration and visualization: sensemaking challenges and opportunities. In: International Conference on Big Data and Smart Computing (BIGCOMP), pp. 271\u2013278. IEEE Computer Society (2015)","DOI":"10.1109\/35021BIGCOMP.2015.7072812"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Rozemberczki, B., Kiss, O., Sarkar, R.: Karate club: an API oriented open-source python framework for unsupervised learning on graphs. In: International Conference on Information and Knowledge Management (CIKM), pp. 3125\u20133132. ACM (2020)","DOI":"10.1145\/3340531.3412757"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Shaw, M.: Writing good software engineering research paper. In Proceedings of the 25th International Conference on Software Engineering, pp. 726\u2013737. IEEE Computer Society (2003)","DOI":"10.1109\/ICSE.2003.1201262"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Siegmund, N., et al.: Scalable prediction of non-functional properties in software product lines. In: SPLC (2011)","DOI":"10.1109\/SPLC.2011.20"},{"issue":"2","key":"25_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TBDATA.2022.3177455","volume":"9","author":"X Wang","year":"2022","unstructured":"Wang, X., Bo, D., Shi, C., Fan, S., Ye, Y., Philip, S.Y.: A survey on heterogeneous graph embedding: methods, techniques, applications and sources. IEEE Trans. Big Data 9(2), 415\u2013436 (2022)","journal-title":"IEEE Trans. Big Data"},{"key":"25_CR31","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou, J., et al.: Graph neural networks: a review of methods and applications. AI Open 1, 57\u201381 (2020)","journal-title":"AI Open"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53966-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:05:50Z","timestamp":1707933950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53966-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539657","9783031539664"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53966-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","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":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"72","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":"61% - 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":"5-6","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":"1-2","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)"}}]}}