Premium
Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data
Author(s) -
Sakai Hiroshi,
Wu Mao,
Nakata Michinori
Publication year - 2013
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.21608
Subject(s) - nondeterministic algorithm , division (mathematics) , relation (database) , chart , computer science , contingency table , algorithm , table (database) , mathematics , theoretical computer science , data mining , arithmetic , statistics , machine learning
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.