您当前的位置:
首页 >
文章列表页 >
A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket
更新时间:2025-07-09
    • A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket

    • Vol. 52, Issue 10, Pages: 141-145(2018)
    • DOI:10.7652/xjtuxb201810019    

      CLC: TP181
    • Online First:10 October 2018

      Published:2018

    移动端阅览

  • A Feature Selection Algorithm for Maximum Relevance Minimum Redundancy Using Approximate Markov Blanket[J]. 2018, 52(10): 141-145. DOI: 10.7652/xjtuxb201810019.

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

5

下载量

8

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Feature Selection via Immune Memory Clone
Feature Selection of Biomedical Literature by Membrane Particle Swarm Optimizer and Information Entropy
Immune Clone Feature Selection Method Combining Different Point Statistics of Overlap Region with Correlation Analysis
Feature Selection Algorithm Based on Neighborhood Decision Distinguishing Rate
High-Dimensional Multimodal Feature Selection Based on Evolutionary Computation

Related Author

焦李成
朱虎明
高琳
豆增发
刘弹
王孙安
梁霖
栗茂林

Related Institution

Institute of Intelligent Information Processing, Xidian University
School of Computer Science, Xidian University
School of Mechanical Engineering, Xi'an Jiaotong University
School of Electrical Engineering, Xi'an Jiaotong University
School of Internet, Anhui University
0