Incremental Computing Approximations with the Dynamic Object set in Interval-valued Ordered Information System

• Autorzy: Yu J. , Xu W.

Identyfikatory

DOI

10.3233/FI-2015-1298

• Języki publikacji: EN

Abstrakty

EN

Rough set theory has been successfully used in formation system for classification analysis and knowledge discovery. The upper and lower approximations are fundamental concepts of this theory. The new information arrives continuously and redundant information may be produced with the time in real-world application. So, then incremental learning is an efficient technique for knowledge discovery in a dynamic database, which enables acquiring additional knowledge from new data without forgetting prior knowledge, which need to be updated incrementally while the object set get varies over time in the interval-valued ordered information system. In this paper, we analyzed the updating mechanisms for computing approximations with the variation of the object set. Two incremental algorithms respectively for adding and deleting objects with updating the approximations are proposed in interval-valued ordered information system. Furthermore, extensive experiments are carried out on six UCI data sets to verify the performance of these proposed algorithms. And the experiments results indicate the incremental approaches significantly outperform non-incremental approaches with a dramatic reduction in the computational time.

Słowa kluczowe

EN

approximations; dynamic database; incremental learning; interval-valued ordered information system

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2015
• Tom: Vol. 142, nr 1-4
• Strony: 373--397
• Opis fizyczny: Bibliogr. 44 poz., rys., tab.

Twórcy

autor

Yu J.

• School of Mathematics and Statistics Chongqing University of Technology Chongqing, 400054, P.R. China

autor

Xu W.

• School of Mathematics and Statistics Chongqing University of Technology Chongqing, 400054, P.R. China

Bibliografia

