Method of extension of pseudorelevant subset
The reviewed paper is dedicated to the study of formalized models of document searching by requests. The formalization is based on linear algebra. In this framework, the search images of documents and requests are considered as the elements of the finite-dimensional vector space. The search consists in finding all solutions of a search equation on the finite set. Such an equation is unambiguously determined by the request [\textit{V. N. Reshetnikov}, Program. Comput. Software 5, 201-205 (1979); translation from Programmirovanie 1979, No. 3, 78-83 (1979; Zbl 0446.68084)]. The main attention is attached to the study of the relevance property representing the connection between representation of information requests and the documents in data archives. The paper suggests the method of constructing the pseudo-relevant subset of approximated solutions of search equations with its subsequent extension to the complete pseudo-relevant set. Finding the exact solution is implied here if one exists. An example is given how a solution can be obtained by the suggested method of search equations for a multiobjective problem of information search.
scientific article; zbMATH DE number 20599