A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix

被引：2

作者：

Zhuang, Shengyang ^{[1
]}

Chen, Degang ^{[1
]}

机构：

[1] North China Elect Power Univ, Sch Math & Phys, Beijing 102206, Peoples R China

来源：

INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS | 2019年 / 10卷 / 12期

关键词：

Vertex cover; Attribute reduction; Discernibility matrix; Minimal element; ROUGH SET METHOD; ATTRIBUTE REDUCTION; APPROXIMATION ALGORITHMS; COMBINATION;

D O I：

10.1007/s13042-019-00933-6

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Minimal vertex cover problem (MVCP) is a famous important NP-hard problem in graph theory. It has been reported that MVCP is equivalent to finding reducts of information systems in rough sets theory. This relationship motivates our idea to deal with MVCP in terms of approaches to discernibility matrix in rough set. First we point out that only minimal elements in the discernibility matrix are useful for MVCP, and we present a novel algorithm based on minimal elements for MVCP. Then we make experimental comparisons to demonstrate the effectiveness of this new algorithm on big graphs.

引用

页码：3467 / 3474

页数：8

共 50 条

[1] A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Shengyang Zhuang
Degang Chen
[J]. International Journal of Machine Learning and Cybernetics, 2019, 10 : 3467 - 3474
[2] A surface-based DNA algorithm for the minimal vertex cover problem
PAN Linqiang
Department of Mathematics and Physics
[J]. Progress in Natural Science:Materials International, 2003, (01) : 80 - 82
[3] A surface-based DNA algorithm for the minimal vertex cover problem
Pan, LQ
Xu, J
Liu, YC
[J]. PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (01) : 78 - 80
[4] Discernibility matrix based algorithm for reduction of attributes
Wang, Ruizhi
Miao, Duoqian
Hu, Guirong
[J]. 2006 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY, WORKSHOPS PROCEEDINGS, 2006, : 477 - +
[5] An Exact Algorithm for Minimum Vertex Cover Problem
Wang, Luzhi
Hu, Shuli
Li, Mingyang
Zhou, Junping
[J]. MATHEMATICS, 2019, 7 (07)
[6] A localized distributed algorithm for vertex cover problem
Akram, Vahid Khalilpour
Ugurlu, Onur
[J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2022, 58
[7] An Approximation Algorithm for the Minimum Vertex Cover Problem
Chen, Jingrong
Kou, Lei
Cui, Xiaochuan
[J]. GREEN INTELLIGENT TRANSPORTATION SYSTEM AND SAFETY, 2016, 138 : 180 - 185
[8] A New Approximation Algorithm for Vertex Cover Problem
Dahiya, Sonika
[J]. 2013 INTERNATIONAL CONFERENCE ON MACHINE INTELLIGENCE AND RESEARCH ADVANCEMENT (ICMIRA 2013), 2013, : 472 - 478
[9] A feature selection algorithm based on discernibility matrix
Liu, Fuyan
Lu, Shaoyi
[J]. COMPUTATIONAL INTELLIGENCE AND SECURITY, 2007, 4456 : 259 - +
[10] A discernibility matrix based algorithm for feature selection
Liu, Fuyan
[J]. 2006 International Conference on Computational Intelligence and Security, Pts 1 and 2, Proceedings, 2006, : 155 - 158

← 1 2 3 4 5 →