Detailed Course Information |
2025 Winter
Apr 23, 2025 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 836 - Rough Sets & Applications |
|
Theory of rough sets is a fundamental mathematical methodology for modelling classification or decision problems involving imprecise or uncertain information. Its implications include pattern classification, data mining, machine learning, control algorithm acquisition from data, circuit design and others. The course will provide the basics of the methodology and will include the study of the above applications of rough sets. Prior to registering for this course, students should have a background in discrete computational structures, artificial intelligence and statistical methods comparable to the senior undergraduate level.
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Graduate |
| Return to Previous | New Search |
|