PROBABILISTIC DESIGN OF LAYERED NEURAL NETWORKS BASED ON THEIR UNIFIED FRAMEWORK

被引:15
作者
WATANABE, S [1 ]
FUKUMIZU, K [1 ]
机构
[1] RICOH CO LTD,CTR COMMUN RES & DEV,KOHOKU KU,YOKOHAMA,KANAGAWA 222,JAPAN
来源
IEEE TRANSACTIONS ON NEURAL NETWORKS | 1995年 / 6卷 / 03期
关键词
Computational geometry - Computer architecture - Data processing - Estimation - Inference engines - Input output programs - Probability - Probability density function - Statistical methods;
D O I
10.1109/72.377974
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose three ways of designing artificial neural networks based on a unified framework and use them to develop new models. First, we show that artificial neural networks can be understood as probability density functions with parameters. Second, we propose three design methods for new models: a method for estimating the occurrence probability of the inputs, a method for estimating the variance of the outputs, and a method for estimating the simultaneous probability of inputs and outputs. Third, we design three new models using the proposed methods: a neural network with occurrence probability estimation, a neural network with output variance estimation, and a probability competition neural network. Our experimental results show that the proposed neural networks have important abilities in information processing: they can tell how often a given input occurs, how widely the outputs are distributed, and from what kinds of inputs a given output is inferred.
引用
收藏
页码:691 / 702
页数:12
相关论文
共 26 条
[1]   NEW LOOK AT STATISTICAL-MODEL IDENTIFICATION [J].
AKAIKE, H .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1974, AC19 (06) :716-723
[2]  
AMARI S, 1985, LECTURE NOTES STATIS, V28
[3]  
Amari S., 1992, NEURAL COMPUT, V4, P608
[4]   What Size Net Gives Valid Generalization? [J].
Baum, Eric B. ;
Haussler, David .
NEURAL COMPUTATION, 1989, 1 (01) :151-160
[5]  
CRAMER H, 1946, MATH METHODS STATIST
[6]  
Cybenko G., 1989, Mathematics of Control, Signals, and Systems, V2, P303, DOI 10.1007/BF02551274
[7]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[8]  
Duda R. O., 1973, PATTERN CLASSIFICATI, V3
[9]   CLASSICAL ASYMPTOTIC PROPERTIES OF A CERTAIN ESTIMATOR RELATED TO MAXIMUM LIKELIHOOD ESTIMATOR [J].
FU, JC ;
GLESER, LJ .
ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 1975, 27 (02) :213-233
[10]   ON THE APPROXIMATE REALIZATION OF CONTINUOUS-MAPPINGS BY NEURAL NETWORKS [J].
FUNAHASHI, K .
NEURAL NETWORKS, 1989, 2 (03) :183-192