Similar articles

Abstract: Rough set theory plays an important role in knowledge discovery, but cannot deal with continuous attributes, thus discretization is a problem which we cannot neglect. And discretization of decision systems in rough set theory has some particular characteristics. Consistency must be satisfied and cuts for discretization is expected to be as small as possible. Consistent and minimal discretization problem is NP-complete. In this paper, an immune algorithm for the problem is proposed. The correctness and effectiveness were shown in experiments. The discretization method presented in this paper can also be used as a data pretreating step for other symbolic knowledge discovery or machine learning methods other than rough set theory.

[1] Chun, K.S., Jung, H.K., Yahn, S.Y., 1997. Shape optimization of electromagnetic devices using immune algorithm. IEEE Tran. Magnetics, 33(2):1876-1879.

[2] Chun, J.S., Jung, H.K., Yahn, S.Y., 1998. A study on comparison of optimizing performances between immune algorithm and other heuristic algorithms. IEEE Tran. Magnetics, 34(5):2972-2975.

[3] Dai, J.H., 2004a. A Genetic Algorithm for Discretization of Decision Systems. Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, IEEE Press, New Jersey, p.1319-1323.

[4] Dai, J.H., 2004b. Structure of Rough Approximations Based on Molecular Lattices. Proceedings of the 4th International Conference on Rough Sets and Current Trends in Computing (RSCTC2004), LNAI 3066. Uppsala, Sweden, p.69-77.

[5] Dai, J.H., 2005. Logic for Rough Sets with Rough Double Stone Algebraic Semantics. Proceedings of the Tenth International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005), LNAI 3641, Regina, Canada, p.141-148.

[6] Dai, J.H., Li, Y.X., 2002. Study on Discretization Based on Rough Set Theory. Proceedings of the First International Conference on Machine Learning and Cybernetics, IEEE Press, New Jersey, p.1371-1373.

[7] Dai, J.H., Chen, W.D., Pan, Y.H., 2004. A minimal axiom group of rough set based on quasi-ordering. Journal of Zhejiang University SCIENCE, 5(7):810-815.

[8] Nguyen, S.H., 1997. Discretization of Real Value Attributes: Boolean Reasoning Approach. Ph.D Thesis, Warsaw University, Poland.

[9] Nguyen, S.H., 1998. Discretization Problems for Rough Set Methods. In: Polkowski, L., Skowron, A.(Eds.), Proceedings of the First International Conference on Rough Sets and Current Trend in Computing (RSCTC’98), Lecture Notes on Artificial Intelligence, Springer-Verlag, Berlin, 1424:545-552.