Incremental Versus Non-incremental: Data and Algorithms Based on Ordering Relations
Based on multi-dominance discernibility matrices, a non-incremental algorithm RIDDM and an incremental algorithm INRIDDM are 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...
| Những tác giả chính: | , , , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Springer
2011-02-01
|
| Loạt: | International Journal of Computational Intelligence Systems |
| Những chủ đề: | |
| Truy cập trực tuyến: | https://www.atlantis-press.com/article/2131.pdf |
| Tóm tắt: | Based on multi-dominance discernibility matrices, a non-incremental algorithm RIDDM and an incremental algorithm INRIDDM are 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. Time complexity analysis and experimental results show that the incremental algorithm INRIDDM is superior to some other non-incremental algorithms when dealing with large data sets. This paper also explores the influence of data saturation and data concentration on rule induction algorithms. We come to conclude that the data saturation and data concentration are important for the performance analysis of one learning algorithm. |
|---|---|
| số ISSN: | 1875-6883 |