RUS  ENG
Full version
JOURNALS // Informatsionnye Tekhnologii i Vychslitel'nye Sistemy // Archive

Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2024 Issue 2, Pages 3–14 (Mi itvs853)

DATA PROCESSING AND ANALYSIS

Processing of data for inductive inference based on non-strict probability

L. V. Arshinsky, V. S. Lebedev

Irkutsk State University of Railway Engineering, Irkutsk, Russia

Abstract: Based on methods of inductive logic, an approach to identifying of implication relationships “If A, then b” in Big Data is considered. This approach is considered in conditions of low reliability and inconsistency of data. To work in this condition, logics with vector semantics in the form of VTF logics are used. The presence or absence of phenomena in tables of their joint occurrence is formalized by truth vectors with components v$^+$ and v$^-$, where v$^+$ is a measure of the true of a statement about the presence of a phenomenon, v$^-$ is a measure of its false. On the base of statistical induction principal, the indicator of the validity of a causal relationship is calculated as the average value of the truth vectors of the corresponding non-strict propositions. The resulting value is interpreted as a non-strict probability of the relationship, which acts as a vector indicator of its validity. The applicability of the approach for processing qualitative and quantitative data, as well as data containing artifacts, is shown.

Keywords: big data, data mining, inductive inference, non-strict probability, logic with vector semantics.

DOI: 10.14357/20718632240201



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024