Pages that link to "Item:Q4421057"
From MaRDI portal
The following pages link to Tree structure for efficient data mining using rough sets (Q4421057):
Displaying 14 items.
- Two new types of multiple granulation rough set (Q469876) (← links)
- Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values (Q528707) (← links)
- A logarithmic time complexity algorithm for pattern searching using product-sum property (Q660854) (← links)
- Uncertainty measures in ordered information system based on approximation operators (Q1725119) (← links)
- A novel approach to information fusion in multi-source datasets: a granular computing viewpoint (Q2291783) (← links)
- The comparative study of covering rough sets and multi-granulation rough sets (Q2317630) (← links)
- Multigranulations rough set method of attribute reduction in information systems based on evidence theory (Q2336790) (← links)
- Dominance-based rough set approach and knowledge reductions in incomplete ordered information system (Q2476761) (← links)
- Multiset concepts in two-universe approximation spaces (Q2661077) (← links)
- Multiple granulation rough set approach to ordered information systems (Q2869777) (← links)
- An Improved Parallel Method for Computing Rough Set Approximations (Q2963697) (← links)
- Covering-based fuzzy rough sets (Q2987818) (← links)
- HDD: a hypercube division-based algorithm for discretisation (Q3006194) (← links)
- A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values (Q3065319) (← links)
