{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:03:39Z","timestamp":1743087819221,"version":"3.40.3"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398469"},{"type":"electronic","value":"9783031398476"}],"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-39847-6_36","type":"book-chapter","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:02:46Z","timestamp":1692291766000},"page":"445-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Semantically Constitutive Entities in\u00a0Knowledge Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6053-4643","authenticated-orcid":false,"given":"Chong Cher","family":"Chia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6687-0525","authenticated-orcid":false,"given":"Maksim","family":"Tkachenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8245-8677","authenticated-orcid":false,"given":"Hady W.","family":"Lauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,18]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich, P.: Factoring and weighting approaches to status scores and clique idenepsication. J. Math. Sociol. 2(1), 113\u2013120 (1972)","journal-title":"J. Math. Sociol."},{"issue":"5","key":"36_CR2","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1086\/228631","volume":"92","author":"P Bonacich","year":"1987","unstructured":"Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170\u20131182 (1987)","journal-title":"Am. J. Sociol."},{"key":"36_CR3","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NeurIPS, vol. 26 (2013)"},{"issue":"4","key":"36_CR4","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti, S.P., Everett, M.G.: A graph-theoretic perspective on centrality. Soc. Netw. 28(4), 466\u2013484 (2006)","journal-title":"Soc. Netw."},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to web graph compression with communities. In: WSDM, pp. 95\u2013106 (2008)","DOI":"10.1145\/1341531.1341547"},{"issue":"1","key":"36_CR6","first-page":"742","volume":"2","author":"C Chen","year":"2009","unstructured":"Chen, C., Lin, C.X., Fredrikson, M., Christodorescu, M., Yan, X., Han, J.: Mining graph patterns efficiently via randomized summaries. PVLDB 2(1), 742\u2013753 (2009)","journal-title":"PVLDB"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"issue":"6","key":"36_CR8","doi-asserted-by":"publisher","first-page":"e0128193","DOI":"10.1371\/journal.pone.0128193","volume":"10","author":"GL Ciampaglia","year":"2015","unstructured":"Ciampaglia, G.L., Shiralkar, P., Rocha, L.M., Bollen, J., Menczer, F., Flammini, A.: Computational fact checking from knowledge networks. PLoS ONE 10(6), e0128193 (2015)","journal-title":"PLoS ONE"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"DJ Cook","year":"1993","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. JAIR 1, 231\u2013255 (1993)","journal-title":"JAIR"},{"key":"36_CR10","unstructured":"Cornu\u00e9jols, G., Nemhauser, G., Wolsey, L.: The uncapacitated facility location problem. Cornell University Operations Research and Industrial Engineering, Technical report (1983)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Dai, D., Zheng, H., Luo, F., Yang, P., Chang, B., Sui, Z.: Inductively representing out-of-knowledge-graph entities by optimal estimation under translational assumptions. arXiv preprint arXiv:2009.12765 (2020)","DOI":"10.18653\/v1\/2021.repl4nlp-1.10"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2D knowledge graph embeddings. In: AAAI. No. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Dunne, C., Shneiderman, B.: Moeps simplification: improving network visualization readability with fan, connector, and clique glyphs. In: CHI, pp. 3247\u20133256 (2013)","DOI":"10.1145\/2470654.2466444"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-90-481-8847-5_10","volume-title":"Theory and applications of ontology: Computer Applications","author":"C Fellbaum","year":"2010","unstructured":"Fellbaum, C.: WordNet. In: Poli, R., Healy, M., Kameas, A. (eds.) Theory and applications of ontology: Computer Applications, pp. 231\u2013243. Springer, Dordrecht (2010). https:\/\/doi.org\/10.1007\/978-90-481-8847-5_10"},{"issue":"3","key":"36_CR15","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2006.12.055","volume":"191","author":"K Fleszar","year":"2008","unstructured":"Fleszar, K., Hindi, K.S.: An effective VNS for the capacitated p-median problem. Eur. J. Oper. Res. 191(3), 612\u2013622 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40, 35\u201341 (1977)","journal-title":"Sociometry"},{"key":"36_CR17","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2022)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Arepsicial Intelligence)","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-030-79463-7_21","volume-title":"Advances and Trends in Arepsicial Intelligence. From Theory to Practice","author":"F Hamann","year":"2021","unstructured":"Hamann, F., Ulges, A., Krechel, D., Bergmann, R.: Open-world knowledge graph completion benchmarks for knowledge discovery. In: Fujita, H., Selamat, A., Lin, J.C.-W., Ali, M. (eds.) IEA\/AIE 2021. LNCS (LNAI), vol. 12799, pp. 252\u2013264. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79463-7_21"},{"issue":"46","key":"36_CR19","doi-asserted-by":"publisher","first-page":"16569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch, J.E.: An index to quanepsy an individual\u2019s scienepsic research output. PNAS 102(46), 16569\u201316572 (2005)","journal-title":"PNAS"},{"issue":"9","key":"36_CR20","first-page":"913","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang, K., Wang, S., Bevilacqua, G., Xiao, X., Lakshmanan, L.V.: Revisiting the stop-and-stare algorithms for influence maximization. PVLDB 10(9), 913\u2013924 (2017)","journal-title":"PVLDB"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Huang, X., Zhang, J., Li, D., Li, P.: Knowledge graph embedding based question answering. In: WSDM, pp. 105\u2013113 (2019)","DOI":"10.1145\/3289600.3290956"},{"key":"36_CR22","unstructured":"vol. Jenatton, R., Roux, N., Bordes, A., Obozinski, G.R.: A latent factor model for highly multi-relational data. In: NeurIPS, vol. 25 (2012)"},{"key":"36_CR23","doi-asserted-by":"crossref","unstructured":"Ji, G., He, S., Xu, L., Liu, K., Zhao, J.: Knowledge graph embedding via dynamic mapping matrix. In: COLING-IJCNLP, pp. 687\u2013696 (2015)","DOI":"10.3115\/v1\/P15-1067"},{"issue":"2","key":"36_CR24","first-page":"494","volume":"33","author":"S Ji","year":"2021","unstructured":"Ji, S., Pan, S., Cambria, E., Marttinen, P., Philip, S.Y.: A survey on knowledge graphs: representation, acquisition, and applications. TNNLS 33(2), 494\u2013514 (2021)","journal-title":"TNNLS"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"11","key":"36_CR26","doi-asserted-by":"publisher","first-page":"2221","DOI":"10.1016\/j.physa.2009.02.013","volume":"388","author":"A Korn","year":"2009","unstructured":"Korn, A., Schubert, A., Telcs, A.: Lobby index in networks. Physica A 388(11), 2221\u20132226 (2009)","journal-title":"Physica A"},{"key":"36_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2529310","volume":"33","author":"JR Landis","year":"1977","unstructured":"Landis, J.R., Koch, G.G.: The measurement of observer agreement for categorical data. Biometrics 33, 159\u2013174 (1977)","journal-title":"Biometrics"},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Li, C.T., Lin, S.D.: Egocentric information abstraction for heterogeneous social networks. In: ASONAM, pp. 255\u2013260. IEEE (2009)","DOI":"10.1109\/ASONAM.2009.38"},{"key":"36_CR29","unstructured":"Likert, R.: A technique for the measurement of attitudes. Arch. Psychol (1932)"},{"key":"36_CR30","unstructured":"Liu, S., Grau, B., Horrocks, I., Kostylev, E.: Indigo: GNN-based inductive knowledge graph completion using pair-wise encoding. In: NeurIPS, vol. 34 (2021)"},{"issue":"3","key":"36_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186727","volume":"51","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: a survey. CSUR 51(3), 1\u201334 (2018)","journal-title":"CSUR"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Maccioni, A., Abadi, D.J.: Scalable pattern matching over compressed graphs via dedensification. In: KDD, pp. 1755\u20131764 (2016)","DOI":"10.1145\/2939672.2939856"},{"key":"36_CR33","unstructured":"Mahdisoltani, F., Biega, J., Suchanek, F.: Yago3: a knowledge base from multilingual wikipedias. In: CIDR (2014)"},{"issue":"5","key":"36_CR34","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/3191513","volume":"61","author":"T Mitchell","year":"2018","unstructured":"Mitchell, T., et al.: Never-ending learning. Commun. ACM 61(5), 103\u2013115 (2018)","journal-title":"Commun. ACM"},{"issue":"3","key":"36_CR35","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"JM Mulvey","year":"1984","unstructured":"Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18(3), 339\u2013348 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"36_CR36","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121 (2017)","DOI":"10.18653\/v1\/N18-2053"},{"key":"36_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-04648-4_23","volume-title":"Computational Data and Social Networks","author":"HT Nguyen","year":"2018","unstructured":"Nguyen, H.T., Dinh, T.N., Thai, M.T.: Revisiting of revisiting the stop-and-stare algorithms for influence maximization. In: Chen, X., Sen, A., Li, W.W., Thai, M.T. (eds.) CSoNet 2018. LNCS, vol. 11280, pp. 273\u2013285. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04648-4_23"},{"key":"36_CR38","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"36_CR39","unstructured":"Nickel, M., Tresp, V., Kriegel, H.P.: A three-way model for collective learning on multi-relational data. In: ICML (2011)"},{"key":"36_CR40","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford InfoLab (1999)"},{"key":"36_CR41","doi-asserted-by":"crossref","unstructured":"Purohit, M., Prakash, B.A., Kang, C., Zhang, Y., Subrahmanian, V.: Fast influence-based coarsening for large networks. In: KDD, pp. 1296\u20131305 (2014)","DOI":"10.1145\/2623330.2623701"},{"issue":"2","key":"36_CR42","first-page":"314","volume":"31","author":"M Riondato","year":"2017","unstructured":"Riondato, M., Garc\u00eda-Soriano, D., Bonchi, F.: Graph summarization with quality guarantees. DMKD 31(2), 314\u2013349 (2017)","journal-title":"DMKD"},{"key":"36_CR43","doi-asserted-by":"crossref","unstructured":"Safavi, T., Koutra, D.: CoDEx: a comprehensive knowledge graph completion benchmark. In: EMNLP, pp. 8328\u20138350 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.669"},{"issue":"6","key":"36_CR44","first-page":"1427","volume":"12","author":"Z Shen","year":"2006","unstructured":"Shen, Z., Ma, K.L., Eliassi-Rad, T.: Visual analysis of large heterogeneous social networks by semantic and structural abstraction. IEEE TVCG 12(6), 1427\u20131439 (2006)","journal-title":"IEEE TVCG"},{"issue":"1","key":"36_CR45","first-page":"149","volume":"22","author":"F Stefanello","year":"2015","unstructured":"Stefanello, F., de Ara\u00fajo, O.C., M\u00fcller, F.M.: Matheuristics for the capacitated p-median problem. ITOR 22(1), 149\u2013167 (2015)","journal-title":"ITOR"},{"key":"36_CR46","doi-asserted-by":"crossref","unstructured":"Toutanova, K., Chen, D.: Observed versus latent features for knowledge base and text inference. In: CVSC, pp. 57\u201366 (2015)","DOI":"10.18653\/v1\/W15-4007"},{"key":"36_CR47","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS, vol. 30 (2017)"},{"key":"36_CR48","doi-asserted-by":"publisher","first-page":"104773","DOI":"10.1109\/ACCESS.2021.3094196","volume":"9","author":"Z Wan","year":"2021","unstructured":"Wan, Z., Mahajan, Y., Kang, B.W., Moore, T.J., Cho, J.H.: A survey on centrality metrics and their network resilience analysis. IEEE Access 9, 104773\u2013104819 (2021)","journal-title":"IEEE Access"},{"key":"36_CR49","doi-asserted-by":"crossref","unstructured":"Wang, P., Han, J., Li, C., Pan, R.: Logic attention based neighborhood aggregation for inductive knowledge graph embedding. In: AAAI, vol. 33, pp. 7152\u20137159 (2019)","DOI":"10.1609\/aaai.v33i01.33017152"},{"key":"36_CR50","unstructured":"Wang, Q.,et al.: Coke: contextualized knowledge graph embedding. arXiv preprint arXiv:1911.02168 (2019)"},{"issue":"12","key":"36_CR51","first-page":"2724","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: a survey of approaches and applications. TKDD 29(12), 2724\u20132743 (2017)","journal-title":"TKDD"},{"key":"36_CR52","doi-asserted-by":"crossref","unstructured":"Wang, X., He, X., Cao, Y., Liu, M., Chua, T.S.: KGAT: knowledge graph attention network for recommendation. In: KDD, pp. 950\u2013958 (2019)","DOI":"10.1145\/3292500.3330989"},{"key":"36_CR53","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: AAAI, vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"36_CR54","unstructured":"Yao, L., Mao, C., Luo, Y.: KG-BERT: bert for knowledge graph completion. arXiv preprint arXiv:1909.03193 (2019)"},{"key":"36_CR55","doi-asserted-by":"crossref","unstructured":"Zhang, N., Tian, Y., Patel, J.M.: Discovery-driven graph summarization. In: ICDE, pp. 880\u2013891. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447830"},{"key":"36_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-319-46523-4_39","volume-title":"The Semantic Web \u2013 ISWC 2016","author":"L Zhu","year":"2016","unstructured":"Zhu, L., Ghasemi-Gol, M., Szekely, P., Galstyan, A., Knoblock, C.A.: Unsupervised entity resolution on multi-type graphs. In: Groth, P., et al. (eds.) ISWC 2016. LNCS, vol. 9981, pp. 649\u2013667. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46523-4_39"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39847-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:31:41Z","timestamp":1710333101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39847-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398469","9783031398476"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39847-6_36","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":"18 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","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":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"155","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":"49","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":"35","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":"32% - 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":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","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)"}}]}}