Tree structure for efficient data mining using rough sets

DOI10.1016/S0167-8655(02)00197-6zbMath1053.68036OpenAlexW2024733335MaRDI QIDQ4421057

M. Narasimha Murty, V. S. Ananthanarayana, D. K. Subramanian

Publication date: 19 August 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00197-6

zbMATH Keywords

Rough setPC-treeDynamic miningRough classificationSegment PC-treeSingle database scan

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30)

Related Items (14)

Multiset concepts in two-universe approximation spaces ⋮ An Improved Parallel Method for Computing Rough Set Approximations ⋮ Covering-based fuzzy rough sets ⋮ Two new types of multiple granulation rough set ⋮ Uncertainty measures in ordered information system based on approximation operators ⋮ A logarithmic time complexity algorithm for pattern searching using product-sum property ⋮ HDD: a hypercube division-based algorithm for discretisation ⋮ Dominance-based rough set approach and knowledge reductions in incomplete ordered information system ⋮ Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values ⋮ A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values ⋮ 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 ⋮ Multiple granulation rough set approach to ordered information systems

This page was built for publication: Tree structure for efficient data mining using rough sets