Abstract
Non–deterministic Information Systems (NISs) are ad-vanced extensions of Deterministic Information Systems (DISs), and NISs are known well as systems handling information incompleteness in tables. This paper examines manipulations on equivalence relations in DISs and manipulations on possible equivalence relations in NISs. This paper also follows rough sets based rule generation in DISs, and proposes rough sets based hypothesis generation in NISs. A hypothesis in NISs is defined by a formula satisfying some kinds of constraint, and effective algorithms for generating hypotheses in NISs are presented. Possible equivalence relations play important roles in generating hypotheses. Some illustrative examples and real executions of algorithms are shown, too.
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.
