Journal Article10.1016/0893-6080(96)83696-3
Structural learning with forgetting
333
TL;DR: Results demonstrate the effectiveness of structural learning with forgetting, applied to various examples: the discovery of Boolean functions, classification of irises, discovery of recurrent networks, prediction of time series and rule extraction from mushroom data.
read more
About: This article is published in Neural Networks. The article was published on 01 Apr 1996. The article focuses on the topics: Instance-based learning & Semi-supervised learning.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
DENFIS: dynamic evolving neural-fuzzy inference system and its application for time-series prediction
Nikola Kasabov,Qun Song +1 more
TL;DR: It is demonstrated that DENFIS can effectively learn complex temporal sequences in an adaptive way and outperform some well-known, existing models.
Neuro-fuzzy rule generation: survey in soft computing framework
Sushmita Mitra,Yoichi Hayashi +1 more
TL;DR: This article proposes to bring the various neuro-fuzzy models used for rule generation under a unified soft computing framework, and includes both rule extraction and rule refinement in the broader perspective of rule generation.
787
Evolving fuzzy neural networks for supervised/unsupervised online knowledge-based learning
Nikola Kasabov
- 01 Dec 2001
TL;DR: This paper introduces evolving fuzzy neural networks (EFuNNs) as a means for the implementation of the evolving connectionist systems (ECOS) paradigm that is aimed at building online, adaptive intelligent systems that have both their structure and functionality evolving in time.
532
•Posted Content
SNIP: Single-shot Network Pruning based on Connection Sensitivity
TL;DR: In this paper, a saliency criterion based on connection sensitivity is proposed to identify structurally important connections in the network for a given task, and the retained connections are indeed relevant to the given task.
322
•Proceedings Article
On evolutionary optimization with approximate fitness functions
Yaochu Jin,Markus Olhofer,Bernhard Sendhoff +2 more
- 10 Jul 2000
TL;DR: It is found that the evolutionary algorithm will converge incorrectly if the approximate model has false optima, so two strategies to control the evolution process are introduced and methods to eliminate false minima in neural network training are proposed.
192
References
A new look at the statistical model identification
TL;DR: In this article, a new estimate minimum information theoretical criterion estimate (MAICE) is introduced for the purpose of statistical identification, which is free from the ambiguities inherent in the application of conventional hypothesis testing procedure.
•Proceedings Article
Optimal Brain Damage
Yann LeCun,John S. Denker,Sara A. Solla +2 more
- 01 Jan 1989
TL;DR: A class of practical and nearly optimal schemes for adapting the size of a neural network by using second-derivative information to make a tradeoff between network complexity and training set error is derived.
•Proceedings Article
The Cascade-Correlation Learning Architecture
Scott E. Fahlman,Christian Lebiere +1 more
- 01 Jan 1989
TL;DR: The Cascade-Correlation architecture has several advantages over existing algorithms: it learns very quickly, the network determines its own size and topology, it retains the structures it has built even if the training set changes, and it requires no back-propagation of error signals through the connections of the network.
Pruning algorithms-a survey
TL;DR: The approach taken by the methods described here is to train a network that is larger than necessary and then remove the parts that are not needed.
1.8K
Related Papers (5)
[...]
Yann LeCun,John S. Denker,Sara A. Solla +2 more
- 01 Jan 1989
Scott E. Fahlman,Christian Lebiere +1 more
- 01 Jan 1989
Babak Hassibi,David G. Stork +1 more
- 30 Nov 1992
Simon Haykin
- 16 Jul 1998