Learning Commonalities in SPARQL.
Lecture Notes in Computer Science(2017)
摘要
Finding the commonalities between descriptions of data or knowledge is a foundational reasoning problem of Machine Learning. It was formalized in the early 70's as computing a least general generalization (lgg) of such descriptions. We revisit this well-established problem in the SPARQL query language for RDF graphs. In particular, and by contrast to the literature, we address it for the entire class of conjunctive SPARQL queries, a.k.a. Basic Graph Pattern Queries (BGPQs), and crucially, when background knowledge is available as RDF Schema ontological constraints, we take advantage of it to devise much more precise lggs, as our experiments on the popular DBpedia dataset show.
更多查看译文
关键词
BGP queries,RDF,RDFS,Least general generalization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络