Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Communications of the ACM
Data mining: concepts and techniques
Data mining: concepts and techniques
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory
Multi-objective rule mining using genetic algorithms
Information Sciences: an International Journal - Special issue: Soft computing data mining
Rule generation and model selection used for medical diagnosis
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Challenges for future intelligent systems in biomedicine
A New Heuristic Algorithm of Rules Generation Based on Rough Sets
ISBIM '08 Proceedings of the 2008 International Seminar on Business and Information Management - Volume 01
A Survey of Outlier Detection Methods in Network Anomaly Identification
The Computer Journal
Surveying Port Scans and Their Detection Methodologies
The Computer Journal
Mining rare association rules in the datasets with widely varying items' frequencies
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
A rough set based model to rank the importance of association rules
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
A New Version of the Rule Induction System LERS
Fundamenta Informaticae
Accountability and Q-Accountable Logging in Wireless Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
In this paper, we use Rough Set Theory RST to address the important problem of generating decision rules for data mining. In particular, we propose a rough set-based approach to mine rules from inconsistent data. It computes the lower and upper approximations for each concept, and then builds concise classification rules for each concept satisfying required classification accuracy. Estimating lower and upper approximations substantially reduces the computational complexity of the algorithm. We use UCI ML Repository data sets to test and validate the approach. We also use our approach on network intrusion data sets captured using our local network from network flows. The results show that our approach produces effective and minimal rules and provides satisfactory accuracy.