2000
DOI: 10.1007/978-3-7908-1840-6_3
|View full text |Cite
|
Sign up to set email alerts
|

Rough Set Algorithms in Classification Problem

Abstract: 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 [431. 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 n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
191
0
1

Year Published

2002
2002
2014
2014

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 336 publications
(192 citation statements)
references
References 21 publications
(32 reference statements)
0
191
0
1
Order By: Relevance
“…In the rough set approach the elementary sets are the basic building blocks (concepts) of our knowledge about reality. The unions of B-elementary sets are called B-definable sets 3 .…”
Section: Indiscernibility and Approximationmentioning
confidence: 99%
“…In the rough set approach the elementary sets are the basic building blocks (concepts) of our knowledge about reality. The unions of B-elementary sets are called B-definable sets 3 .…”
Section: Indiscernibility and Approximationmentioning
confidence: 99%
“…In some applications, instead of reducts, we prefer to use their approximations called α-reducts, where α Different kinds of reducts and their approximations are discussed in the literature as basic constructs for reasoning about data represented in information systems or decision tables (see, e.g., [3,48,49]). It turns out that they can be efficiently computed using heuristics based on the Boolean reasoning approach.…”
Section: Reduction Of Attributesmentioning
confidence: 99%
“…We say that rule r is applicable to object, or alternatively, the object matches rule, if its attribute values satisfy the premise of the rule. With the rule we can connect some numerical characteristics such as matching and support (see [2,3]). …”
Section: Basic Notionsmentioning
confidence: 99%
“…Rule induction algorithms. Based on the calculated reduct it is possible to calculate decision rules (see [3]). Procedures for rule calculation allow user to determine some crucial constraints for the set of decision rules such as required accuracy, coverage and so on.…”
Section: The Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation