Partially ordered monads and rough sets

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Eklund, P., & Galán, M. Á. (2008). Partially ordered monads and rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5084 LNCS, pp. 53–74). https://doi.org/10.1007/978-3-540-85064-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free