首页> 外文会议>Mexican international conference on artificial intelligence >Yager-Rybalov Triple Π Operator as a Means of Reducing the Number of Generated Clusters in Unsupervised Anuran Vocalization Recognition
【24h】

Yager-Rybalov Triple Π Operator as a Means of Reducing the Number of Generated Clusters in Unsupervised Anuran Vocalization Recognition

机译:Yager-Rybalov Triple Operator算子作为减少无监督Anuran语音识别中生成簇数的一种方法

获取原文

摘要

The Learning Algorithm for Multivariate Data Analysis (LAMDA) is an unsupervised fuzzy-based classification methodology. The operating principle of LAMDA is based on finding the datum-cluster relationship obtained by means of the Global Adequacy Degrees (GADs) of the Marginal Adequacy Degrees (MADs) of all the data attributes. In comparison with other unsupervised clustering algorithms, LAMDA does not require the number of classes as input parameter; however, in some applications, the quantity of obtained clusters does not correspond with the number of desired classes. Typically, this issue is overcome by merging interrelated clusters within the same class; nevertheless, in some applications the number of generated clusters related to the same class reaches a non-desired and impractical number. In LAMDA, the number of generated clusters is controlled by using a linear mixed connective with an exigency index a. This connective is an unnatural aggregation operator of the MADs, which adds an additional parameter to set up. In this paper, a full reinforcement operator (Yager-Rybalov Triple Ⅱ) is used as aggregation operator for merging the information contained in the MADs. This approach significantly reduces the number of generated classes and suppresses the LAMDA dependence of the parameter a. The proposed approach was tested in a case study related to unsupervised anuran vocalization recognition. A database of advertisement calls of six anuran (frog) species for testing this proposal was selected. All 102 vocalizations were correctly identified (100% of accuracy) and solely the desired classes were generated by the algorithm (establishing a cluster-class bijection).
机译:多元数据分析学习算法(LAMDA)是一种无监督的基于模糊的分类方法。 LAMDA的工作原理是基于查找通过所有数据属性的边际充足度(MAD)的全局充足度(GAD)获得的数据-群集关系。与其他无监督聚类算法相比,LAMDA不需要将类数作为输入参数;但是,在某些应用中,获得的簇的数量与所需类别的数量不对应。通常,可以通过合并同一类中的相互关联的群集来解决此问题。但是,在某些应用程序中,与同一类相关的生成簇的数量达到了不希望的,不切实际的数量。在LAMDA中,通过使用紧急指数为a的线性混合连接词来控制生成簇的数量。此连接词是MAD的不自然的聚合运算符,它会添加一个附加参数来进行设置。在本文中,使用全增强算子(Yager-Rybalov TripleⅡ)作为聚合算子来合并MAD中包含的信息。这种方法显着减少了生成类的数量,并抑制了参数a的LAMDA依赖性。在与无监督的阿努兰语发声识别相关的案例研究中,对所提出的方法进行了测试。选择了一个用于测试该提议的六个无脊椎动物(青蛙)物种的广告招募数据库。正确识别了所有102种发声方式(准确度为100%),并且仅通过算法生成了所需的类别(建立了群集类别的双射)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号