An RDF approximate answer query method based on node context vector space

A technology of vector space and query method, which is applied in the field of obtaining approximate answers from RDF query graphs on the Semantic Web, and can solve problems such as low quality of approximate answers, inapplicable methods, and low efficiency

Active Publication Date: 2018-12-11
GUANGDONG XIAN JIAOTONG UNIV ACADEMY
View PDF6 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] 1) Firstly, it is aimed at the database field, and the paradigm conversion and paradigm combination in the method are mainly aimed at relational databases and SQL queries, while the present invention is aimed at RDF data in the semantic web field, and RDF data is a kind of graph data. The data model and query mechanism are different from the database field, so the method of the above patent cannot be applied
[0006] 2) The method of the above patent is to modify the original query as the main task, which belongs to the query-driven method, and the efficiency is low, and the quality of the approximate answer is not high

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An RDF approximate answer query method based on node context vector space
  • An RDF approximate answer query method based on node context vector space
  • An RDF approximate answer query method based on node context vector space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0076] see figure 1 , the present invention a kind of RDF approximate answer inquiry method based on node context vector space, comprises the following steps:

[0077] S1. Analyze the nodes and edges in the RDF graph, and define the context information of a node; again, traverse all the nodes and edges in the RDF graph, and represent the RDF graph in a low-dimensional continuous vector space. The method of negative sampling improves efficiency. In the generated vector space, RDF node vectors with similar semantics are closely distributed, and the representation of nodes and edges between nodes is the translation operation between vectors;

[0078] S101. The RDF graph is defined as: let ε be a node set, is the set of edges between nodes.

[0079] An RDF triple can be expressed as h , r, e t >, where e h , e t ∈ε, i.e. at the head node e h with tail node e t There is an edge r between, eg , an RDF graph is a finite set of RDF triples.

[0080] S102. RDF node contex...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses an RDF approximate answer query method based on node context vector space. Firstly, the vector space representation of an RDF graph is generated, then the RDF query graph is partitioned, and then the approximate answer is found based on the vector space. Finally, the approximate answer results of the RDF query graph are returned to help users to define the information requirements and modify the initial RDF query graph. The invention can solve the problem of RDF inquiry empty set answers, in which the learning method of RDF representation based on node context can generate the continuous vector representation of RDF data set offline. The RDF query graph can satisfy the user's query intention when projected in continuous vector space, and the generated approximate answers and corresponding recommended queries are sorted and returned to the user for explanation. This data-driven solution method improves the quality of RDF approximate query and significantly reduces the time overhead.

Description

technical field [0001] The invention belongs to the technical field of obtaining approximate answers from RDF query graphs on a semantic web, and in particular relates to an RDF approximate answer query method based on a node context vector space. Background technique [0002] With the development of Semantic Web technology, RDF (Resource Description Framework) has become a standard specification recommended by the Internet Society (W3C) to publish, share, and connect various data resources on the Internet. The Internet already contains more than 100 billion pieces of RDF data and is still increasing rapidly, which contains rich information resources. Querying and obtaining such information is becoming an urgent need for people. Retrieving RDF data requires the user to accurately grasp the data schema of the RDF query graph, and an inappropriate RDF query graph is prone to empty query results. Therefore, obtaining the approximate answer of an RDF query graph and the corres...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06F17/27
CPCG06F40/30
Inventor 王萌刘均王瑞杰
Owner GUANGDONG XIAN JIAOTONG UNIV ACADEMY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap