Ranking Rough Sets in Pawlak Approximation Spaces

Journal Title: Annals of Computer Science and Information Systems - Year 2018, Vol 15, Issue

Abstract

By the cardinality of finite sets, interval numbers can be assigned to rough sets which are represented by nested sets. Borrowing two different comparison methods from Multiple Attribute Decision Making analysis, rough sets are compared and ranked on the model of interval numbers. Some special cases are investigated. Illustrative examples are presented relying on both methods. The calculated results are compared and interpreted.

Authors and Affiliations

Zoltán Ernő Csajbók, Jozsef Kodmon

Keywords

Related Articles

Mizar Set Comprehension in Isabelle Framework

The Mizar project from its beginning aimed to make a highly human oriented proof environment where the proof style closely reflects the informal proofs style. The support is reflected in the size of the largest consisten...

The Practical Use of Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals

The usual assumption in the Evolutionary Computation field is that a cost of computing single fitness function evaluation is at last similar for all cases. Such assumption does not have to be true. In this paper we consi...

The Use of Gamification for Teaching Algorithms

This paper presents our experience using gamification principles into the free and open-source learning management system Moodle for aiding and abetting our Computer Science students in learning algorithms. In this work,...

Automatic Assessment of Student Understanding Level using Virtual Reality

The improvement of the efficiency in teaching re- quires knowing the understanding level of each student. However, it is difficult due to limited time in a class. We propose a Virtual Reality (VR) space imposing assignme...

Business Process Management: Terms, Trends and Models

Business Process Management (BPM) is a subject that is becoming a growing trend in the fields of Business Administration, Engineering, Information Technology (IT), among others. Understanding the subject is a complex and...

Download PDF file
  • EP ID EP569791
  • DOI 10.15439/2018F160
  • Views 11
  • Downloads 0

How To Cite

Zoltán Ernő Csajbók, Jozsef Kodmon (2018). Ranking Rough Sets in Pawlak Approximation Spaces. Annals of Computer Science and Information Systems, 15(), 35-38. https://europub.co.uk/articles/-A-569791