Discriminant Analysis by a Neural Network with Mahalanobis Distance

We propose a neural network which can approximate Mahalanobis discriminant functions after being trained. It can be realized if a Bayesian neural network is equipped with two additional subnetworks. The training is performed sequentially and, hence, the past teacher signals need not be memorized. In...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ito, Yoshifusa, Srinivasan, Cidambi, Izumi, Hiroyuki
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a neural network which can approximate Mahalanobis discriminant functions after being trained. It can be realized if a Bayesian neural network is equipped with two additional subnetworks. The training is performed sequentially and, hence, the past teacher signals need not be memorized. In this paper, we treat the two-category normal-distribution case. The results of simple simulations are included.
ISSN:0302-9743
1611-3349
DOI:10.1007/11840930_36