A factor graph model for unsupervised feature selection
type: Item
instance of: scholarly article
title: A factor graph model for unsupervised feature selection
zbMATH Open document ID: 1443.68160
author: Hongjun Wang
author: Ji Zhang
author: Tianrui Li
author: Lingxi Peng
author: Ying-Hui Zhang
published in: Information Sciences
publication date: 2020-10-07T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7256996
zbMATH Keywords: feature selection
zbMATH Keywords: factor graph
zbMATH Keywords: message-passing algorithm
zbMATH Keywords: unsupervised learning
describes a project that uses: apcluster
describes a project that uses: ReliefF
describes a project that uses: darch
describes a project that uses: APCluster
MaRDI profile type: Publication
full work available at URL: j.ins.2018.12.034
OpenAlex ID: W2905779127
cites work: Q5405109
cites work: A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
cites work: Q3093206
cites work: Clustering by Passing Messages Between Data Points
cites work: Reducing the Dimensionality of Data with Neural Networks
cites work: A topological insight into restricted Boltzmann machines
cites work: Detecting Novel Associations in Large Data Sets
cites work: Theoretical and empirical analysis of ReliefF and RReliefF
cites work: Q5405165
cites work: 10.1162/153244303322753751
cites work: Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
cites work: Q3093222
DOI: 10.1016/J.INS.2018.12.034
description: scientific article; zbMATH DE number 7256996