Skip to content
naulon
Not checkedNot checked for notices yet.

Algorithms of hierarchical mixture of opinions of experts in problems of synthesis of information management systems city development

Pocebneva Irina, Belousov Vadim, Fateeva Irina and 2 more

MATEC Web of Conferences · 2018

doi:10.1051/matecconf/201817001120 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In the present article we will consider a class of associative machines with dynamic structure where the entrance signal exerts direct impact on the mechanism of association of output signals of experts. At the same time we are interested in such group of expert decisions at which separate expert responses unite not linearly through hierarchically organized lock networks. Hierarchical mixture of opinions of experts, along with simple mixture are examples of modular networks: neural network of a module if the calculations executed by it can be distributed on several subsystems processing different entrance signals and not crossed in the work. Output signals of these subsystems unite the integrative module which exit does not possess feedback with subsystems. In fact, the integrative module makes the decision as output signals of subsystems are grouped in the general output signal of system, and identifies what examples are samples for training of concrete modules. The most general definition of modular neural network: any set of algorithms of data processing, including algorithms of the artificial neural networks grouped for the solution of some uniform task. Automatically determine the class of associative machines with dynamic structure where the entrance signal exerts direct impact on the mechanism of association of output signals of experts, at the same time group of expert decisions at which separate expert responses unite not linearly through hierarchically organized lock networks is considered.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.