Abstract
In this paper we study the lattice of all indiscernibility partitions induced from attribute subsets of a knowledge representation system (information table in the finite case). This lattice, that we here call granular partition lattice, is a very well studied order structure in granular computing and data base theory and it provides a complete hierarchical classification of the knowledge obtained from all possible choices of attribute subsets. We show that it has a lattice structure also in the infinite case and we provide several isomorphic characterizations for this lattice. We discuss the potentiality of this order structure from both a micro-granular and a macro-granular perspective. Furthermore, the sub-poset of all the indiscernibility closures needed to determine when an arbitrary partition is an indiscernibility one is studied. Finally, we show the monotonic behaviour of the granular partition lattice with respect to entropy of partitions and attribute dependency in decision tables.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
