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:

Transactions on Rough Sets VIII

Transactions on rough sets (2008)
Open Access | Times Cited: 43

Showing 1-25 of 43 citing articles:

Rough Sets and Near Sets in Medical Imaging: A Review
Aboul Ella Hassanien, Ajith Abraham, James F. Peters, et al.
IEEE Transactions on Information Technology in Biomedicine (2009) Vol. 13, Iss. 6, pp. 955-968
Open Access | Times Cited: 159
OR in spare parts management: A review
Qiwei Hu, John E. Boylan, Huijing Chen, et al.
European Journal of Operational Research (2017) Vol. 266, Iss. 2, pp. 395-414
Open Access | Times Cited: 149
Matrix-based dynamic updating rough fuzzy approximations for data mining
Yanyong Huang, Tianrui Li, Chuan Luo, et al.
Knowledge-Based Systems (2016) Vol. 119, pp. 273-283
Open Access | Times Cited: 86
Belief functions and rough sets: Survey and new insights
Andrea Campagner, Davide Ciucci, Thierry Denœux
International Journal of Approximate Reasoning (2022) Vol. 143, pp. 192-215
Open Access | Times Cited: 49
Dominance-based rough set approach to incomplete interval-valued information system
Xibei Yang, Dong‐Jun Yu, Jingyu Yang, et al.
Data & Knowledge Engineering (2009) Vol. 68, Iss. 11, pp. 1331-1347
Closed Access | Times Cited: 122
Integrating ABC analysis and rough set theory to control the inventories of distributor in the supply chain of auto spare parts
Masoud Mehdizadeh
Computers & Industrial Engineering (2019) Vol. 139, pp. 105673-105673
Closed Access | Times Cited: 43
Lévy–Cauchy arithmetic optimization algorithm combined with rough K-means for image segmentation
Arunita Das, Amrita Namtirtha, Animesh Dutta
Applied Soft Computing (2023) Vol. 140, pp. 110268-110268
Closed Access | Times Cited: 11
An extension to Rough c -means clustering based on decision-theoretic Rough Sets model
Fan Li, Mao Ye, Xudong Chen
International Journal of Approximate Reasoning (2013) Vol. 55, Iss. 1, pp. 116-129
Open Access | Times Cited: 44
Orthopartitions and soft clustering: Soft mutual information measures for clustering validation
Andrea Campagner, Davide Ciucci
Knowledge-Based Systems (2019) Vol. 180, pp. 51-61
Closed Access | Times Cited: 33
A Selective Survey Review of Computational Intelligence Applications in the Primary Subdomains of Civil Engineering Specializations
Konstantinos Demertzis, Stavros Demertzis, Lazaros Iliadis
Applied Sciences (2023) Vol. 13, Iss. 6, pp. 3380-3380
Open Access | Times Cited: 9
Lattices with Interior and Closure Operators and Abstract Approximation Spaces
Gianpiero Cattaneo, Davide Ciucci
Lecture notes in computer science (2009), pp. 67-116
Closed Access | Times Cited: 40
Generalized approximations defined by non-equivalence relations
Lihe Guan, Guoyin Wang
Information Sciences (2012) Vol. 193, pp. 163-179
Closed Access | Times Cited: 38
Categorical Data Clustering: A Bibliometric Analysis and Taxonomy
Maya Cendana, R.J. Kuo
Machine Learning and Knowledge Extraction (2024) Vol. 6, Iss. 2, pp. 1009-1054
Open Access | Times Cited: 2
Rough computing — A review of abstraction, hybridization and extent of applications
D. P. Acharjya, Ajith Abraham
Engineering Applications of Artificial Intelligence (2020) Vol. 96, pp. 103924-103924
Closed Access | Times Cited: 20
Generalized Rough Sets and Implication Lattices
Pulak Samanta, Mihir K. Chakraborty
Lecture notes in computer science (2011), pp. 183-201
Closed Access | Times Cited: 24
Analysis of alternative objective functions for attribute reduction in complete decision tables
Jie Zhou, Duoqian Miao, Witold Pedrycz, et al.
Soft Computing (2011) Vol. 15, Iss. 8, pp. 1601-1616
Closed Access | Times Cited: 20
Rough Sets: From Rudiments to Challenges
Hung Son Nguyen, Andrzej Skowron
Intelligent systems reference library (2012), pp. 75-173
Closed Access | Times Cited: 18
Consequence relations and data science: From Galois mappings to data interpretation
Marcin Wolski, Anna Gomolińska
International Journal of Approximate Reasoning (2024) Vol. 170, pp. 109203-109203
Closed Access | Times Cited: 1
Rough sets, modal logic and approximate reasoning
Mihir Kr. Chakraborty, Sandip Majumder, Samarjit Kar
International Journal of Approximate Reasoning (2024) Vol. 176, pp. 109305-109305
Closed Access | Times Cited: 1
An update logic for information systems
Md. Aquil Khan, Mohua Banerjee, Roland Rieke
International Journal of Approximate Reasoning (2013) Vol. 55, Iss. 1, pp. 436-456
Open Access | Times Cited: 15
A modified rough c-means clustering algorithm based on hybrid imbalanced measure of distance and density
Tengfei Zhang, Long Chen, Fumin Ma
International Journal of Approximate Reasoning (2014) Vol. 55, Iss. 8, pp. 1805-1818
Open Access | Times Cited: 14
Classifying Attributes with Game-Theoretic Rough Sets
Nouman Azam, JingTao Yao
Smart innovation, systems and technologies (2012), pp. 175-184
Closed Access | Times Cited: 9
Towards an Algebraic Approach for Cover Based Rough Semantics and Combinations of Approximation Spaces
A. Mani
Lecture notes in computer science (2009), pp. 77-84
Closed Access | Times Cited: 9
Extended Pawlak’s Flow Graphs and Information Theory
Huawen Liu, Jigui Sun, Huijie Zhang, et al.
Lecture notes in computer science (2009), pp. 220-236
Closed Access | Times Cited: 9
Indiscernibility and Similarity in an Incomplete Information Table
Renpu Li, Yiyu Yao
Lecture notes in computer science (2010), pp. 110-117
Closed Access | Times Cited: 7
Page 1 - Next Page

Scroll to top