Enumeration of Linear Threshold Functions From The Lattice of Hyperplane Intersections  

Oleh:

Ojha, P. C.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 11 no. 4 (2000), page 839-850.
Topik: lattice theory; enumeration; linear; functions; lattice; hyperplane; intersections

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: II36.4 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

We present a method for enumerating linear threshold functions of n -dimensional binary inputs, for neural nets. Our starting point is the geometric lattice Ln of hyperplane intersections in the dual (weight) space. We show how the hyperoctahedral group On + 1, the symmetry group of the (n + 1) - dimensional hypercube, can be used to construct a symmetry - adapted poset of hyperplane intersections ? n which is much more compact and tractable than Ln. A generalized Zeta function and its inverse, the generalized Mobius function, are defined on ?n. Symmetry - adapted posets of hyperplane intersections for three -, four -, and five - dimensional inputs are constructed and the number of linear threshold functions is computed from the generalized Mobius function. Finally, we show how equivalence classes of linear threshold functions are enumerated by unfolding the symmetry - adapted poset of hyperplane intersections into a symmetry - adapted face poset. It is hoped that our construction will lead to ways of placing asymptotic bounds on the number of equivalence classes of linear threshold functions.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali