Information flow: the logic of distributed systems
Information flow: the logic of distributed systems
Rough set methods for the synthesis and analysis of concurrent processes
Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Some Remarks on Extensions and Restrictions of Information Systems
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
A New Method for Determining of Extensions and Restrictions of Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
On testing membership to maximal consistent extensions of information systems
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
On Minimal Inhibitory Rules for Almost All k-Valued Information Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
The minimal rules for information systems are often used for inducing data models by methods in which the optimization of models is based on the minimal length principle. We show that almost all information systems from a certain large class of information systems have relatively short minimal rules. However, the number of such rules is not polynomial in the number of attributes and the number of objects. This class consists of all binary information systems with the number of objects polynomial in the number of attributes. Hence, for efficient inducing data models some filtration techniques in rule generation are necessary. In our further study we would like to extend our results for arbitrary information systems.