Unsupervised Feature Selection based on Constructing Virtual Cluster’s Representative

Mohsen Rahmanian, E. Mansoori, Mohammad Taheri
{"title":"Unsupervised Feature Selection based on Constructing Virtual Cluster’s Representative","authors":"Mohsen Rahmanian, E. Mansoori, Mohammad Taheri","doi":"10.1109/ICCKE50421.2020.9303633","DOIUrl":null,"url":null,"abstract":"The data readability, complexity reduction of learning algorithms and increase predictability are the most important reasons for using feature selection methods, especially when there exist lots of features. In recent years, unsupervised feature selection techniques are well explored. In this paper, we proposed an unsupervised feature selection algorithm using multivariate-symmetrical-uncertainty based feature clustering, Feature Selection-based Virtual Feature Representative (FSVFR). The main idea of FSVFR is as follows: First, it selects the cluster centers based on the similarity density of the neighbors of each feature; after assigning the features to the clusters, the virtual representative is generated in such a way that contains maximum common information with cluster’s members and minimum similarity with other representatives. These steps continues until there is no more change in the representatives. Second, a feature that has the most common information in each cluster is selected as its representative. The experimental results on benchmark datasets demonstrate the effectiveness of our approaches as compared to the two common methods.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE50421.2020.9303633","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The data readability, complexity reduction of learning algorithms and increase predictability are the most important reasons for using feature selection methods, especially when there exist lots of features. In recent years, unsupervised feature selection techniques are well explored. In this paper, we proposed an unsupervised feature selection algorithm using multivariate-symmetrical-uncertainty based feature clustering, Feature Selection-based Virtual Feature Representative (FSVFR). The main idea of FSVFR is as follows: First, it selects the cluster centers based on the similarity density of the neighbors of each feature; after assigning the features to the clusters, the virtual representative is generated in such a way that contains maximum common information with cluster’s members and minimum similarity with other representatives. These steps continues until there is no more change in the representatives. Second, a feature that has the most common information in each cluster is selected as its representative. The experimental results on benchmark datasets demonstrate the effectiveness of our approaches as compared to the two common methods.
基于构造虚拟聚类代表的无监督特征选择
数据的可读性、降低学习算法的复杂性和提高可预测性是使用特征选择方法的最重要的原因,特别是在存在大量特征的情况下。近年来,无监督特征选择技术得到了很好的探索。本文提出了一种基于多变量对称不确定性特征聚类的无监督特征选择算法——基于特征选择的虚拟特征代表(FSVFR)。FSVFR的主要思想是:首先,根据每个特征的邻居相似度密度选择聚类中心;在将特征分配给集群后,虚拟代表以这样一种方式生成,该方式包含与集群成员的最大共同信息和与其他代表的最小相似性。这些步骤将继续进行,直到代表不再发生变化为止。其次,在每个聚类中选择具有最常见信息的特征作为其代表。在基准数据集上的实验结果表明,与两种常用方法相比,我们的方法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信