A core algorithm of attribute sets based on the discernibility matrix
From MaRDI portal
Publication:4690474
DOI10.13705/J.ISSN.1671-6841.2017085zbMATH Open1413.68145MaRDI QIDQ4690474FDOQ4690474
Authors: Tao Yang, Xianyong Zhang, Shan Feng 
Publication date: 22 October 2018
Recommendations
- A new algorithm for obtaining the core of an information system
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
- Quick algorithm for computing the core based on a positive region
- Block discernibility matrix based on decision classification and its algorithm finding the core
- scientific article; zbMATH DE number 5584308
Cited In (9)
- Quick algorithm for computing the core based on a positive region
- An algorithm for computation of a core for unbalanced classification data
- An incremental updating algorithm for the computation of a core based on the discernibility matrix
- A new algorithm for obtaining the core of an information system
- Investigation on AQ11, ID3 and the principle of discernibility matrix
- Title not available (Why is that?)
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: A core algorithm of attribute sets based on the discernibility matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690474)
