This paper discusses a new rough logic based on incomplete information. Originally rough logic was constructed upon knowledge systems of complete information. In this paper, we consider incomplete knowledge representation systems in which information functions are nondeterministic. After modifying t
Rough classification in incomplete information systems
✍ Scribed by Roman Słowiński; Jerzy Stefanowski
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 835 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Rough sets theory has proved to be a useful mathematical tool for classification and prediction. However, as many real-world problems deal with ordering objects instead of classifying objects, one of the extensions of the classical rough sets approach is the dominance-based rough sets approach, whic
graphs, which give rise to three variants of matching. For each variant, we provide algorithms and complexity results. In the filter phase, the maximal matchings resulting from the search phase are subjected to constraints, which may be weak or strong. Strong constraints require all their variables