## Abstract

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.

Original language | English (US) |
---|---|

Pages (from-to) | 247-258 |

Number of pages | 12 |

Journal | Fundamenta Informaticae |

Volume | 80 |

Issue number | 1-3 |

State | Published - 2007 |

Externally published | Yes |

## Keywords

- Information systems
- Irreducible inconsistent systems of equations
- Minimal rules

## ASJC Scopus subject areas

- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics