Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

DOI10.1023/A:1009673915255zbMATH Open1008.68702MaRDI QIDQ1857516FDOQ1857516

Authors: Alioune Ngom, Corina Reischer, Ivan Stojmenović, Dan A. Simovici 

Publication date: 19 February 2003

Published in: Neural Processing Letters (Search for Journal in Brave)

Recommendations

• The computing capacity of three-input multiple-valued one-threshold perceptrons
• scientific article; zbMATH DE number 46318
• Bounds on the learning capacity of some multi-layer networks
• A generalized learning algorithm of perception and it's application in pattern recognition

zbMATH Keywords

learningpartial order setperceptronsmultilinear separabilitymultiple-valued multiple-threshold functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Cited In (7)

• Topological equivalence classification and enumeration of \(n\)-input linearly separable Boolean functions
• Convergence of an iterative algorithm for computing parameters of multi-valued threshold functions
• Learning Permutations with Exponential Weights
• On data classification by iterative linear partitioning
• Multiple threshold perceptron
• On the projection of \(k\)-valued non-linearly separable problems into \(m\)-valued linearly separable problems
• The computing capacity of three-input multiple-valued one-threshold perceptrons

This page was built for publication: Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1857516)