Tree structure for efficient data mining using rough sets

DOI10.1016/S0167-8655(02)00197-6zbMath1053.68036MaRDI 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 set; PC-tree; Dynamic mining; Rough classification; Segment PC-tree; Single database scan

Mathematics Subject Classification ID

68P15: Database theory

68T30: Knowledge representation

Related Items

Two new types of multiple granulation rough set, Fast algorithms for computing rough approximations in set-valued decision systems while updating criteria values, A logarithmic time complexity algorithm for pattern searching using product-sum property, 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, 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