Iterative Generation of Higher-Order Nets in Polynomial Time Using Linear Programming  

Oleh:

Mukhopadhyay, S. ; Roy, A.

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: IEEE Transactions on Neural Networks vol. 8 no. 2 (1997), page 402-412.
Topik: linear programming; generation; polynomial time; linear programming

Ketersediaan

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

Lihat Detail Induk

Isi artikel

This paper presents an algorithm for constructing and training a class of higher-order perceptrons for classification problems. The method uses linear programming models to construct and train the net. Its polynomial time complexity is proven and computational results are provided for several well - known problems. In all cases, very small nets were created compared to those reported in other computational studies.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali