| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419922 | Discrete Applied Mathematics | 2008 | 17 Pages |
Abstract
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of rough set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an information retrieval system.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eric SanJuan,