Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Test-cost-sensitive rough set based approach for minimum weight vertex cover problem
Xiaojun Xie, Xiaolin Qin, Chunqiang Yu, et al.
Applied Soft Computing (2017) Vol. 64, pp. 423-435
Closed Access | Times Cited: 24

Showing 24 citing articles:

A novel approach to attribute reduction based on weighted neighborhood rough sets
Meng Hu, Eric C.C. Tsang, Yanting Guo, et al.
Knowledge-Based Systems (2021) Vol. 220, pp. 106908-106908
Closed Access | Times Cited: 99
NuMWVC: A novel local search for minimum weighted vertex cover problem
Ruizhi Li, Shuli Hu, Shaowei Cai, et al.
Journal of the Operational Research Society (2019) Vol. 71, Iss. 9, pp. 1498-1509
Closed Access | Times Cited: 30
A four-stage branch local search algorithm for minimal test cost attribute reduction based on the set covering
Haoran Su, Jinkun Chen, Yaojin Lin
Applied Soft Computing (2024) Vol. 153, pp. 111303-111303
Closed Access | Times Cited: 3
A novel test-cost-sensitive attribute reduction approach using the binary bat algorithm
Xiaojun Xie, Xiaolin Qin, Qian Zhou, et al.
Knowledge-Based Systems (2019) Vol. 186, pp. 104938-104938
Closed Access | Times Cited: 27
A parallel approach to calculate lower and upper approximations in dominance based rough set theory
Muhammad Summair Raza, Usman Qamar
Applied Soft Computing (2019) Vol. 84, pp. 105699-105699
Closed Access | Times Cited: 23
Optimal scale selection based on multi-scale single-valued neutrosophic decision-theoretic rough set with cost-sensitivity
Wenjue Wang, Bing Huang, Tianxing Wang
International Journal of Approximate Reasoning (2023) Vol. 155, pp. 132-144
Closed Access | Times Cited: 6
A new robust approach to solve minimum vertex cover problem: Malatya vertex-cover algorithm
Selman Yakut, Furkan Öztemіz, Ali Karcı
The Journal of Supercomputing (2023) Vol. 79, Iss. 17, pp. 19746-19769
Closed Access | Times Cited: 6
A novel measure of attribute significance with complexity weight
Jinfu Liu, Mingliang Bai, Na Jiang, et al.
Applied Soft Computing (2019) Vol. 82, pp. 105543-105543
Closed Access | Times Cited: 14
Improved general attribute reduction algorithms
Baizhen Li, Zhihua Wei, Duoqian Miao, et al.
Information Sciences (2020) Vol. 536, pp. 298-316
Closed Access | Times Cited: 9
K-size partial reduct: Positive region optimization for attribute reduction
Xiaojun Xie, Xingjian Gu, Yanbin Li, et al.
Knowledge-Based Systems (2021) Vol. 228, pp. 107253-107253
Closed Access | Times Cited: 9
Neighborhood multigranulation rough sets for cost-sensitive feature selection on hybrid data
Wenhao Shu, Qiang Xia, Wenbin Qian
Neurocomputing (2023) Vol. 565, pp. 126990-126990
Closed Access | Times Cited: 3
Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets
Qian Zhou, Xiaolin Qin, Xiaojun Xie
IEEE Access (2018) Vol. 6, pp. 50142-50153
Open Access | Times Cited: 5
A Game Theoretic Solver for the Minimum Weighted Vertex Cover
Changhao Sun, Xiaochu Wang, Huaxin Qiu, et al.
2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) (2019), pp. 1920-1925
Closed Access | Times Cited: 5
A novel rough set-based approach for minimum vertex cover of hypergraphs
Qian Zhou, Xiaojun Xie, Hua Dai, et al.
Neural Computing and Applications (2022) Vol. 34, Iss. 24, pp. 21793-21808
Closed Access | Times Cited: 3
ABARC: An agent-based rough sets clustering algorithm
Radu Găceanu, Arnold Szederjesi-Dragomir, Horia F. Pop, et al.
Intelligent Systems with Applications (2022) Vol. 16, pp. 200117-200117
Open Access | Times Cited: 3
Effectiveness of the MineReduce approach in reducing the size of combinatorial optimization problem instances
Marcelo Rodrigues de Holanda Maia, Alexandre Plastino, Uéverton S. Souza
RAIRO - Operations Research (2024) Vol. 58, Iss. 2, pp. 1131-1146
Open Access
A Comprehensive Evaluation of Rough Sets Clustering in Uncertainty Driven Contexts
Arnold Szederjesi-Dragomir
Studia Universitatis Babeș-Bolyai Informatica (2024) Vol. 69, Iss. 1, pp. 41-56
Open Access
Güvenlik Kameralarının Malatya Minimum Vertex Cover Algoritması ile Konumalndırılması
Cemalettin Sonakalan, Furkan ÖZTEMİZ
Bilgisayar Bilimleri ve Teknolojileri Dergisi (2024)
Open Access
A novel algorithm for the vertex cover problem based on minimal elements of discernibility matrix
Shengyang Zhuang, Degang Chen
International Journal of Machine Learning and Cybernetics (2019) Vol. 10, Iss. 12, pp. 3467-3474
Closed Access | Times Cited: 3
An evolutionary game algorithm for minimum weighted vertex cover problem
Yalun Li, Zhengyi Chai, Hongling Ma, et al.
Soft Computing (2023) Vol. 27, Iss. 21, pp. 16087-16100
Closed Access | Times Cited: 1
Local Search for Attribute Reduction
Xiaojun Xie, Ryszard Janicki, Xiaolin Qin, et al.
Lecture notes in computer science (2019), pp. 102-117
Closed Access | Times Cited: 2
Attribute Reduction for Partially Labeled Data Based on Hypergraph Models
Xiaojun Xie, Xiaolin Qin, Guangmei Huang, et al.
(2019), pp. 1434-1439
Closed Access | Times Cited: 1
Research on energy consumption prediction based on fast attribute reduction of weighted neighborhood rough set with moving horizon
Jun Tan, Qun Hou, Xin Liu, et al.
(2023), pp. 18-25
Closed Access
Quick Maximum Distribution Reduction in Inconsistent Decision Tables
Baizhen Li, Wei Chen, Zhihua Wei, et al.
Lecture notes in computer science (2020), pp. 169-182
Open Access
Page 1

Scroll to top