On Granular Rough Computing: Factoring Classifiers Through Granulated Decision Systems

  • Authors:

  • Lech Polkowski;Piotr Artiemjew

  • Affiliations:

  • Polish---Japanese Institute of Information Technology, Koszykowa 86, 02008 Warszawa, Poland and Department of Mathematics and Computer Science, University of Warmia and Mazury, Olsztyn, Poland;Department of Mathematics and Computer Science, University of Warmia and Mazury, Olsztyn, Poland

  • Venue:
  • RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paradigm of Granular Computing has quite recently emerged as an area of research on its own; in particular, it is pursued within rough set theory initiated by Zdzisław Pawlak. Granules of knowledge consist of entities with a similar in a sense information content. An idea of a granular counterpart to a decision/information system has been put forth, along with its consequence in the form of the hypothesis that various operators, aimed at dealing with information, should factorize sufficiently faithfully through granular structures [7], [8]. Most important such operators are algorithms for inducing classifiers. We show results of testing few well-known algorithms for classifier induction on well---used data sets from Irvine Repository in order to verify the hypothesis. The results confirm the hypothesis in case of selected representative algorithms and open a new prospective area of research.