Analysis of Images, Social Networks and Texts. 8th International Conference AIST 2019
Creating a process model (PM) is a convenient means to depict the behavior of a particular information system. However, user behavior is not static and tends to change over time. In order for them to sustain relevant, PMs have to be adjusted to ever-changing behavior. Sometimes the existing PM may be of high value (e.g. it is well-structured, or has been developed continuously by experts to later work with), which makes the approach to create a brand-new model using discovery algorithms less preferable. In this case, a different and better suitable approach to adjust PM to new behavior is to work with an existing model through repairing only such PM fragments that do not fit the actual behavior stated in sub-log. This article is to present a method for efficient decomposition of PMs for their future repair. It aims to improve the accuracy of model repair. Unlike the ones introduced earlier, this algorithm suggests finding the minimum spanning tree of undirected graph’s vertices subset. It helps to reduce the size of a fragment to be repaired in a model and enhances the quality of a repaired model according to various conformance metrics.
A large number of methods are being developed in the deep reinforcement learning area recently, but the scope of their application is limited. The number of environments does not always allow for a comprehensive assessment of a new agent training algorithm. The main purpose of this article is to present another environment for Match-3 game that could be expanded, which would have a connection with the real business. The results for the most popular deep reinforcement learning algorithms are presented as a baseline.
In this paper, we present the first gold-standard corpus of Russian noun compounds annotated with compositionality information. We used Universal Dependency treebanks to collect noun compounds according to part of speech patterns, such as ADJ-NOUN or NOUN-NOUN and annotated them according to the following schema: a phrase can be either compositional, non-compositional, or ambiguous (i.e., depending on the context it can be interpreted both as compositional or non-compositional). Next, we conduct a series of experiments to evaluate both unsupervised and supervised methods for predicting compositionality. To expand this manually annotated dataset with more non-compositional compounds and streamline the annotation process we use active learning. We show that not only the methods, previously proposed for English, are easily adapted for Russian, but also can be exploited in active learning paradigm, that increases the efficiency of the annotation process.
We investigate the performance of sentence embeddings models on several tasks for the Russian language. In our comparison, we include such tasks as multiple choice question answering, next sentence prediction, and paraphrase identification. We employ FastText embeddings as a baseline and compare it to ELMo and BERT embeddings. We conduct two series of experiments, using both unsupervised (i.e., based on similarity measure only) and supervised approaches for the tasks. Finally, we present datasets for multiple choice question answering and next sentence prediction in Russian.
Sign language is the main way to communicate for people from deaf community. However, common people mostly do not know sign language. In this paper, we overview several real-time sign language dactyl recognition systems using deep convolutional neural networks. These systems are able to recognize dactylized words gestured by signs for each letter. We evaluate our approach on American (ASL) and Russian (RSL) sign languages. This solution may help fasten the process of communication for deaf people. On the contrary, we also present the algorithm for generating sign animation from text information using text-to-sign video vocabulary, which helps to integrate sign language in dubbed TV and combining with speech recognition tool provide full translation from natural language to sign language.