Classification of the finite algebra concepts for the description of neural network elements
Authors:
About authors
- Ph.D., Dr.Sci. professor National Mineral Resources University (Mining University)
Abstract
Contemporary information systems are characterized not only by the large volume of data stored, but also by its complexity. This complexity manifests in various interconnections this data holds. Thus, complex data is presented as a set of some basic items and a body of connections linking the data items. Complex information systems are formalized with the concepts of graph, mograph and, lately, neural network. Classification of the finite algebra concepts, such as correspondence and relation (ternary or binary), is examined. Specific kinds of relations and their properties are intended to use for the description of neural network elements.
Funding:
None
References
- Gorbatov V.A. The fundamentals of discrete mathematics. Information mathematics. Moscow, 2000. 544 p.
- Ezhov A.A., Shumskiy S.A. Neurocomputing and its use in economics and commerce. URL: http:/www.intuit.ru/
- Mutter V.M., Trofimov V.V., Ivanova I.V., Kalinushkina M.Y. Mathematical basics of digital equipment. Saint Petersburg, 1999. 351 p.
- URL: http://ru.wikipedia.org/wiki
Similar articles
Management of the value of mining company at implementation of strategic investment projects
2014 T. R. Kosovtseva, T. V. Ponomarenko
Assessment of costs associated with the introduction of technology coarse crushing on the example of the diamond deposit them. M.V.Lomonosov
2014 A. V. Iamov, I. A. Kuznetsov, A. V. Babyk, S. A. Rubis
The impact of Russia's accession to the World Trade Organization on the exploration industry
2014 A. A. Fedchenko
Principles of waste management in the mining industry under the division of property rights to mineral resource
2014 M. A. Nevskaia