SearcharxivSearch

arXiv · cond-mat/0307083

Generation of Explicit Knowledge from Empirical Data through Pruning of Trainable Neural Networks

Abstract

This paper presents a generalized technology of extraction of explicit knowledge from data. The main ideas are 1) maximal reduction of network complexity (not only removal of neurons or synapses, but removal all the unnecessary elements and signals and reduction of the complexity of elements), 2) using of adjustable and flexible pruning process (the pruning sequence shouldn't be predetermined - the user should have a possibility to prune network on his own way in order to achieve a desired network structure for the purpose of extraction of rules of desired type and form), and 3) extraction of rules not in predetermined but any desired form. Some considerations and notes about network architecture and training process and applicability of currently developed pruning techniques and rule extraction algorithms are discussed. This technology, being developed by us for more than 10 years, allowed us to create dozens of knowledge-based expert systems. In this paper we present a generalized three-step technology of extraction of explicit knowledge from empirical data.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. N. Gorban, Eu. M. Mirkes, V. G. Tsaregorodtsev. 2003-07-03. Generation of Explicit Knowledge from Empirical Data through Pruning of Trainable Neural Networks. https://arxiv.org/abs/cond-mat/0307083

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Random-Matrix Theory of Quantum Size Effects on Nuclear Magnetic Resonance in Metal Particles

The distribution function of the local density of states is computed exactly for the Wigner-Dyson ensemble of random Hamiltonians. In the absence of time-reversal symmetry, precise agreement is obtained with the "supersymmetry" theory by Efetov and Prigodin of the NMR lineshape in disordered metal particles. Upon breaking time-reversal symmetry, the variance of the Knight shift in the smallest particles is reduced by a universal factor of 2/3. ***To be published in Physical Review B.****

cond-mat

Andreev Reflection In Ferromagnet-Superconductor Junctions

The transport properties of a ferromagnet-superconductor (FS) junction are studied in a scattering formulation. Andreev reflection at the FS interface is strongly affected by the exchange interaction in the ferromagnet. The conductance G_FS of a ballistic point contact between F and S can be both larger or smaller than the value G_FN with the superconductor in the normal state, depending on the ratio of the exchange and Fermi energies. If the ferromagnet contains a tunnel barrier (I), the conductance G_FIFS exhibits resonances which do not vanish in linear response -- in contrast to the Tomasch oscillations for non-ferromagnetic materials.

cond-mat

Long-Range Energy-Level Interaction in Small Metallic Particles

We consider the energy level statistics of non-interacting electrons which diffuse in a $ d $-dimensional disordered metallic conductor of characteristic Thouless energy $ E_c. $ We assume that the level distribution can be written as the Gibbs distribution of a classical one-dimensional gas of fictitious particles with a pairwise additive interaction potential $ f(\varepsilon ). $ We show that the interaction which is consistent with the known correlation function of pairs of energy levels is a logarithmic repulsion for level separations $ \varepsilon E_c, $ $ f(\varepsilon ) $ vanishes as a power law in $ \varepsilon /E_c $ with exponents $ -{1 \over 2},-2, $ and $ -{3 \over 2} $ for $ d=1,2, $ and 3, respectively. While for $ d=1,2 $ the energy-level interaction is always repulsive, in three dimensions there is long-range level attraction after the short-range logarithmic repulsion.

cond-mat