Comments on "On hidden nodes in neural nets" by G. Mirchandani and W. Cao
暂无分享,去创建一个
A comment on the above-named work (see ibid., vol.36, p.661-4, 1989) by G. Mirchandani and W. Cao is presented. The main contribution of that paper is a proof of a theorem showing that 'the maximum number of separable regions (M) in the input space is a function of both H and input space dimension (d),' where H is the number of hidden nodes or, equivalently, the number of hyperplanes. The commenter argues that this theorem was proven in the mid-nineteenth century by the mathematician Ludwig Schlafli. >
[1] L. Schläfli. Theorie der vielfachen Kontinuität , 1901 .
[2] Thomas M. Cover,et al. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..
[3] G. Mirchandani,et al. On hidden nodes for neural nets , 1989 .
[4] David Antin,et al. 100 Great Problems of Elementary Mathematics , 1965 .