Abstract

Probabilistic decision-based neural networks (PDBNNs) were originally proposed by Lin, Kung and Lin (1997) for human face recognition. Although high recognition accuracy has been achieved, not many illustrations were given to highlight the characteristics of the decision boundaries. This paper aims at providing detailed illustrations to compare the decision boundaries of PDBNNs with that of Gaussian mixture models through a pattern recognition task, namely the classification of two-dimensional vowel data. The original PDBNNs use elliptical basis functions with diagonal covariance matrices, which may be inefficient for modeling feature vectors with correlated components. This paper attempts to tackle this problem by using full covariance matrices. The paper also highlights the strengths of PDBNNs by demonstrating that the PDBNN's thresholding mechanism is very effective in rejecting data not belonging to any known classes.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.