On minimal inhibitory rules for almost all k-valued information systems

Handle URI:
http://hdl.handle.net/10754/561419
Title:
On minimal inhibitory rules for almost all k-valued information systems
Authors:
Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Skowron, Andrzej; Suraj, Zbigniew
Abstract:
The minimal inhibitory rules for information systems can be used for construction of classifiers. We show that almost all information systems from a certain large class of information systems have relatively short minimal inhibitory 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 k-valued information systems, k ≥ 2, with the number of objects polynomial in the number of attributes. Hence, for efficient construction of classifiers some filtration techniques in rule generation are necessary. Another way is to work with lazy classification algorithms based on inhibitory rules.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
IOS Press
Journal:
Fundamenta Informaticae
Issue Date:
30-Jul-2009
DOI:
10.3233/FI-2009-0101
Type:
Article
ISSN:
01692968
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorSkowron, Andrzejen
dc.contributor.authorSuraj, Zbigniewen
dc.date.accessioned2015-08-02T09:10:45Zen
dc.date.available2015-08-02T09:10:45Zen
dc.date.issued2009-07-30en
dc.identifier.issn01692968en
dc.identifier.doi10.3233/FI-2009-0101en
dc.identifier.urihttp://hdl.handle.net/10754/561419en
dc.description.abstractThe minimal inhibitory rules for information systems can be used for construction of classifiers. We show that almost all information systems from a certain large class of information systems have relatively short minimal inhibitory 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 k-valued information systems, k ≥ 2, with the number of objects polynomial in the number of attributes. Hence, for efficient construction of classifiers some filtration techniques in rule generation are necessary. Another way is to work with lazy classification algorithms based on inhibitory rules.en
dc.publisherIOS Pressen
dc.subjectInformation systemsen
dc.subjectIrreducible inconsistent systems of equationsen
dc.subjectMinimal inhibitory rulesen
dc.titleOn minimal inhibitory rules for almost all k-valued information systemsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalFundamenta Informaticaeen
dc.contributor.institutionInstitute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Polanden
dc.contributor.institutionDepartment of Computer Science, University of Rzeszów, Dekerta 2, 35-030 Rzeszów, Polanden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.