Attribute reduction algorithm based on indiscernibility ordered pair
From MaRDI portal
Recommendations
- Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems
- An algorithm for numerical attribute reduction based on discernibility matrix
- An algorithm for attribute frequency reduction based on discernibility matrix
- Efficient attribute reduction from the viewpoint of discernibility
- scientific article; zbMATH DE number 2221111
Cited in
(14)- Lower approximation reduction based on discernibility information tree in inconsistent ordered decision information systems
- Second attribute algorithm based on tree expression
- Attribute reduction algorithm of consistent ordered decision system based on the close-degree
- scientific article; zbMATH DE number 6907507 (Why is no real title available?)
- An attribute reduction algorithm to find learner's key characteristics based on the discernible function
- Attribute reduction algorithm based on tolerance relation under attribute order
- A heuristic algorithm for attribute reduction based on discernibility and equivalence by attributes
- The Attribute Reductions Based on Indiscernibility and Discernibility Relations
- Partially consistent reduction based on discernibility information tree in interval-valued fuzzy ordered information systems with decision
- A parallel reduction algorithm of ordered information systems based on attribute partition
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
- scientific article; zbMATH DE number 2221111 (Why is no real title available?)
- Inconsistency guided robust attribute reduction
This page was built for publication: Attribute reduction algorithm based on indiscernibility ordered pair
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132128)
