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:

Nullity-based matroid of rough sets and its application to attribute reduction
Aiping Huang, Hong Zhao, William Zhu
Information Sciences (2013) Vol. 263, pp. 153-165
Closed Access | Times Cited: 28

Showing 1-25 of 28 citing articles:

Class-specific attribute reducts in rough set theory
Yiyu Yao, Xianyong Zhang
Information Sciences (2017) Vol. 418-419, pp. 601-618
Closed Access | Times Cited: 111
Class-specific information measures and attribute reducts for hierarchy and systematicness
Xianyong Zhang, Hong Yao, Zhiying Lv, et al.
Information Sciences (2021) Vol. 563, pp. 196-225
Open Access | Times Cited: 61
Decision region distribution preservation reduction in decision-theoretic rough set model
Ma Xiao, Guoyin Wang, Hong Yu, et al.
Information Sciences (2014) Vol. 278, pp. 614-640
Closed Access | Times Cited: 86
Micro and macro models of granular computing induced by the indiscernibility relation
Cinzia Bisi, Giampiero Chiaselotti, Davide Ciucci, et al.
Information Sciences (2017) Vol. 388-389, pp. 247-273
Open Access | Times Cited: 26
The granular partition lattice of an information table
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Information Sciences (2016) Vol. 373, pp. 57-78
Closed Access | Times Cited: 22
Knowledge pairing systems in granular computing
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Knowledge-Based Systems (2017) Vol. 124, pp. 144-163
Closed Access | Times Cited: 20
Rough Set Theory and Digraphs
Giampiero Chiaselotti, Davide Ciucci, Tommaso Gentile, et al.
Fundamenta Informaticae (2017) Vol. 153, Iss. 4, pp. 291-325
Closed Access | Times Cited: 19
Graph and matrix approaches to rough sets through matroids
Shiping Wang, Qingxin Zhu, William Zhu, et al.
Information Sciences (2014) Vol. 288, pp. 1-11
Closed Access | Times Cited: 18
A more efficient attribute self-adaptive co-evolutionary reduction algorithm by combining quantum elitist frogs and cloud model operators
Weiping Ding, Zhijin Guan, Quan Shi, et al.
Information Sciences (2014) Vol. 293, pp. 214-234
Closed Access | Times Cited: 15
The lattice and matroid representations of definable sets in generalized rough sets based on relations
Zhaohao Wang, Qinrong Feng, Hong Wang
Information Sciences (2019) Vol. 485, pp. 505-520
Closed Access | Times Cited: 14
Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
Cinzia Bisi, F. Infusino
Advances in Applied Mathematics (2024) Vol. 162, pp. 102778-102778
Open Access | Times Cited: 1
Simplicial complexes and closure systems induced by indistinguishability relations
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
Comptes Rendus Mathématique (2017) Vol. 355, Iss. 9, pp. 991-1021
Open Access | Times Cited: 14
Dependency structures for decision tables
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
International Journal of Approximate Reasoning (2017) Vol. 88, pp. 333-370
Open Access | Times Cited: 13
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Aiping Huang, William Zhu
Soft Computing (2015) Vol. 20, Iss. 5, pp. 1841-1851
Open Access | Times Cited: 9
A hierarchical-coevolutionary-MapReduce-based knowledge reduction algorithm with robust ensemble Pareto equilibrium
Weiping Ding, Jiehua Wang, Jiandong Wang
Information Sciences (2016) Vol. 342, pp. 153-175
Closed Access | Times Cited: 7
Rough action on topological rough groups
Alaa Altassan, Nof Alharbi, Hassen Aydi, et al.
Applied General Topology (2020) Vol. 21, Iss. 2, pp. 295-295
Open Access | Times Cited: 6
New perspectives of granular computing in relation geometry induced by pairings
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino
ANNALI DELL UNIVERSITA DI FERRARA (2019) Vol. 65, Iss. 1, pp. 57-94
Closed Access | Times Cited: 5
Matrix approach to spanning matroids of rough sets and its application to attribute reduction
Lirun Su, Fusheng Yu
Theoretical Computer Science (2021) Vol. 893, pp. 105-116
Closed Access | Times Cited: 5
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
Aiping Huang, William Zhu
Journal of Applied Mathematics (2014) Vol. 2014, pp. 1-8
Open Access | Times Cited: 3
A rough set approach to the characterization of transversal matroids
Guoye Xu, Zhaohao Wang
International Journal of Approximate Reasoning (2015) Vol. 70, pp. 1-12
Open Access | Times Cited: 3
Characteristic matrices of compound operations of coverings and their relationships with rough sets
Aiping Huang, William Zhu
International Journal of Machine Learning and Cybernetics (2017) Vol. 10, Iss. 1, pp. 75-85
Closed Access | Times Cited: 3
Attribute Reduction from Closure Operators and Matroids in Rough Set Theory
Mauricio Restrepo, Chris Cornelis
Lecture notes in computer science (2020), pp. 183-192
Open Access | Times Cited: 3
The structures and the connections on four types of covering rough sets
Zhaohao Wang, Hong Wang, Qinrong Feng
Soft Computing (2018) Vol. 23, Iss. 16, pp. 6727-6741
Closed Access | Times Cited: 2
Indiscernibility structures induced from function sets : Graph and digraph case
Giampiero Chiaselotti, Tommaso Gentile, F. Infusino, et al.
Journal of Discrete Mathematical Sciences and Cryptography (2018) Vol. 21, Iss. 5, pp. 1069-1096
Closed Access | Times Cited: 1
Geometric lattice structure of covering and its application to attribute reduction through matroids
Aiping Huang, William Zhu
arXiv (Cornell University) (2013)
Open Access
Page 1 - Next Page

Scroll to top