Open AccessStochastic identification of the “Object-attribute” table based on the modified Rabiner’s method
Author(s) -
S.V. Shalagin,
Alsu Rafailovurutdinova
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1925/1/012014
Subject(s) - table (database) , row , ergodic theory , markov chain , column (typography) , identification (biology) , row and column spaces , algorithm , object (grammar) , matrix (chemical analysis) , computer science , mathematics , lookup table , data mining , frame (networking) , artificial intelligence , statistics , mathematical analysis , telecommunications , botany , materials science , database , biology , composite material , programming language
This article is about solving the problem of stochastic identification of the “Object-attribute” table based on subsets of stochastic ergodic matrices. The table has N rows and m columns. The identification is based on the implementation of the modified Rabiner’s method. We assume that the elements of m columns of the table are a discrete Markov chain of length N . The identification of each column is based on calculating the maximum probability that the Markov chain is generated based on the distribution law represented by one ergodic stochastic matrix from a given subset. An algorithm for solving this problem is proposed. Estimates of the time and hardware complexity of this algorithm, which are executed in parallel on a distributed computing system, are obtained. The dependence of the obtained estimates on the number of rows and columns of the identified table is determined. The value of N has a linear effect on the time complexity of an algorithm that implements MMR and is executed in parallel. A promising direction for future research is the distributed implementation of the proposed Algorithm.