Infinite Feature Selection: A Graph-based Feature Filtering Approach

IEEE Transactions on Pattern Analysis and Machine Intelligence(2021)

引用 129|浏览239
暂无评分
摘要
We propose a filtering feature selection framework that considers subsets of features as paths in a graph, where a node is a feature and an edge indicates pairwise (customizable) relations among features, dealing with relevance and redundancy principles. By two different interpretations (exploiting properties of power series of matrices and relying on Markov chains fundamentals) we can evaluate th...
更多
查看译文
关键词
Feature extraction,Mutual information,Redundancy,Markov processes,Computational complexity,Correlation,Laplace equations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要