首页> 外文OA文献 >Speaker identification using hybrid of subtractive clustering and radial basis function
【2h】

Speaker identification using hybrid of subtractive clustering and radial basis function

机译:减法聚类与径向基函数混合的说话人识别

摘要

Speaker identification is the computing task of identifying unknown identities based on voice. A good speaker identification system must have a high accuracy rate to prevent incorrect detection of the user's identity. This research proposed a hybrid of Subtractive Clustering and Radial Basis Function (Sub-RBF) which is the combination of supervised and unsupervised learning. Unsupervised learning is more suitable for learning large and complex models than supervised learning. This is because supervised learning increasing the number of connections between sets in the network. If the model contains a large and complex dataset, supervised learning is difficult. In addition, K-means is faced with improper initial guessing of first cluster centre and difficulty in determining the number of cluster centres. The proposed technique is introduced because subtractive clustering is able to solve these problems. RBF is a simple network structures with fast learning algorithm. RBF neural network model with subtractive clustering proposed to select hidden node centers, can achieve faster training speed. In the meantime, the RBF network was trained with a regularization parameter so as to minimize the variances of the nodes in the hidden layer and perform more accurate prediction. The accuracy rate for subtractive clustering is 8.125% and 11.25% for training dataset 1 and training dataset 2 respectively. However, Sub-RBF provides 76.875% and 71.25% accuracy rate for training dataset 1 and training dataset 2 respectively. In conclusion, Sub-RBF has improved the speaker identification system accuracy rate.
机译:说话人识别是基于语音识别未知身份的计算任务。一个好的说话人识别系统必须具有很高的准确率,以防止错误地检测到用户的身份。这项研究提出了减法聚类和径向基函数(Sub-RBF)的混合体,它是有监督学习和无监督学习的结合。与监督学习相比,无监督学习更适合于学习大型和复杂的模型。这是因为监督学习增加了网络中设备之间的连接数量。如果模型包含庞大而复杂的数据集,那么监督学习将很困难。另外,K-means面临着对第一个聚类中心的不正确的初始猜测,并且难以确定聚类中心的数量。引入提出的技术是因为减法聚类能够解决这些问题。 RBF是具有快速学习算法的简单网络结构。提出了带有减法聚类的RBF神经网络模型来选择隐藏节点中心,可以达到更快的训练速度。同时,使用正则化参数训练RBF网络,以最小化隐藏层中节点的方差并执行更准确的预测。训练数据集1和训练数据集2的减法聚类准确率分别为8.125%和11.25%。但是,Sub-RBF分别为训练数据集1和训练数据集2提供了76.875%和71.25%的准确率。总之,Sub-RBF提高了说话人识别系统的准确率。

著录项

  • 作者

    Yap Teck Ann;

  • 作者单位
  • 年度 2013
  • 总页数
  • 原文格式 PDF
  • 正文语种 en
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号