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:

Efficient Attribute Reduction Based on Discernibility Matrix
Zhangyan Xu, Chengqi Zhang, Shichao Zhang, et al.
Lecture notes in computer science (2007), pp. 13-21
Closed Access | Times Cited: 21

Showing 21 citing articles:

A Novel Feature Selection Method With Neighborhood Rough Set and Improved Particle Swarm Optimization
Jindong Feng, Zengtai Gong
IEEE Access (2022) Vol. 10, pp. 33301-33312
Open Access | Times Cited: 10
An Evaluation Method of Relative Reducts Based on Roughness of Partitions
Yasuo Kudo, Tetsuya Murai
International Journal of Cognitive Informatics and Natural Intelligence (2010) Vol. 4, Iss. 2, pp. 50-62
Closed Access | Times Cited: 13
Heuristic Algorithm for Attribute Reduction Based on Classification Ability by Condition Attributes
Yasuo Kudo, Tetsuya Murai
Journal of Advanced Computational Intelligence and Intelligent Informatics (2011) Vol. 15, Iss. 1, pp. 102-109
Open Access | Times Cited: 10
An Attribute Reduction Algorithm by Switching Exhaustive and Heuristic Computation of Relative Reducts
Yasuo Kudo, Tetsuya Murai
(2010), pp. 265-270
Closed Access | Times Cited: 9
Notice of Retraction: An efficient attribute reduction algorithm
Shuhua Teng, Jian Wu, Jixiang Sun, et al.
(2010), pp. 471-475
Closed Access | Times Cited: 6
A Heuristic Algorithm for Attribute Reduction Based on Discernibility and Equivalence by Attributes
Yasuo Kudo, Tetsuya Murai
Lecture notes in computer science (2009), pp. 351-359
Closed Access | Times Cited: 5
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
Some properties of interrelated attributes in relative reducts for interrelationship mining
Yasuo Kudo, Tetsuya Murai
(2014), pp. 998-1001
Closed Access | Times Cited: 3
An incremental attribute reduction algorithm in decision table
Jin Qian, Feiyue Ye, Ping Lv
2010 Seventh International Conference on Fuzzy Systems and Knowledge Discovery (2010)
Closed Access | Times Cited: 3
A Heuristic Algorithm for Selective Calculation of a Better Relative Reduct in Rough Set Theory
Yasuo Kudo, Tetsuya Murai
Studies in computational intelligence (2009), pp. 555-564
Closed Access | Times Cited: 3
An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix
Zhangyan Xu, Bingru Yang, Wenbin Qian, et al.
Fuzzy Information and Engineering (2010) Vol. 2, Iss. 4, pp. 433-443
Open Access | Times Cited: 1
Using Canonical Correlation Analysis for Parallelized Attribute Reduction
Ping Li, Mengting Xu, Jianyang Wu, et al.
Lecture notes in computer science (2016), pp. 433-445
Closed Access
Feeling of hand deformation as a monkey's hand: an experiment on a visual body with discomfort and its algebraic analysis
Yang Ruijia, Hirokazu Sakura, Yukio-Pegio Gunji
Frontiers in Neuroscience (2023) Vol. 17
Open Access
An efficient Pawlak reduction algorithm based on bitmap and granular computing
Zhangyan Xu, Wenbin Qian, Liyu Huang
(2009), pp. 186-190
Closed Access
A novel attribute reduction algorithm using condensing tree
Naiping Song, Yaping Xu, Jin Qian
(2012), pp. 424-428
Closed Access
Applying Indiscernibility Attribute to Attribute Reduction Based on Discernibility Matrix
Jin Qian, Ping Lv
(2009), pp. 397-400
Closed Access
Attribute Reduction as Calculation of Focus in Granular Reasoning
Yasuo Kudo, Tetsuya Murai
(2009), pp. 274-279
Closed Access
An Evaluation Method of Relative Reducts Based on Roughness of Partitions
Yasuo Kudo, Tetsuya Murai
IGI Global eBooks (2012), pp. 305-314
Closed Access
A Review of Research Trends and Future Issues of Rough Set Theory
Yasuo Kudo
Journal of Japan Society for Fuzzy Theory and Intelligent Informatics (2018) Vol. 30, Iss. 4, pp. 209-211
Open Access
An Evaluation Method of Relative Reducts Based on Roughness of Partitions
Seiki Akama, Yasuo Kudo, Tetsuya Murai
Intelligent systems reference library (2019), pp. 129-140
Closed Access
Heuristic Algorithm for Attribute Reduction Based on Classification Ability by Condition Attributes
Seiki Akama, Yasuo Kudo, Tetsuya Murai
Intelligent systems reference library (2019), pp. 113-127
Closed Access
Page 1

Scroll to top