LibreTimes

Search results for “analysis”

Categories

8 results

Communicative Type “Municipal Employee” in the Media Space: Development of an Automatic Information and Analytical Assessment System

2024Journal articleIrina Karabulatova, Konstantin Vorontsov, Daniil Okolyshev, Ludan Zhang

Vestnik Volgogradskogo gosudarstvennogo universiteta Serija 2 Jazykoznanije

The article examines the issue of representing municipal government in the media space, followed by the proposed solution for automatically identifying signs of destructive and constructive positioning of communicative types of municipal employees in the public information space. The definition of the concept of the communicative type “municipal employee” with verification features is introduced. The results of the analysis of the organization of local self-government on the example of the Moscow region allowed us to conclude that the communicative type “municipal employee” reflects a diversified system of territorial communicative position within the regional government. The information obtained during the analysis of public information space attitudes regarding the activities of municipal employees can be automated with the method of identifying linguistic markers of emotivity to determine the communicative position of territorial authorities. The suggested methodology for effective automation of the studied subject area in the humanities has been verified as possessing a high scientific potential for further research. It is concluded that the development of technology for monitoring and forecasting public threats based on “soft power” methods through automatic and expert work to identify markers of evaluative presentation of communicative types of municipal employees is designed to help regional authorities achieve the desired results in ensuring territorial identity.
0
1
@alexlegoshin

Experimental physicist and technology developer passionate about quantum optics, photonics, optical sensing, and free-space & fiber-optic communications. I also enjoy scientific computing, computational physics, and developing software for modelling, automation, and data analysis. Inspired by the future of quantum technologies — communication, cryptography and computing — as well as AI.

Combinatorial probability and the tightness of generalization bounds

2008Journal articleK. V. Vorontsov

Pattern Recognition and Image Analysis

Accurate prediction of the generalization ability of a learning algorithm is an important problem in computational learning theory. The classical Vapnik-Chervonenkis (VC) generalization bounds are too general and therefore overestimate the expected error. Recently obtained data-dependent bounds are still overestimated. To find out why the bounds are loose, we reject the uniform convergence principle and apply a purely combinatorial approach that is free of any probabilistic assumptions, makes no approximations, and provides an empirical control of looseness. We introduce new data-dependent complexity measures: a local shatter coefficient and a nonscalar local shatter profile , which can give much tighter bounds than the classical VC shatter coefficient . An experiment on real datasets shows that the effective local measures may take very small values; thus, the effective local VC dimension takes values in [0, 1] and therefore is not related to the dimension of the space.

0
1

Exact combinatorial bounds on the probability of overfitting for empirical risk minimization

2010Journal articleK. V. Vorontsov

Pattern Recognition and Image Analysis

Three general methods for obtaining exact bounds on the probability of overfitting are proposed within statistical learning theory: a method of generating and destroying sets, a recurrent method, and a blockwise method. Six particular cases are considered to illustrate the application of these methods. These are the following model sets of predictors: a pair of predictors, a layer of a Boolean cube, an interval of a Boolean cube, a monotonic chain, a unimodal chain, and a unit neighborhood of the best predictor. For the interval and the unimodal chain, the results of numerical experiments are presented that demonstrate the effects of splitting and similarity on the probability of overfitting.
0
1

Splitting and similarity phenomena in the sets of classifiers and their effect on the probability of overfitting

2009Journal articleK. V. Vorontsov

Pattern Recognition and Image Analysis

It is shown that computationally tight bounds for the probability of overfitting can be obtained only by simultaneous consideration of the following two properties of classifier sets: splitting into error levels and similarity of classifiers. For a set consisting of only two classifiers, an exact bound is obtained for the probability of overfitting. This is the simplest learning task that exhibits overfitting and the effects of splitting and similarity, which reduce the probability of overfitting. For a more complex case—a chain of classifiers—an experiment is carried out in which the effects of splitting and similarity are estimated separately. It is shown that reasonably low probabilities of overfitting can be obtained only for the sets that possess both properties.
0
1