Division Charts As Granules And Their Merging Algorithm For Rule Generation In Nondeterministic Data

摘要

We have been proposing a framework rough Nondeterministic information analysis, which considers granular computing concepts in tables with incomplete and nondeterministic information, as well as rule generation. We have recently defined an expression named division chart with respect to an implication and a subset of objects. Each division chart takes the role of the minimum granule for rule generation, and it takes the role of contingency table in statistics. In this paper, we at first define a division chart in deterministic information systems (Diss) and clarify the relation between a division chart and a corresponding implication. We also consider a merging algorithm for two division charts and extend the relation in Diss to nondeterministic information systems. The relation gives us the foundations of rule generation in tables with nondeterministic information.