The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Rough Set Algorithms in Classification Problem
Abstract
We we present some algorithms, based on rough set theory, that can be used for the problem of new cases classification. Most of the algorithms were implemented and included in Rosetta system [43]. We present several methods for computation of decision rules based on reducts. We discuss the problem of real value attribute discretization for increasing the performance of algorithms and quality of decision rules. Finally we deal with a problem of resolving conflicts between decision rules classifying a new case to different categories (classes). Keywords: knowledge discovery, rough sets, classification algorithms, reducts, decision rules, real value attribute discretization
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
Pawlak, Z. (1991) · Springer eBooks · doi:10.1007/978-94-011-3534-4 · Cited by 3,040
A Practical Approach to Feature Selection
Kira, K., & Rendell, L. A. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50037-1 · Cited by 2,978
Advances in Neural Information Processing Systems 37
(2024) · doi:10.52202/079017 · Cited by 2,791
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
The Cascade-Correlation learning architecture
Fahlman, S. E., & Lebiere, C. J. (2018) · doi:10.1184/r1/6610403 · Cited by 2,372
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Cited by
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.003 · Cited by 2,070
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.006 · Cited by 1,187
Feature selection based on rough sets and particle swarm optimization
Wang, X., Yang, J., Teng, X., Xia, W., & Jensen, R. (2007) · Pattern Recognition Letters · doi:10.1016/j.patrec.2006.09.003 · Cited by 837
Amin, A., Anwar, S., Adnan, A., Nawaz, M., Howard, N., Qadir, J., Hawalah, A., & Hussain, A. (2016) · IEEE Access · doi:10.1109/access.2016.2619719 · Cited by 310
“It is applied to minimize the computational cost in complex and large IS [64], [67].”
MethodPeng, L., Niu, R., Huang, B., Wu, X., Zhao, Y., & Ye, R. (2014) · Geomorphology · doi:10.1016/j.geomorph.2013.08.013 · Cited by 276
Metadata
- Authors
- Bazan, J. G., Nguyen, H. S., Nguyen, S. H., Synak, P., & Wróblewski, J.
- Venue
- Studies in Fuzziness and Soft Computing
- Publisher
- Physica-Verlag HD
- Published
- 2000
- Pages
- 49-88
- ISSN
- 1434-9922 (ISSN-L)
- 1860-0808
- OpenAlex
- W107910782
- Cited by
- 423
- References
- 39
- FWCI
- 14.69
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rough Set Algorithms in Classification Problem. https://app.cochat.ai/papers/10.1007/978-3-7908-1840-6_3
- The paper
- Bazan, J. G., Nguyen, H. S., Nguyen, S. H., Synak, P., & Wróblewski, J. (2000). Rough Set Algorithms in Classification Problem. Studies in Fuzziness and Soft Computing. https://doi.org/10.1007/978-3-7908-1840-6_3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.