Structured query construction via knowledge graph embedding. Wang, R., Wang, M., Liu, J., Cochez, M., & Decker, S. Knowledge and Information Systems, 62(5):1819-1846, May, 2020. ![Structured query construction via knowledge graph embedding [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 2 downloads In order to facilitate the accesses of general users to knowledge graphs, an increasing effort is being exerted to construct graph-structured queries of given natural language questions. At the core of the construction is to deduce the structure of the target query and determine the vertices/edges which constitute the query. Existing query construction methods rely on question understanding and conventional graph-based algorithms which lead to inefficient and degraded performances facing complex natural language questions over knowledge graphs with large scales. In this paper, we focus on this problem and propose a novel framework standing on recent knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging generalized local knowledge graphs. Given a natural language question, the learned embedding representations of the knowledge graph are utilized to compute the query structure and assemble vertices/edges into the target query. Extensive experiments were conducted on the benchmark dataset, and the results demonstrate that our framework outperforms state-of-the-art baseline models regarding effectiveness and efficiency.
@Article{wang2020queryconstruct,
author={Wang, Ruijie
and Wang, Meng
and Liu, Jun
and Cochez, Michael
and Decker, Stefan},
title={Structured query construction via knowledge graph embedding},
journal={Knowledge and Information Systems},
year={2020},
month={May},
day={01},
volume={62},
number={5},
pages={1819-1846},
abstract={In order to facilitate the accesses of general users to knowledge graphs, an increasing effort is being exerted to construct graph-structured queries of given natural language questions. At the core of the construction is to deduce the structure of the target query and determine the vertices/edges which constitute the query. Existing query construction methods rely on question understanding and conventional graph-based algorithms which lead to inefficient and degraded performances facing complex natural language questions over knowledge graphs with large scales. In this paper, we focus on this problem and propose a novel framework standing on recent knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging generalized local knowledge graphs. Given a natural language question, the learned embedding representations of the knowledge graph are utilized to compute the query structure and assemble vertices/edges into the target query. Extensive experiments were conducted on the benchmark dataset, and the results demonstrate that our framework outperforms state-of-the-art baseline models regarding effectiveness and efficiency.},
issn={0219-3116},
doi={10.1007/s10115-019-01401-x},
url={https://doi.org/10.1007/s10115-019-01401-x}
}
Downloads: 2
{"_id":"ALYeQWPsxHbqwDHzP","bibbaseid":"wang-wang-liu-cochez-decker-structuredqueryconstructionviaknowledgegraphembedding-2020","author_short":["Wang, R.","Wang, M.","Liu, J.","Cochez, M.","Decker, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Wang"],"firstnames":["Ruijie"],"suffixes":[]},{"propositions":[],"lastnames":["Wang"],"firstnames":["Meng"],"suffixes":[]},{"propositions":[],"lastnames":["Liu"],"firstnames":["Jun"],"suffixes":[]},{"propositions":[],"lastnames":["Cochez"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Decker"],"firstnames":["Stefan"],"suffixes":[]}],"title":"Structured query construction via knowledge graph embedding","journal":"Knowledge and Information Systems","year":"2020","month":"May","day":"01","volume":"62","number":"5","pages":"1819-1846","abstract":"In order to facilitate the accesses of general users to knowledge graphs, an increasing effort is being exerted to construct graph-structured queries of given natural language questions. At the core of the construction is to deduce the structure of the target query and determine the vertices/edges which constitute the query. Existing query construction methods rely on question understanding and conventional graph-based algorithms which lead to inefficient and degraded performances facing complex natural language questions over knowledge graphs with large scales. In this paper, we focus on this problem and propose a novel framework standing on recent knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging generalized local knowledge graphs. Given a natural language question, the learned embedding representations of the knowledge graph are utilized to compute the query structure and assemble vertices/edges into the target query. Extensive experiments were conducted on the benchmark dataset, and the results demonstrate that our framework outperforms state-of-the-art baseline models regarding effectiveness and efficiency.","issn":"0219-3116","doi":"10.1007/s10115-019-01401-x","url":"https://doi.org/10.1007/s10115-019-01401-x","bibtex":"@Article{wang2020queryconstruct,\n\tauthor={Wang, Ruijie\n\tand Wang, Meng\n\tand Liu, Jun\n\tand Cochez, Michael\n\tand Decker, Stefan},\n\ttitle={Structured query construction via knowledge graph embedding},\n\tjournal={Knowledge and Information Systems},\n\tyear={2020},\n\tmonth={May},\n\tday={01},\n\tvolume={62},\n\tnumber={5},\n\tpages={1819-1846},\n\tabstract={In order to facilitate the accesses of general users to knowledge graphs, an increasing effort is being exerted to construct graph-structured queries of given natural language questions. At the core of the construction is to deduce the structure of the target query and determine the vertices/edges which constitute the query. Existing query construction methods rely on question understanding and conventional graph-based algorithms which lead to inefficient and degraded performances facing complex natural language questions over knowledge graphs with large scales. In this paper, we focus on this problem and propose a novel framework standing on recent knowledge graph embedding techniques. Our framework first encodes the underlying knowledge graph into a low-dimensional embedding space by leveraging generalized local knowledge graphs. Given a natural language question, the learned embedding representations of the knowledge graph are utilized to compute the query structure and assemble vertices/edges into the target query. Extensive experiments were conducted on the benchmark dataset, and the results demonstrate that our framework outperforms state-of-the-art baseline models regarding effectiveness and efficiency.},\n\tissn={0219-3116},\n\tdoi={10.1007/s10115-019-01401-x},\n\turl={https://doi.org/10.1007/s10115-019-01401-x}\n}\n\n\n","author_short":["Wang, R.","Wang, M.","Liu, J.","Cochez, M.","Decker, S."],"key":"wang2020queryconstruct","id":"wang2020queryconstruct","bibbaseid":"wang-wang-liu-cochez-decker-structuredqueryconstructionviaknowledgegraphembedding-2020","role":"author","urls":{"Paper":"https://doi.org/10.1007/s10115-019-01401-x"},"metadata":{"authorlinks":{}},"downloads":2},"bibtype":"article","biburl":"https://raw.githubusercontent.com/KRRVU/website/master/publications/krr.bib","dataSources":["H6xuGqu5uQ6rXhdJ4","dJmTXpbSWWjnxatYT","KenkBKiHAK4JSijXa","qyx6bB8ujfH9zqTzu"],"keywords":[],"search_terms":["structured","query","construction","via","knowledge","graph","embedding","wang","wang","liu","cochez","decker"],"title":"Structured query construction via knowledge graph embedding","year":2020,"downloads":2}