Stell, JG (2016) Ordered Information Systems and Graph Granulation. In: Lecture Notes in Computer Science. International Joint Conference on Rough Sets, 07-11 Oct 2016, Santiago de Chile, Chile. Springer Verlag , pp. 131-142. ISBN 978-3-319-47160-0
Abstract
The concept of an Information System, as used in Rough Set theory, is extended to the case of a partially ordered universe equipped with a set of order preserving attributes. These information systems give rise to partitions of the universe where the set of equivalence classes is partially ordered. Such ordered partitions correspond to relations on the universe which are reflexive and transitive. This correspondence allows the definition of approximation operators for an ordered information system by using the concepts of opening and closing from mathematical morphology. A special case of partial orders are graphs and hypergraphs and these provide motivation for the need to consider approximations on partial orders.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | (c) 2016, Springer International Publishing AG. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. The final publication is available at Springer via https://doi.org/10.1007/978-3-319-47160-0_12 |
Keywords: | Ordered Information System; Graph Granulation; Graph Partitioning |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 31 Aug 2016 10:45 |
Last Modified: | 18 Jan 2017 17:00 |
Published Version: | https://doi.org/10.1007/978-3-319-47160-0_12 |
Status: | Published |
Publisher: | Springer Verlag |
Identification Number: | 10.1007/978-3-319-47160-0_12 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:103999 |