Tree structure for efficient data mining using rough sets

Pattern Recognition Letters

Volumn 24, Issue 6, 2003, Pages 851-862

  Ananthanarayana, V S ^a   Narasimha Murty, M ^a   Subramanian, D K ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Classification; Dynamic mining; PC tree; Rough PC tree; Rough set; Segment PC tree; Single databasa scan

Indexed keywords

DATA MINING; DATABASE SYSTEMS; DECISION MAKING; ROUGH SET THEORY; SCANNING;

DATA ABSTRACTION;

TREES (MATHEMATICS);

DATA PROCESSING;

EID: 0037332843     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00197-6     Document Type: Article

References (18)

1. Fast algorithms for mining association rules in large databases
2. Scalable, distributed and dynamic mining of association rules
3. Rough set based classification methods for extended decision tables
4. Knowledge discovery databases: An overview
5. Mining multiple-level association rules in large databases
6. Variable precision rough sets with asymmetric bounds
7. Rule prepending and post-pruning approach to incremental learning of decision lists
8. Rough sets
9. Growing subspace pattern recognition methods and their neural network models
10. Comparison of genetic algorithm based prototype selection schemes
11. Rough classification with valued closeness relation
12. Hand-written digit recognition using soft computing
13. An efficient algorithm for the incremental updation of association rules in large databases
14. The discovery, analysis and representation of data dependencies in databases