Heuristic self-organization in problems of engineering cybernetics

  • Authors:
  • A. G. Ivakhnenko

  • Affiliations:
  • Institute of Cybernetics, Kiev, USSR

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 1970

Quantified Score

Hi-index 22.15

Visualization

Abstract

The systems, or programs, of heuristic self-organization are defined as those which include the generators of random hypotheses, or combinations, and several layers of threshold self-sampling of useful information. The complexity of combinations increases from layer to layer. A known system, Rosenblatt's perceptron, may be taken as an example. The Group Method of Data Handling (GMDH) based on the principles of heuristic self-organization is developed to solve complex problems with large dimensionality when the data sequence is very short. Two examples are given to illustrate how this method applies to problems of predicting random processes and to identifying characteristics of a multiextremum plant. One: Heuristics are groundless decisions which have no mathematical proofs. They give us the results which are only good enough for practice, but they are not the best ones. The other: No! Heuristics are decisions in a field irrelevant to the subject and competence of mathematics. The results of heuristics are often much better than those which can be obtained from a formalized approach.