An Incremental Rule Induction Algorithm Based on Ordering Relations

Authors:
Xiuyi Jia;Lin Shang;Jiajun Chen;Xinyu Dai
Affiliations:
State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China 210093
Venue:
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Year:
2009

Citing 5
Cited 0

Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
An Incremental Learning Algorithm for Constructing Decision Rules

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Interpreting Low and High Order Rules: A Granular Computing Approach

RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Incremental versus non-incremental rule induction for multicriteria classification

Transactions on Rough Sets II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on multi-dominance discernibility matrices, an incremental algorithm INRIDDM is proposed by means of dominance-based rough set approach. For the incremental algorithm, when a new object arrives, after updating one row or one column in the matrix, we could get the updated rule sets. Computation analysis and experimental results show that the incremental algorithm INRIDDM is superior to other non-incremental algorithms on dealing with large data sets.