Year-end Sale % OFF 
Abstract
Determining an appropriate number of clusters is a difficult yet important problem that the rival penalized competitive learning (RPCL) algorithm was designed to solve, but its performance is not satifactory with overlapping clusters or cases where input vectors contain dependent components. We address this problem by incorporating full covariance matrices into the original RPCL algorithm. The resulting extended RPCL algorithm progressively eliminates units whose clusters contain only a small amount of training data. The algorithm is used to determine the number of clusters in a Gaussian distribution. It is also used to optimize the architecture of elliptical basis function networks for speaker verification and vowel classification. We found that covariance matrices obtained by the extended RPCL algorithm have a better representation of clusters than those obtained by the original RPCL algorithm, resulting in a lower verification error rate in speaker verification and a higher recognition accuracy in vowel classification.
Published Version
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 callMore From: Journal of Advanced Computational Intelligence and Intelligent Informatics
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.