• [1] BangW.C., Bien Z.: New incremental learning algorithm in the framework of rough set theory, International Journal of Fuzzy Systems , 1 , 1999, 25-36.
• [2] N. Bryson, A. Mobolurin, An action learning evaluation procedure for multiple criteria decision making problems, European Journal of Operational Research, 96, 1996, 379-386.
• [3] G. Cattaneo, D. Ciucci, Investigation about time monotonicity of similarity and preclusive rough approximations in incomplete information systems, in: Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing, in: LNAI, 3066, 2004, 38-48.
• [4] Y. Chen, K.W. Li, J. Levy, K.W. Hipel, D.M. Kilgour, A rough set approach to multiple criteria ABC analysis, Transactions on Rough Sets VIII, Lecture Notesin Computer Science, Springer-Verlag, Berlin, 5084, 2008.
• [5] H.M. Chen, T.R. Li, S.J. Qiao, D. Ruan, A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values, International Journal of Intelligent Systems, 25, 2010, 1005-1026.
• [6] H.M. Chen, T.R. Li, D. Ruan, J.H. Lin, C.X. Hu, A rough-set based incremental approach for updating approximations under dynamic maintenance environments, IEEE Transactions on Knowledge and Data Engineering, 25, 2013, 274-284.
• [7] D. Ciucci, Classification of dynamics in rough sets, in: Proceedings of 7th International Conference on Rough Sets and Current Trends in Computing, in: LNAI, 6086, 2010, 257-266.
• [8] D. Ciucci, Attribute dynamics in rough sets, in: Proceedings of ISMIS11, in: LNCS, 6804, 2011, 43-51.
• [9] D. Ciucci, Temporal dynamics in information tables, Fundamenta Informaticae, 115, 2012, 57-74.
• [10] Y. Fan, T. Tseng, C. Chern, C. Huang, Rule induction based on an incremental rough set, Expert Systems with Applications 36 2009, 11439-11450.
• [11] S. Greco, B. Matarazzo, R. Słowi´nski, Handing missing values in rough set analysis of multiattribute and muti-criteria decision problems, in: N. Zhong, A. Skowron, S. Ohsuga (Eds.), New Directions in Rough Sets, Data Mining and Granular-Soft Computing, Seventh International Workshop (RSFDGrC1999), Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, 1711, 1999, 146-157.
• [12] S. Greco, B. Matarazzo, R. Słowi´nski, Rough approximation by dominance relations, International Journal of Systems 17, 2002, 153-171.
• [13] S. Greco, B. Matarazzo, R. Słowi´nski, Rough sets theory for multicriteria decision analysis, European Journal of Operational Research, 129, 2002, 1-47.
• [14] S. Greco, M. Inuiguchi, R. Słowi´nski, Fuzzy rough sets and multiple-premise gradual decision rules, International Journal of Approximate Reasoning, 41, 2006, 179-211.
• [15] S. Greco, B. Matarazzo, R. Słowi´nski, Dominance-based rough set approach to case-based reasoning, in: V. Torra, Y. Narukawa, A. Valls, J. Domingo-Ferrer (Eds.), Modeling Decisions for Artificial Intelligence, Third International Conference (MDAI 2006), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 3885, 2006, 7-18.
• [16] J.W. Grzymala-Busse, Three approaches to missing attribute values: a rough set perspective, Studies in Computational Intelligence , 118, 2008, 139-152.
• [17] M. Khan, M. Banerjee, Formal reasoning with rough sets in multiple-source approximation systems, International Journal of Approximate Reasoning, 49, 2008, 466-477.
• [18] H.L. Li, M.H. Chen, Induction of multiple criteria optimal classification rules for biological and medical data, Computers in Biology and Medicine, 38, 2008, 42-52.
• [19] J.F. Liu, Q.H. Hu, D.R. Yu, A weighted rough set based method developed for class imbalance learning, Information Sciences, 178, 2008, 1235-1256.
• [20] D. Liu, T.R. Li, D. Ruan, W.L. Zou, An incremental approach for inducing knowledge from dynamic information systems, Fundamenta Informaticae, 94, 2009, 245-260.
• [21] D. Liu, T.R. Li, D. Ruan, J.B. Zhang, Incremental learning optimization on knowledge discovery in dynamic business intelligent systems, Journal of Global Optimization, 51, 2011, 325-344.
• [22] C. Luo, T.R. Li, H.M. Chen, D. Liu, Incremental approaches for updating approximations in set-valued ordered information systems, Knowledge-Based Systems , 50, 2013, 218-233.
• [23] S.Y. Li, T.R. Li, D. Liu, Dynamic maintenance of approximations in dominance-based rough set approach under the variation of the object set, International Journal of Systems, 28, 2013, 729-751.
• [24] S.Y. Li, T.R. Li, D. Liu, Incremental updating approximations in dominance-based rough sets approach under the variation of the attribute set, Knowledge-Based systems, 40, 2013, 17-26.
• [25] D. Liu, D.C. Liang, Incremental learning researches on rough set theory: status and future, International Journal of Rough Sets and Data Analysis, 1, 2014, 99-112.
• [26] R. Michalski, Knowledge repair mechanisms: evolution vs. revolution, in: Proceedings of the Third International Workshop on Machine Learning, Skytop, PA, 1985, 116-119.
• [27] E. Orlowska, Dynamic information systems, Fundamenta Informaticae, 5, 1982, 101-118.
• [28] Z. Pawlak, Rough sets, International Journal of Computer and Information Science 11, 1982, 341-356.
• [29] Z. Pawlak, Rough set theory and its applications to data analysis, Cybernetics and Systems , 29, 1998, 661-688.
• [30] Z. Pawlak, A. Skowron, Rough sets: some extensions, Information Sciences , 177, 2007, 28-40.
• [31] P. Pagliani, Pretopologies and dynamic spaces, Fundamenta Informaticae, 59, 2004, 221-239.
• [32] W. Pedrycz, R. Weber, Special issue on soft computing for dynamic data mining, Applied Soft Computing 8(4), 2008, 1281-1282.
• [33] Y.H. Qian, J.Y. Liang, C.Y. Dang, Interval ordered information systems, Computers and Mathematics with Applications, 56, 2008, 1994-2009.
• [34] Y.H. Qian, C.Y. Dang, J.Y. Liang, D.W. Tang, Set-valued ordered information systems, Information Sciences , 176(16), 2009, 2809-2832.
• [35] W.H. Xu, X.Y. Zhang, W.X. Zhang, Knowledge granulation, knowledge entropy and knowledge uncertainty measure in ordered information systems, Applied Soft Computing, 9, 2009, 1244-1251.
• [36] W.H. Xu, X.Y. Zhang, J.M. Zhong, W.X. Zhang, Attribute reduction in ordered information systems based on evidence theory, Knowledge and Information Systems, 25, 2010, 169-184.
• [37] W.H. Xu, Yuan Li, X.W. Liao, Approaches to attribute reductions based on rough set and matrix computation in inconsistent ordered information systems, Knowledge-Based Systems, 27, 2012, 78-91.
• [38] W.H. Xu, Y.F. Liu, T.J. Li, Intuitionistic Fuzzy Ordered Information System, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 21(3), 2013, 367-390.
• [39] X.B. Yang, D.J. Yu, J.Y. Yang, L.H.Wei, Dominance-based rough set approach to incomplete interval-valued information system, Data & Knowledge Engineering, 68, 2009, 1331-1347.
• [40] X.B. Yang, Y. Qi, D.J. Yu, H.L. Yu, J.Y Yang, _-Dominance relation and rough sets in interval-valued information systems, Information Sciences,294, 2015, 334-347.
• [41] L.Y. Zhai, L.P. Khoo, Z.W. Zhong, A dominance-based rough set approach to Kansei engineering in product development, Expert Systems with Applications, 36, 2009, 393-402.
• [42] J.B. Zhang, T.R. Li, D. Ruan, D. Liu, Neighborhood rough sets for dynamic data mining, International Journal of Intelligence Systems, 27, 2012, 317-342.
• [43] J.B. Zhang, J.S. Wong, T.R. Li, Y. Pan, A comparison of parallel large-scale knowledge acquisition using rough set theory on different MapReduce runtime systems, International Journal of Approximate Reasoning, 55, 2014, 896-907.
• [44] Z. Zheng, G.Y. Wang, RRIA. A rough set and rule tree based incremental knowledge acquisition algorithm, textbf Fundamenta Informaticae 59, 2004, 299-313.