CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
thesis
Dynamic construction of back-propagation artificial neural networks.
Authors
Publication date
1 January 1991
Publisher
Department of Cultural and Religious Studies, The Chinese University of Hong Kong
Abstract
by Korris Fu-lai Chung.Thesis (M.Phil.) -- Chinese University of Hong Kong, 1991.Bibliography: leaves R-1 - R-5.LIST OF FIGURES --- p.viLIST OF TABLES --- p.viiiChapter 1 --- INTRODUCTIONChapter 1.1 --- Recent Resurgence of Artificial Neural Networks --- p.1-1Chapter 1.2 --- A Design Problem in Applying Back-Propagation Networks --- p.1-4Chapter 1.3 --- Related Works --- p.1-6Chapter 1.4 --- Objective of the Research --- p.1-8Chapter 1.5 --- Thesis Organization --- p.1-9Chapter 2 --- MULTILAYER FEEDFORWARD NETWORKS (MFNs) AND BACK-PRO- PAGATION (BP) LEARNING ALGORITHMChapter 2.1 --- Introduction --- p.2-1Chapter 2.2 --- From Perceptrons to MFNs --- p.2-2Chapter 2.3 --- From Delta Rule to BP Algorithm --- p.2-6Chapter 2.4 --- A Variant of BP Algorithm --- p.2-12Chapter 3 --- INTERPRETATIONS AND PROPERTIES OF BP NETWORKSChapter 3.1 --- Introduction --- p.3-1Chapter 3.2 --- A Pattern Classification View on BP Networks --- p.3-2Chapter 3.2.1 --- Pattern Space Interpretation of BP Networks --- p.3-2Chapter 3.2.2 --- Weight Space Interpretation of BP Networks --- p.3-3Chapter 3.3 --- Local Minimum --- p.3-5Chapter 3.4 --- Generalization --- p.3-6Chapter 4 --- GROWTH OF BP NETWORKSChapter 4.1 --- Introduction --- p.4-1Chapter 4.2 --- Problem Formulation --- p.4-1Chapter 4.3 --- Learning an Additional Pattern --- p.4-2Chapter 4.4 --- A Progressive Training Algorithm --- p.4-4Chapter 4.5 --- Experimental Results and Performance Analysis --- p.4-7Chapter 4.6 --- Concluding Remarks --- p.4-16Chapter 5 --- PRUNING OF BP NETWORKSChapter 5.1 --- Introduction --- p.5-1Chapter 5.2 --- Characteristics of Hidden Nodes in Oversized Networks --- p.5-2Chapter 5.2.1 --- Observations from an Empirical Study --- p.5-2Chapter 5.2.2 --- Four Categories of Excessive Nodes --- p.5-3Chapter 5.2.3 --- Why are they excessive ? --- p.5-6Chapter 5.3 --- Pruning of Excessive Nodes --- p.5-9Chapter 5.4 --- Experimental Results and Performance Analysis --- p.5-13Chapter 5.5 --- Concluding Remarks --- p.5-19Chapter 6 --- DYNAMIC CONSTRUCTION OF BP NETWORKSChapter 6.1 --- A Hybrid Approach --- p.6-1Chapter 6.2 --- Experimental Results and Performance Analysis --- p.6-2Chapter 6.3 --- Concluding Remarks --- p.6-7Chapter 7 --- CONCLUSIONS --- p.7-1Chapter 7.1 --- Contributions --- p.7-1Chapter 7.2 --- Limitations and Suggestions for Further Research --- p.7-2REFERENCES --- p.R-lAPPENDIXChapter A.1 --- A Handwriting Numeral Recognition Experiment: Feature Extraction Technique and Sampling Process --- p.A-1Chapter A.2 --- Determining the distance d= δ2/2r in Lemma 1 --- p.A-
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
CUHK Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:cuhk-dr:cuhk_318773
Last time updated on 09/11/2016