eVQ-AM: An extended dynamic version of evolving vector quantization

E. Lughofer
{"title":"eVQ-AM: An extended dynamic version of evolving vector quantization","authors":"E. Lughofer","doi":"10.1109/EAIS.2013.6604103","DOIUrl":null,"url":null,"abstract":"In this paper, we are presenting a new dynamically evolving clustering approach which extends conventional evolving Vector Quantization (eVQ), successfully applied before as fast learning engine for evolving cluster models, classifiers and evolving fuzzy systems in various real-world applications. The first extension concerns the ability to extract ellipsoidal prototype-based clusters in arbitrary position, thus increasing its flexibility to model any orentiation/rotation of local data clouds. The second extension includes a single-pass merging strategy in order to resolve unnecessary overlaps or to dynamically compensate inappropriately chosen learning parameters (which may lead to over-clustering effects). The new approach, termed as eVQ-AM (eVQ for Arbitrary ellipsoids with Merging functionality), is compared with conventional eVQ, other incremental and batch learning clustering methods based on two-dimensional as well as high-dimensional streaming clustering showing an evolving behavior in terms of adding/joining clusters as well as feature range expansions. The comparison includes a sensitivity analysis on the learning parameters and observations of finally achieved cluster partition qualities.","PeriodicalId":289995,"journal":{"name":"2013 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Conference on Evolving and Adaptive Intelligent Systems (EAIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EAIS.2013.6604103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we are presenting a new dynamically evolving clustering approach which extends conventional evolving Vector Quantization (eVQ), successfully applied before as fast learning engine for evolving cluster models, classifiers and evolving fuzzy systems in various real-world applications. The first extension concerns the ability to extract ellipsoidal prototype-based clusters in arbitrary position, thus increasing its flexibility to model any orentiation/rotation of local data clouds. The second extension includes a single-pass merging strategy in order to resolve unnecessary overlaps or to dynamically compensate inappropriately chosen learning parameters (which may lead to over-clustering effects). The new approach, termed as eVQ-AM (eVQ for Arbitrary ellipsoids with Merging functionality), is compared with conventional eVQ, other incremental and batch learning clustering methods based on two-dimensional as well as high-dimensional streaming clustering showing an evolving behavior in terms of adding/joining clusters as well as feature range expansions. The comparison includes a sensitivity analysis on the learning parameters and observations of finally achieved cluster partition qualities.
eVQ-AM:演化向量量化的扩展动态版本
在本文中,我们提出了一种新的动态进化聚类方法,它扩展了传统的进化向量量化(eVQ), eVQ已经成功地作为快速学习引擎应用于各种实际应用中的进化聚类模型、分类器和进化模糊系统。第一个扩展涉及在任意位置提取基于椭球原型的簇的能力,从而增加其建模任何方向/旋转的本地数据云的灵活性。第二个扩展包括一个单遍合并策略,以解决不必要的重叠或动态补偿不适当选择的学习参数(这可能导致过度聚类效应)。该方法被称为eVQ- am(具有合并功能的任意椭球eVQ),与传统的eVQ、其他基于二维和高维流聚类的增量和批处理学习聚类方法进行了比较,显示出在添加/连接聚类以及特征范围扩展方面的进化行为。比较包括对学习参数的敏感性分析和对最终实现的聚类划分质量的观察。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信