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:

On axiomatic characterizations of three pairs of covering based approximation operators
Yan-Lan Zhang, Jinjin Li, Wei-Zhi Wu
Information Sciences (2009) Vol. 180, Iss. 2, pp. 274-287
Closed Access | Times Cited: 89

Showing 1-25 of 89 citing articles:

Covering based rough set approximations
Yiyu Yao, Yao Bing-xue
Information Sciences (2012) Vol. 200, pp. 91-107
Closed Access | Times Cited: 467

A fuzzy covering-based rough set model and its generalization over fuzzy lattice
Bin Yang, Bao Qing Hu
Information Sciences (2016) Vol. 367-368, pp. 463-486
Closed Access | Times Cited: 109

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
Degang Chen, Wanlu Li, Xiao Zhang, et al.
International Journal of Approximate Reasoning (2013) Vol. 55, Iss. 3, pp. 908-923
Open Access | Times Cited: 73

Fuzzy Measures and Choquet Integrals Based on Fuzzy Covering Rough Sets
Xiaohong Zhang, Jingqian Wang, Jianming Zhan, et al.
IEEE Transactions on Fuzzy Systems (2021) Vol. 30, Iss. 7, pp. 2360-2374
Closed Access | Times Cited: 50

Using one axiom to characterize rough set and fuzzy rough set approximations
Guilong Liu
Information Sciences (2012) Vol. 223, pp. 285-296
Closed Access | Times Cited: 68

Duality, conjugacy and adjointness of approximation operators in covering-based rough sets
Mauricio Restrepo, Chris Cornelis, Jonatan Gómez
International Journal of Approximate Reasoning (2013) Vol. 55, Iss. 1, pp. 469-485
Open Access | Times Cited: 65

Generalized intuitionistic fuzzy rough sets based on intuitionistic fuzzy coverings
Zhiming Zhang
Information Sciences (2012) Vol. 198, pp. 186-206
Closed Access | Times Cited: 62

Related family: A new method for attribute reduction of covering information systems
Tian Yang, Qingguo Li, Bilei Zhou
Information Sciences (2012) Vol. 228, pp. 175-191
Closed Access | Times Cited: 60

Axiomatic characterizations of (S, T)-fuzzy rough approximation operators
Wei-Zhi Wu, You-Hong Xu, Mingwen Shao, et al.
Information Sciences (2015) Vol. 334-335, pp. 17-43
Closed Access | Times Cited: 51

Relationships between covering-based rough sets and relation-based rough sets
Yan-Lan Zhang, Maokang Luo
Information Sciences (2012) Vol. 225, pp. 55-71
Closed Access | Times Cited: 53

Axiomatization and conditions for neighborhoods in a covering to form a partition
Ziqiu Yun, Xun Ge, Xiaole Bai
Information Sciences (2011) Vol. 181, Iss. 9, pp. 1735-1740
Closed Access | Times Cited: 51

Partial order relation for approximation operators in covering based rough sets
Mauricio Restrepo, Chris Cornelis, Jonatan Gómez
Information Sciences (2014) Vol. 284, pp. 44-59
Closed Access | Times Cited: 49

The axiomatic characterizations onL-fuzzy covering-based approximation operators
Lingqiang Li, Qiu Jin, Kai Hu, et al.
International Journal of General Systems (2017) Vol. 46, Iss. 4, pp. 332-353
Closed Access | Times Cited: 47

Characteristic matrixes-based knowledge reduction in dynamic covering decision information systems
Guangming Lang, Qingguo Li, Mingjie Cai, et al.
Knowledge-Based Systems (2015) Vol. 85, pp. 1-26
Closed Access | Times Cited: 41

On minimization of axiom sets characterizing covering-based approximation operators
Yan-Lan Zhang, Maokang Luo
Information Sciences (2011) Vol. 181, Iss. 14, pp. 3032-3042
Closed Access | Times Cited: 48

Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system
Lijuan Wang, Xibei Yang, Jingyu Yang, et al.
Information Sciences (2012) Vol. 207, pp. 66-78
Closed Access | Times Cited: 45

Characteristic matrix of covering and its application to Boolean matrix decomposition
Shiping Wang, William Zhu, Qingxin Zhu, et al.
Information Sciences (2013) Vol. 263, pp. 186-197
Closed Access | Times Cited: 44

Textures and covering based rough sets
Murat Diker, Ayşegül Altay Uğur
Information Sciences (2011) Vol. 184, Iss. 1, pp. 44-63
Closed Access | Times Cited: 39

Topological characterizations of covering for special covering-based upper approximation operators
Xun Ge, Xiaole Bai, Ziqiu Yun
Information Sciences (2012) Vol. 204, pp. 70-81
Closed Access | Times Cited: 37

The relationship among different covering approximations
Guilong Liu
Information Sciences (2013) Vol. 250, pp. 178-183
Closed Access | Times Cited: 36

Incremental approaches to knowledge reduction based on characteristic matrices
Guangming Lang, Qingguo Li, Mingjie Cai, et al.
International Journal of Machine Learning and Cybernetics (2014) Vol. 8, Iss. 1, pp. 203-222
Closed Access | Times Cited: 34

Using single axioms to characterize (S, T)-intuitionistic fuzzy rough approximation operators
Wei-Zhi Wu, Mingwen Shao, Xia Wang
International Journal of Machine Learning and Cybernetics (2017) Vol. 10, Iss. 1, pp. 27-42
Closed Access | Times Cited: 30

The axiomatic characterizations on L-generalized fuzzy neighborhood system-based approximation operators
Fangfang Zhao, Qiu Jin, Lingqiang Li
International Journal of General Systems (2017) Vol. 47, Iss. 2, pp. 155-173
Closed Access | Times Cited: 26

Axiomatization on generalized neighborhood system-based rough sets
Fangfang Zhao, Lingqiang Li
Soft Computing (2017) Vol. 22, Iss. 18, pp. 6099-6110
Closed Access | Times Cited: 26

The rough membership functions on four types of covering-based rough sets and their applications
Xun Ge, Pei Wang, Ziqiu Yun
Information Sciences (2017) Vol. 390, pp. 1-14
Closed Access | Times Cited: 22

Page 1 - Next Page

Scroll to top