Skip to main navigation Skip to search Skip to main content

Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons

  • Université du Québec à Trois-Rivières

Research output: Contribution to journal › Conference article › peer-review

Abstract

The (k, s)-perceptrons partition the input space {0, ..., k-1}n into s+1 regions using s parallel hyperplanes. Their learning abilities are examined in this paper. The previously studied homogeneous (k, k-1)-perceptron learning algorithm is generalized to the permutably homogeneous (k, s)-perceptron learning algorithm with guaranteed convergence property. We also introduce a powerful learning method that learns any permutably homogeneously separable k-valued logic function given as input.

Original languageEnglish
Pages (from-to)161-166
Number of pages6
JournalProceedings of The International Symposium on Multiple-Valued Logic
StatePublished - 1998
EventProceedings of the 1998 28th International Symposium on Multiple-Valued Logic - Fukuoka, Jpn
Duration: May 27 1998 → May 29 1998

ASJC Scopus Subject Areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Learning with permutably homogeneous multiple-valued multiple-threshold perceptrons'. Together they form a unique fingerprint.

Cite this