The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Uncertainty measures of rough set prediction
Open accessAbstract
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. In keeping within the rough set philosophy of non-invasive data analysis, we present three model selection criteria, using information theoretic entropy in the spirit of the minimum description length principle. Our main procedure is based on the principle of indifference combined with the maximum entropy principle, thus keeping external model assumptions to a minimum. The applicability of the proposed method is demonstrated by a comparison of its error rates with results of C4.5, using 14 published data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Pawlak, Z. (1982) · International Journal of Computer & Information Sciences · doi:10.1007/bf01001956 · Cited by 12,322
Rough Sets: Theoretical Aspects of Reasoning about Data
Pawlak, Z. (1991) · Our Digital Library (Warsaw University of Technology) · Cited by 8,343
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,473
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Proceedings of the 25th international conference on Machine learning
Cohen, W. W., McCallum, A., & Roweis, S. T. (2008) · Cited by 5,691
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitányi, P. (2019) · Texts in Computer Science · doi:10.1007/978-3-030-11298-1 · Cited by 3,681
Pawlak, Z., Grzymala-Busse, J., Slowinski, R., & Ziarko, W. (1995) · Communications of the ACM · doi:10.1145/219717.219791 · Cited by 3,205
Supervised and Unsupervised Discretization of Continuous Features
Dougherty, J., Kohavi, R., & Sahami, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50032-3 · Cited by 1,936
Improved Use of Continuous Attributes in C4.5
Quinlan, J. R. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.279 · Cited by 1,846
Cited by
Pawlak, Z., & Skowron, A. (2007) · Information Sciences · doi:10.1016/j.ins.2006.06.003 · Cited by 2,070
Qualitative Spatial Representation and Reasoning: An Overview
Cohn, A. G., & Hazarika, S. M. (2001) · doi:10.5555/1219982.1219984 · Cited by 667
Chapter 13 Qualitative Spatial Representation and Reasoning
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)03013-1 · Cited by 361
Information entropy, rough entropy and knowledge granulation in incomplete information systems
Liang, J., Shi, Z., Li, D., & Wierman, M. J. (2006) · International Journal of General Systems · doi:10.1080/03081070600687668 · Cited by 318
Measures of uncertainty for neighborhood rough sets
Chen, Y., Xue, Y., Ma, Y., & Xu, F. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2017.01.008 · Cited by 87
Metadata
- Authors
- Düntsch, I., & Gediga, G.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1998-11
- Volume
- 106
- Issue
- 1
- Pages
- 109-137
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2014127819
- Cited by
- 415
- References
- 21
- FWCI
- 4.02
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Uncertainty measures of rough set prediction. https://app.cochat.ai/papers/10.1016/s0004-3702(98)00091-5
- The paper
- Düntsch, I., & Gediga, G. (1998). Uncertainty measures of rough set prediction. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(98)00091-5
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.