Show simple item record

dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorSkowron, Andrzej
dc.contributor.authorSuraj, Zbigniew
dc.date.accessioned2015-08-04T06:20:40Z
dc.date.available2015-08-04T06:20:40Z
dc.date.issued2010
dc.identifier.citationMoshkov, M., Skowron, A., & Suraj, Z. (2010). Irreducible Descriptive Sets of Attributes for Information Systems. Transactions on Rough Sets XI, 92–105. doi:10.1007/978-3-642-11479-3_6
dc.identifier.isbn3642114784; 9783642114786
dc.identifier.issn03029743
dc.identifier.doi10.1007/978-3-642-11479-3_6
dc.identifier.urihttp://hdl.handle.net/10754/564249
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.
dc.publisherSpringer Nature
dc.subjectInformation systems
dc.subjectIrreducible descriptive sets
dc.subjectMaximal consistent extensions
dc.subjectRough sets
dc.titleIrreducible descriptive sets of attributes for information systems
dc.typeBook Chapter
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journalLecture Notes in Computer Science
dc.contributor.institutionInstitute of Mathematics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
dc.contributor.institutionDepartment of Computer Science, University of Rzeszów, Rejtana 16A, 35-310 Rzeszów, Poland
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record