{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:08:48Z","timestamp":1743116928021,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276171"},{"type":"electronic","value":"9783030276188"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-27618-8_3","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"30-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Querying Knowledge Graphs with Natural Languages"],"prefix":"10.1007","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayi","family":"Zhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"3_CR1","unstructured":"Crf++. https:\/\/taku910.github.io\/crfpp\/"},{"key":"3_CR2","unstructured":"Dbpedia. https:\/\/en.wikipedia.org\/wiki\/DBpedia"},{"key":"3_CR3","unstructured":"Alonso, O., Gamon, M., Haas, K., Pantel, P.: Diversity and relevance in social search. In: DDR (2012)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bendersky, M., Metzler, D., Croft, W.B.: Learning concept importance using a weighted dependence model. In: WSDM 2010, pp. 31\u201340 (2010)","DOI":"10.1145\/1718487.1718492"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155\u2013166. ACM (2012)","DOI":"10.1145\/2213556.2213580"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: ICDE (2013)","DOI":"10.1007\/978-3-642-32281-5_28"},{"issue":"10","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. TPAMI 26(10), 1367\u20131372 (2004)","journal-title":"TPAMI"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-05813-9_11","volume-title":"Database Systems for Advanced Applications","author":"Xiaofeng Ding","year":"2014","unstructured":"Ding, X., Jia, J., Li, J., Liu, J., Jin, H.: Top-k similarity matching in large graphs with attributes. In: DASFAA, pp. 156\u2013170 (2014)"},{"key":"3_CR9","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6, 1510\u20131521 (2013)","journal-title":"PVLDB"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: WWW (2009)","DOI":"10.1145\/1526709.1526761"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376676"},{"key":"3_CR12","unstructured":"Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kasneci, G., Elbassuoni, S., Weikum, G.: MING: mining informative entity relationship subgraphs. In: CIKM, pp. 1653\u20131656 (2009)","DOI":"10.1145\/1645953.1646196"},{"key":"3_CR14","unstructured":"Lafferty, J.D., McCallum, A., Pereira, F.C.N.: Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: ICML, USA, pp. 282\u2013289 (2001)"},{"issue":"4","key":"3_CR15","first-page":"310","volume":"5","author":"S Ma","year":"2011","unstructured":"Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4), 310\u2013321 (2011)","journal-title":"PVLDB"},{"issue":"6","key":"3_CR16","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/s00778-016-0429-2","volume":"25","author":"D Mottin","year":"2016","unstructured":"Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: a new way of searching. VLDB J. 25(6), 741\u2013765 (2016)","journal-title":"VLDB J."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Pound, J., Hudek, A.K., Ilyas, I.F., Weddell, G.E.: Interpreting keyword queries over web knowledge bases. In: CIKM, pp. 305\u2013314 (2012)","DOI":"10.1145\/2396761.2396803"},{"key":"3_CR18","unstructured":"Wikipedia: F-measure. http:\/\/en.wikipedia.org\/wiki\/F1_score"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Yahya, M., Berberich, K., Elbassuoni, S., Weikum, G.: Robust question answering over the web of linked data. In: CIKM, pp. 1107\u20131116 (2013)","DOI":"10.1145\/2505515.2505677"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yang, Z., Fu, A.W., Liu, R.: Diversified top-k subgraph querying in a large graph. In: SIGMOD, pp. 1167\u20131182 (2016)","DOI":"10.1145\/2882903.2915216"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Zheng, W., Cheng, H., Zou, L., Yu, J.X., Zhao, K.: Natural language question\/answering: let users talk with the knowledge graph. In: CIKM, pp. 217\u2013226 (2017)","DOI":"10.1145\/3132847.3132977"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Lu, Y.: Top-k subgraph matching query in a large graph. In: Ph.D. workshop in CIKM (2007)","DOI":"10.1145\/1316874.1316897"}],"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-030-27618-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:28:11Z","timestamp":1710350891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27618-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276171","9783030276188"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27618-8_3","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":"6 August 2019","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":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","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":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"32","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":"34","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":"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 (provided by the conference organizers)"}},{"value":"4-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":"3-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)"}}]}}