Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-88425-5_3 | T. Rough Sets |
Keywords | DocType | Volume |
set construction,information systems,considered information system,irreducible descriptive set,set ext,realizable rule,irreducible descriptive sets,information system sconsists,original information system,maximal consistent extension,experimental data,concurrent data model,rough sets,rough set,data model,information system | Conference | 11 |
ISSN | ISBN | Citations |
0302-9743 | 3-642-11478-4 | 2 |
PageRank | References | Authors |
0.38 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mikhail Ju. Moshkov | 1 | 335 | 60.44 |
| Andrzej Skowron | 2 | 80 | 5.86 |
| Zbigniew Suraj | 3 | 501 | 59.96 |