Irreducible descriptive sets of attributes for information systems

Handle URI:
http://hdl.handle.net/10754/564249
Title:
Irreducible descriptive sets of attributes for information systems
Authors:
Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Skowron, Andrzej; Suraj, Zbigniew
Abstract:
The maximal consistent extension Ext(S) of a given information system S consists of all objects corresponding to attribute values from S which are consistent with all true and realizable rules extracted from the original information system S. An irreducible descriptive set for the considered information system S is a minimal (relative to the inclusion) set B of attributes which defines exactly the set Ext(S) by means of true and realizable rules constructed over attributes from the considered set B. We show that there exists only one irreducible descriptive set of attributes. We present a polynomial algorithm for this set construction. We also study relationships between the cardinality of irreducible descriptive set of attributes and the number of attributes in S. The obtained results will be useful for the design of concurrent data models from experimental data. © 2010 Springer-Verlag.
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:
Springer Science + Business Media
Journal:
Lecture Notes in Computer Science
Issue Date:
2010
DOI:
10.1007/978-3-642-11479-3_6
Type:
Book Chapter
ISSN:
03029743
ISBN:
3642114784; 9783642114786
Appears in Collections:
Applied Mathematics and Computational Science Program; Book Chapters; 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-04T06:20:40Zen
dc.date.available2015-08-04T06:20:40Zen
dc.date.issued2010en
dc.identifier.isbn3642114784; 9783642114786en
dc.identifier.issn03029743en
dc.identifier.doi10.1007/978-3-642-11479-3_6en
dc.identifier.urihttp://hdl.handle.net/10754/564249en
dc.description.abstractThe maximal consistent extension Ext(S) of a given information system S consists of all objects corresponding to attribute values from S which are consistent with all true and realizable rules extracted from the original information system S. An irreducible descriptive set for the considered information system S is a minimal (relative to the inclusion) set B of attributes which defines exactly the set Ext(S) by means of true and realizable rules constructed over attributes from the considered set B. We show that there exists only one irreducible descriptive set of attributes. We present a polynomial algorithm for this set construction. We also study relationships between the cardinality of irreducible descriptive set of attributes and the number of attributes in S. The obtained results will be useful for the design of concurrent data models from experimental data. © 2010 Springer-Verlag.en
dc.publisherSpringer Science + Business Mediaen
dc.subjectInformation systemsen
dc.subjectIrreducible descriptive setsen
dc.subjectMaximal consistent extensionsen
dc.subjectRough setsen
dc.titleIrreducible descriptive sets of attributes for information systemsen
dc.typeBook Chapteren
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.journalLecture Notes in Computer Scienceen
dc.contributor.institutionInstitute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Polanden
dc.contributor.institutionDepartment of Computer Science, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Polanden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.