METHOD OF DETERMINING WEIGHTS OF TEMPORAL RULES IN MARKOV LOGIC NETWORK FOR BUILDING KNOWLEDGE BASE IN INFORMATION CONTROL SYSTEMS

The problem of constructing and expanding the temporal knowledge base for the information-control system is considered. This knowledge base is formally represented by the Markov logic network. It is shown that the behavior of the control object of a given class can be reflected in the form of a set of weighted temporal rules. These rules are formed on the basis of identifying links between events that reflect known variants of the behavior of the control object. A method is proposed for calculating the weights of temporal rules in a Markov logic network for a given level of detail of the control object. The level of detail is determined by the context for executing the sequences of control actions and for weighted temporal rules is specified by selecting subsets of the event attributes. The method includes such basic phases: preparation of a subset of temporal rules for a given level of detail; finding the weights of the rules taking into account the a priori probabilities of the event traces. The method creates conditions for supporting management decisions in information management systems at various levels of detail of complex management objects. Decision support is provided by predicting the probability of success in executing a sequence of actions that implement the management function in the current situation. These probabilities are determined using the weights of the temporal rules.

[1]  Pedro M. Domingos,et al.  Entity Resolution with Markov Logic , 2006, Sixth International Conference on Data Mining (ICDM'06).

[2]  Pedro M. Domingos,et al.  Efficient Weight Learning for Markov Logic Networks , 2007, PKDD.

[3]  Fabian M. Suchanek,et al.  Canonicalizing Open Knowledge Bases , 2014, CIKM.

[4]  Amir Sadeghian,et al.  Feature Engineering for Knowledge Base Construction , 2014, IEEE Data Eng. Bull..

[5]  Gerhard Weikum,et al.  Real-time Population of Knowledge Bases: Opportunities and Challenges , 2012, AKBC-WEKEX@NAACL-HLT.

[6]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[7]  J. Shewchuk.  An Introduction to the Conjugate Gradient Method Without the Agonizing Pain , 1994 .

[8]  Pedro M. Domingos,et al.  Formula-Based Probabilistic Inference , 2010, UAI.

[9]  Christopher Ré,et al.  Scaling Inference for Markov Logic via Dual Decomposition , 2012, 2012 IEEE 12th International Conference on Data Mining.

[10]  Gerhard Weikum,et al.  Query-Driven On-The-Fly Knowledge Base Construction , 2017, Proc. VLDB Endow..

[11]  Christopher De Sa,et al.  Incremental Knowledge Base Construction Using DeepDive , 2015, The VLDB Journal.

[12]  Simon L. Kendal,et al.  An introduction to knowledge engineering , 2007 .

[13]  Somdeb Sarkhel,et al.  Lifted MAP Inference for Markov Logic Networks , 2014, AISTATS.

[14]  Yevgeniy V. Bodyanskiy,et al.  Implementation of search mechanism for implicit dependences in process mining , 2013, 2013 IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS).

[15]  Christopher Ré,et al.  DeepDive: Web-scale Knowledge-base Construction using Statistical Learning and Inference , 2012, VLDS.

[16]  Viktor Levykin,et al.  METHOD OF AUTOMATED CONSTRUCTION AND EXPANSION OF THE KNOWLEDGE BASE OF THE BUSINESS PROCESS MANAGEMENT SYSTEM , 2018 .

[17]  Pedro M. Domingos,et al.  Discriminative Training of Markov Logic Networks , 2005, AAAI.

[18]  Chalyi Sergii,et al.  Causality-based model checking in business process management tasks , 2018, 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT).