南昌工程学院学报2006，Vol.25Issue(2)：22-27,34,7.
A Calculus on Granules from Rough Inclusions in Information Systems
A Calculus on Granules from Rough Inclusions in Information Systems
Lech Polkowski1
作者信息
- 1. Polish-Japanese Institute of Information Technology, Koszykowa str. 86, 02008 Warsaw, Poland
- 折叠
摘要
Abstract
Indiscernibility relations induced in information systems in the sense of Pawlak,define granules of knowledge as unions of their equivalence classes,leading to regular structures like Boolean algebras. Apart from Boolean operations on granules, under afixed set of attributes,that induce the partition topology on their collection, one may search for more flexible schemes that would induce in collections of granules some non-trivial topologies and in particular quasi-metrics on granules, allowing for richer structures. A way of realization of this program has been proposed as the paradigm of rough mereology; although abstract, stemming from an alternative set theory, yet it offers a calculus based on kind of quasi-metrics that allows for discussing granules from the point of view of their closeness. In thiswork, we would liketopresent theideas of this approach and basic results with short discussion of applications.关键词
Granular Computing/information systems/indiscernibility/rough set theory/rough inclusionsKey words
Granular Computing/information systems/indiscernibility/rough set theory/rough inclusions分类
数理科学引用本文复制引用
Lech Polkowski..A Calculus on Granules from Rough Inclusions in Information Systems[J].南昌工程学院学报,2006,25(2):22-27,34,7.
