Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets

Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets

The minimum vertex cover problem is a well-known optimization problem; it has been used in a wide variety of applications. This paper focuses on rough set-based approach for the minimum vertex cover problem of the dynamic and static hypergraphs. First, we demonstrate the relationship between the att...

Full description

Bibliographic Details
Main Authors: Qian Zhou, Xiaolin Qin, Xiaojun Xie
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Vertex cover
attribute reduction
rough sets
hypergraph
Online Access:https://ieeexplore.ieee.org/document/8454706/

Similar Items

Similar Items