Change search
ReferencesLink to record
Permanent link

Direct link
Partially Ordered Monads and Rough Sets
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Department of Applied Mathematics, University of Málaga, Spain.
2008 (English)In: Transactions on Rough Sets VIII / [ed] James F. Peters, Andrzej Skowron, Springer Berlin/Heidelberg, 2008, 53-74 p.Chapter in book (Other academic)
Abstract [en]

In this paper we will show that partially ordered monads contain appropriate structure for modeling rough sets in a generalized relational setting. Partially ordered monads are further shown to be useful in topological and generalized convergence frameworks. The paper thus demonstrates the use of monad constructions for applications to rough sets and even further towards entirely new types of applications of these generalized rough sets. In doings so, the paper opens up previously unknown research directions for rough sets both towards applications within other theoretical research areas but also for real world applications.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2008. 53-74 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 5084
National Category
Computer and Information Science
URN: urn:nbn:se:umu:diva-76190DOI: 10.1007/978-3-540-85064-9_4ISI: 000268415200004ISBN: 978-3-540-85063-2ISBN: 978-3-540-85064-9OAI: diva2:635544
Available from: 2013-07-04 Created: 2013-07-04 Last updated: 2013-07-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Eklund, Patrik
By organisation
Department of Computing Science
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 11 hits
ReferencesLink to record
Permanent link

Direct link