Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data
Article first published online: 3 JUN 2013
© 2013 Wiley Periodicals, Inc.
International Journal of Intelligent Systems
Special Issue: Foundations and Applications of Granular Computing
Volume 28, Issue 9, pages 865–882, September 2013
How to Cite
Sakai, H., Wu, M. and Nakata, M. (2013), Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data. Int. J. Intell. Syst., 28: 865–882. doi: 10.1002/int.21608
- Issue published online: 15 JUL 2013
- Article first published online: 3 JUN 2013
- Grant-in-Aid for Scientific Research (C) (No. 22500204), Japan Society for the Promotion of Science
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.