A new hierarchical-clustering combination scheme based on scatter matrices and nearest neighbor criterion

Morteza Jalalat-evakilkandi, Abdolreza Mirzaei
{"title":"A new hierarchical-clustering combination scheme based on scatter matrices and nearest neighbor criterion","authors":"Morteza Jalalat-evakilkandi, Abdolreza Mirzaei","doi":"10.1109/ISTEL.2010.5734151","DOIUrl":null,"url":null,"abstract":"In the field of pattern recognition, combination of different classifiers is a common method to improve classification accuracy. Recently, tendency to improve the function of clustering methods, specifically partitional clustering methods, is being increased. Generally, hierarchical clustering is preferred to partitional clustering when the number of exact clusters is undetermined or when we are interested in finding the relation between clusters. Most of the proposed methods for clustering combination are based on partitional clustering. In this paper, a new method for combination of hierarchical clustering is proposed. In this method, in the first step the primary dendrograms of base hierarchical clustering methods (such as Single Linkage and Complete Linkage) are converted to matrices. Then these matrices are synthesized together in a weighted procedure and led to a final description matrix. The weights are determined based on two criteria: clustering scatter matrices and nearest neighbour of each pattern. The results show improvement in function of combination method rather than base clustering methods.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"625 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 5th International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2010.5734151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In the field of pattern recognition, combination of different classifiers is a common method to improve classification accuracy. Recently, tendency to improve the function of clustering methods, specifically partitional clustering methods, is being increased. Generally, hierarchical clustering is preferred to partitional clustering when the number of exact clusters is undetermined or when we are interested in finding the relation between clusters. Most of the proposed methods for clustering combination are based on partitional clustering. In this paper, a new method for combination of hierarchical clustering is proposed. In this method, in the first step the primary dendrograms of base hierarchical clustering methods (such as Single Linkage and Complete Linkage) are converted to matrices. Then these matrices are synthesized together in a weighted procedure and led to a final description matrix. The weights are determined based on two criteria: clustering scatter matrices and nearest neighbour of each pattern. The results show improvement in function of combination method rather than base clustering methods.
一种基于散点矩阵和最近邻准则的分层聚类组合方案
在模式识别领域,不同分类器的组合是提高分类精度的常用方法。近年来,改进聚类方法,特别是分割聚类方法功能的趋势越来越明显。一般来说,当精确聚类的数量不确定或我们对寻找聚类之间的关系感兴趣时,分层聚类优于分区聚类。目前提出的聚类组合方法大多是基于分区聚类的。本文提出了一种新的分层聚类组合方法。在该方法中,首先将基本层次聚类方法(如Single Linkage和Complete Linkage)的主要树形图转换为矩阵。然后对这些矩阵进行加权综合,得到最终的描述矩阵。权重的确定基于两个标准:聚类散点矩阵和每个模式的最近邻。结果表明,组合方法的功能优于基聚类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信