Means for parameterization of exemplar queries
Author(s) -
Sergey Kosikov,
Viacheslav Wolfengagen,
Larisa Ismailova,
Igor O. Slieptsov
Publication year - 2018
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2018.11.059
Subject(s) - computer science , graph , theoretical computer science , information retrieval , semantics (computer science) , ranking (information retrieval) , programming language
The paper considers the problem of enhancing the semantic capabilities of information systems, which improve the quality of the solution of the search problem on demand. The information in the system is assumed to be presented in the form of an information graph. The paper considers queries specifying a sample of the structure of a graph that must be received as a response, or exemplar queries. The response is supposed to be received to the query using the semantic filtering, based on the ranking of the exemplar results similar to the query graph. The problem of manipulating similar information graph structures is considered, this problem is necessary for semantic filtering. The paper offers to solve the problem basing on the use of methods of applicative computing systems and transformational semantics. The paper discusses the architecture and means of supporting the search for and manipulation of similar structures of information graphs.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom