Tree structure for efficient data mining using rough sets
From MaRDI portal
Publication:4421057
Recommendations
Cited in
(18)- Uncertainty measures in ordered information system based on approximation operators
- A novel approach to information fusion in multi-source datasets: a granular computing viewpoint
- The comparative study of covering rough sets and multi-granulation rough sets
- Multigranulations rough set method of attribute reduction in information systems based on evidence theory
- Dominance-based rough set approach and knowledge reductions in incomplete ordered information system
- Multiset concepts in two-universe approximation spaces
- Construction of consistent sets and decision trees based on rough set theory
- Multiple granulation rough set approach to ordered information systems
- An Improved Parallel Method for Computing Rough Set Approximations
- Covering-based fuzzy rough sets
- HDD: a hypercube division-based algorithm for discretisation
- A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values
- Two new types of multiple granulation rough set
- Data Mining with Decision Trees
- Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values
- Approach to data mining based on rough sets and decision tree
- An incremental data mining algorithm for compact realization of prototypes
- A logarithmic time complexity algorithm for pattern searching using product-sum property
This page was built for publication: Tree structure for efficient data mining using rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421057)