Rough set methods in feature selection via submodular function
From MaRDI portal
Publication:1701849
DOI10.1007/s00500-015-2024-7zbMath1381.68299OpenAlexW2267481646MaRDI QIDQ1701849
William Zhu, Xin-Nan Fan, Xiao-Zhong Zhu
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-2024-7
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (2)
Approximation Operators in Covering Based Rough Sets from Submodular Functions ⋮ Recent fuzzy generalisations of rough sets theory: a systematic review and methodological critique of the literature
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Attribute reduction of data with error ranges and test costs
- Neighborhood rough set based heterogeneous feature subset selection
- Fuzzy-rough attribute reduction via mutual information with an application to cancer classification
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Subspace learning for unsupervised feature selection via matrix factorization
- Principal component analysis.
- Communication delay analysis of fault-tolerant pipelined circuit switching in torus
- Singular value decomposition and least squares solutions
- Entropy and Information Theory
- Numerical Attribute Reduction Based on Neighborhood Granulation and Rough Approximation
- Optimal Value of Information in Graphical Models
- Rough sets
- An analysis of approximations for maximizing submodular set functions—I
- Decomposition Approach for Low-Rank Matrix Completion and Its Applications
- Transactions on Rough Sets I
- Learning the parts of objects by non-negative matrix factorization
- Learning with Submodular Functions: A Convex Optimization Perspective
This page was built for publication: Rough set methods in feature selection via submodular function
