Algorithm of correcting connections between fragments of poorly formalized information in storage and generation of new information

The author has developed an algorithm for correcting the connections between fragments of poorly formalized information received from technical systems. It is assumed that the information comes to storage and it is characterized by a finite set of indicators. These indicators are convoluted and the convolution is a weighted sum with weight coefficients. Further the resulting convolution is compared with convolutions of fragments previously received pieces of information in the storage. If the Euclidean distance between the convolutions is less than a predetermined value ε, it is believed that these pieces of information are interconnected. The connections between pieces of information are considered and corrected in the storage, i.e. the fragments of information in storage which are interconnected with up to ε, up to 2 ε, up to 3 ε etc. are identified. Thus the connection level of the first, second, third and other orders is introduced. The information that some fragments of information are connected to each other can be regarded as new information, and this new information is determined by a set of indicators, which represents a union of indicators determining the initial pieces of information...