You are here

ANAL YSIS OF TRAINED NEURALNETWORKS

Journal Name:

Publication Year:

Abstract (Original Language): 
Neural Networks are typically thought of as black boxes trained to a specific task on a large number of data samples. In many applications it becomes necessary to “look inside” of these black boxes before they can be used in practice. This is done in case of high risk applications or applications with a limited number of training samples. This paper describes several techniques of analysis of trained networks, which can be used to verify that the networks meet requirements of the application. The two main approaches advocated are sensitivity analysis and analysis by means of graphs and polytopes. The algorithms developed for the neural network analysis have been coded in form of a Matlab toolbox.
1
5

REFERENCES

References: 

1. Even S., (1979) Graph Algorithms, Rockville, Maryland, Computer Science Press.
2. Goh T.H., Wong F., (1991) Semantic Extraction Using Neural Network Modeling and Sensitivity
Analysis, Proceedings IEEE International Joint Conference on Neural Networks, 18-21.
3. Lee C., Landgrebe D., (1997) Decision Boundary Feature Extraction for Neural Networks, IEEE
Transactions on Neural Networks, 8, 1, 75-83.
4. Oh S., Lee Y., (1995) Sensitivity Analysis of Single Hidden-Layer Neural Networks, IEEE Transactions
on Neural Networks, 6, 4, 1005-1007.
5. Royden H.L., (1968) Real Analysis, New York, MacMillan

Thank you for copying data from http://www.arastirmax.com