MIC_FS:一种基于聚类的互信息特征选择新模型

Ming Yang, Ping Yang
{"title":"MIC_FS:一种基于聚类的互信息特征选择新模型","authors":"Ming Yang, Ping Yang","doi":"10.1109/COGINF.2009.5250706","DOIUrl":null,"url":null,"abstract":"Feature selection is an important problem for pattern classification systems. There are many methods for feature selection available, in which the feature selection method based on mutual information proposed by authors of Ref.[13] is one of the more effective approaches. However, it is often difficult to compute the mutual information for the continuous data whether using discretization strategy or directly employing density estimation method(e.g., Parzen windows). So, in this paper, we propose a novel model for feature selection by mutual information guided by clustering(MIC_FS). According to MIC_FS, a novel algorithm for feature selection(AMICFS) is introduced. In newly developed algorithm AMICFS, the mutual information between two features can be directly induced by the unsupervised fuzzy c-means clustering, and meanwhile the significance of features and the relevancy between features are simultaneously considered, hence a more effectively ranked feature list can be efficiently obtained in most cases. The experiments on 6 real-life benchmark datasets show that AMICFS is better or comparable as compared to Fisher Score.","PeriodicalId":420853,"journal":{"name":"2009 8th IEEE International Conference on Cognitive Informatics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"MIC_FS : A novel model for feature selection by mutual information guided by clustering\",\"authors\":\"Ming Yang, Ping Yang\",\"doi\":\"10.1109/COGINF.2009.5250706\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Feature selection is an important problem for pattern classification systems. There are many methods for feature selection available, in which the feature selection method based on mutual information proposed by authors of Ref.[13] is one of the more effective approaches. However, it is often difficult to compute the mutual information for the continuous data whether using discretization strategy or directly employing density estimation method(e.g., Parzen windows). So, in this paper, we propose a novel model for feature selection by mutual information guided by clustering(MIC_FS). According to MIC_FS, a novel algorithm for feature selection(AMICFS) is introduced. In newly developed algorithm AMICFS, the mutual information between two features can be directly induced by the unsupervised fuzzy c-means clustering, and meanwhile the significance of features and the relevancy between features are simultaneously considered, hence a more effectively ranked feature list can be efficiently obtained in most cases. The experiments on 6 real-life benchmark datasets show that AMICFS is better or comparable as compared to Fisher Score.\",\"PeriodicalId\":420853,\"journal\":{\"name\":\"2009 8th IEEE International Conference on Cognitive Informatics\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 8th IEEE International Conference on Cognitive Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COGINF.2009.5250706\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 8th IEEE International Conference on Cognitive Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COGINF.2009.5250706","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

特征选择是模式分类系统中的一个重要问题。特征选择的方法有很多,其中文献[13]作者提出的基于互信息的特征选择方法是比较有效的方法之一。然而,无论是采用离散化策略还是直接采用密度估计方法(如密度估计法),通常难以计算连续数据的互信息。帕森窗户)。为此,本文提出了一种新的聚类引导下的互信息特征选择模型(MIC_FS)。根据MIC_FS,提出了一种新的特征选择算法(AMICFS)。在新开发的AMICFS算法中,通过无监督模糊c均值聚类可以直接诱导两个特征之间的互信息,同时考虑特征的重要性和特征之间的相关性,因此在大多数情况下可以有效地获得更有效的排序特征列表。在6个真实基准数据集上的实验表明,AMICFS与Fisher Score相比具有更好的可比性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
MIC_FS : A novel model for feature selection by mutual information guided by clustering
Feature selection is an important problem for pattern classification systems. There are many methods for feature selection available, in which the feature selection method based on mutual information proposed by authors of Ref.[13] is one of the more effective approaches. However, it is often difficult to compute the mutual information for the continuous data whether using discretization strategy or directly employing density estimation method(e.g., Parzen windows). So, in this paper, we propose a novel model for feature selection by mutual information guided by clustering(MIC_FS). According to MIC_FS, a novel algorithm for feature selection(AMICFS) is introduced. In newly developed algorithm AMICFS, the mutual information between two features can be directly induced by the unsupervised fuzzy c-means clustering, and meanwhile the significance of features and the relevancy between features are simultaneously considered, hence a more effectively ranked feature list can be efficiently obtained in most cases. The experiments on 6 real-life benchmark datasets show that AMICFS is better or comparable as compared to Fisher Score.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信