Informatica

In the legal domain, ontologies organize legal concepts and their relationships, while knowledge graphs connect these concepts to specific entities in legal documents. This study proposes a solution for integrating ontology and knowledge graph, called Legal-Onto model, to construct a knowledge base of an intelligent retrieval system in the legal domain. The Legal-Onto model combines ontology as the conceptual layer and knowledge graphs as the implementation layer for representing the content of legal documents. This relational model is integrated with a structure of knowledge graph to identify relations between concepts and entities extracted from ontology in the determined domain. Moreover, this research addresses inherent challenges in semantic-based knowledge-driven search. The specific objective is to accurately extract relevant information from legal documents to respond to entered queries. The experimental results show that this method is more effective than state-of-the-art methods in natural language processing and large language models, which are without specific legal domain knowledge.

The problem of post‐processing of a classified image is addressed from the point of view of the Dempster–Shafer theory of evidence. Each neighbour of a pixel being analyzed is considered as an item of evidence supporting particular hypotheses regarding the class label of that pixel. The strength of support is defined as a function of the degree of uncertainty in class label of the neighbour, and the distance between the neighbour and the pixel being considered. A post‐processing window defines the neighbours. Basic belief masses are obtained for each of the neighbours and aggregated according to the rule of orthogonal sum. The final label of the pixel is chosen according to the maximum of the belief function.

This paper considers the technique to construct the general decision rule for the contradictory expert classification of objects which are described with many qualitative attributes. This approach is based on the theory of multiset metric spaces, and allows to classify a collection of multi-attribute objects and define the classification rule which approximates the set of individual sorting rules.

Influence of projection pursuit on classification errors and estimates of a posteriori probabilities from the sample is considered. Observed random variable is supposed to satisfy a multidimensional Gaussian mixture model. Presented computer simulation results show that for comparatively small sample size classification using projection pursuit algorithm gives better accuracy of estimates of a posteriori probabilities and less classification error.

Rule-based systems are usually interpreted as a shallow expert systems realization tool. The paper analyses how the applicability of production rules can be extended using the proposed rule base structuring discipline. Its main constructions are rule grouping according to elementary aspects of investigation, and decomposition of actions. In addition, the rule cycle construction is used for discrete time simulation tasks. The proposed method is illustrated by 2 applications: the expert subsystem for a database, and the simulator of a water heater.