Show simple item record

dc.contributor.authorAzad, Mohammad
dc.contributor.authorChikalov, Igor
dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorZielosko, Beata
dc.date.accessioned2019-07-21T10:44:45Z
dc.date.available2019-07-21T10:44:45Z
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/10754/656120
dc.description.abstractThe paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. The idea of algorithm is connected with so-called boundary subtables. After constructing a test we use algorithm which tries to remove attributes from a test and obtain a reduct. We present experimental results connected with the cardinality of tests and reducts for randomly generated tables and data sets from UCI Machine Learning Repository which were converted to decision tables with many-valued decisions. To make some comparative study we presents also experimental results for greedy algorithm which constructs a test based on generalized decision approach.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttps://ieeexplore.ieee.org/document/6354321/
dc.relation.urlhttps://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6354321
dc.rights(c) 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Released under the IEEE Open Access Publishing Agreement.
dc.titleTests for decision tables with many-valued decisions — Comparative study
dc.typeConference Paper
dc.contributor.departmentApplied Mathematics and Computational Science
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputational Bioscience Research Center
dc.contributor.departmentComputational Bioscience Research Center (CBRC)
dc.contributor.departmentComputer Science
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentOffice of the VP
dc.conference.date9-12 Sept. 2012
dc.conference.name2012 Federated Conference on Computer Science and Information Systems (FedCSIS)
dc.conference.locationWroclaw
dc.eprint.versionPost-print
dc.contributor.institutionInstitute of Computer Science, University of Silesia, 39, Beędzińska St., 41-200 Sosnowiec, Poland
kaust.personAzad, Mohammad
kaust.personChikalov, Igor
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record