4.7 Article

A factor graph model for unsupervised feature selection

期刊

INFORMATION SCIENCES
卷 480, 期 -, 页码 144-159

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2018.12.034

关键词

Feature selection; Factor graph; Message-passing algorithm; Unsupervised learning

资金

  1. NSFC [61573292, 61603313, 61773324]
  2. Fundamental Research Funds for the Central Universities [2682017CX097]
  3. Hi-Tech Information Technology Research Institute of Chengdu [2018H01207]

向作者/读者索取更多资源

In this paper, a factor graph model for unsupervised feature selection (FGUFS) is proposed. FGUFS explicitly measures the similarities between features; these similarities are passed to each other as messages in the graph model. The importance score of each feature is calculated using the message-passing algorithm, and then feature selection is performed based on the final importance scores. Extensive experiments were performed on several datasets, and the results demonstrate that FGUFS outperforms other state-of-art unsupervised feature selection algorithms on several performance measures. (C) 2018 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据