Personalized PageRank Based Feature Selection for High-dimension Data

Zhibo Zhu, Qinke Peng, Xinyu Guan
{"title":"Personalized PageRank Based Feature Selection for High-dimension Data","authors":"Zhibo Zhu, Qinke Peng, Xinyu Guan","doi":"10.1109/KSE.2019.8919274","DOIUrl":null,"url":null,"abstract":"Feature selection is critical of data mining applications, especially for extracting valuable information from high-dimension data. It not only improves the performance of learning models, but also enhances the interpretability and generality of knowledge. In this paper, we propose a feature selection method based on the personalized PageRank. Derived from mutual information, a non-symmetrical metric is used to build a feature redundancy network firstly, in which nodes are features and directed edges represent the redundancy relation between features. Then, we compute the personalized PageRank on the network and assign a score for each feature as the redundancy measure given a specific feature subset. Finally, this redundancy integrates into the generalized MRMR framework to achieve the feature selection task. Due to the global characteristics of network and PageRank, our method can provide a better measure of the high-order relationship between the candidate feature and the subset of selected features. Extensive experiments conducted on five microarray datasets verify the effectiveness of the proposed method which outperforming popular benchmarks.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2019.8919274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Feature selection is critical of data mining applications, especially for extracting valuable information from high-dimension data. It not only improves the performance of learning models, but also enhances the interpretability and generality of knowledge. In this paper, we propose a feature selection method based on the personalized PageRank. Derived from mutual information, a non-symmetrical metric is used to build a feature redundancy network firstly, in which nodes are features and directed edges represent the redundancy relation between features. Then, we compute the personalized PageRank on the network and assign a score for each feature as the redundancy measure given a specific feature subset. Finally, this redundancy integrates into the generalized MRMR framework to achieve the feature selection task. Due to the global characteristics of network and PageRank, our method can provide a better measure of the high-order relationship between the candidate feature and the subset of selected features. Extensive experiments conducted on five microarray datasets verify the effectiveness of the proposed method which outperforming popular benchmarks.
基于个性化PageRank的高维数据特征选择
特征选择是数据挖掘应用的关键,特别是从高维数据中提取有价值的信息。它不仅提高了学习模型的性能,而且增强了知识的可解释性和通用性。本文提出了一种基于个性化PageRank的特征选择方法。从互信息出发,采用非对称度量首先构建特征冗余网络,其中节点为特征,有向边表示特征之间的冗余关系;然后,我们计算网络上的个性化PageRank,并为每个特征分配一个分数作为给定特定特征子集的冗余度量。最后,将该冗余集成到广义MRMR框架中,实现特征选择任务。由于网络和PageRank的全局特征,我们的方法可以更好地衡量候选特征和所选特征子集之间的高阶关系。在五个微阵列数据集上进行的大量实验验证了所提出方法的有效性,该方法优于流行的基准测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信