×

Topological approaches to covering rough sets. (English) Zbl 1109.68121

Summary: Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the topological properties of this type of rough sets, study the interdependency between the lower and the upper approximation operations, and establish the conditions under which two coverings generate the same lower approximation operation and the same upper approximation operation. Lastly, axiomatic systems for the lower approximation operation and the upper approximation operation are constructed.

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Allam, A.; Bakeir, M.; Abo-Tabl, E., New approach for basic rough set concepts, (), 64-73 · Zbl 1134.68521
[2] Angiulli, F.; Pizzuti, C., Outlier mining in large high-dimensional data sets, IEEE transactions on knowledge and data engineering, 17, 2, 203-215, (2005)
[3] Dong, G.; Han, J.; Lam, J.; Pei, J.; Wang, K.; Zou, W., Mining constrained gradients in large databases, IEEE transactions on knowledge and data engineering, 16, 8, 922-938, (2004)
[4] Hall, M.; Holmes, G., Benchmarking attribute selection techniques for discrete class data mining, IEEE transactions on knowledge and data engineering, 15, 6, 1437-1447, (2003)
[5] Hu, F.; Wang, G.; Huang, H., Incremental attribute reduction based on elementary sets, (), 185-193 · Zbl 1134.68471
[6] Jensen, R.; Shen, Q., Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches, IEEE transactions on knowledge and data engineering, 16, 12, 1457-1471, (2004)
[7] Kryszkiewicz, M., Rough set approach to incomplete information systems, Information sciences, 112, 39-49, (1998) · Zbl 0951.68548
[8] Kryszkiewicz, M., Rule in incomplete information systems, Information sciences, 113, 271-292, (1998) · Zbl 0948.68214
[9] Lashin, E.; Kozae, A.; Khadra, A.A.; Medhat, T., Rough set theory for topological spaces, International journal of approximate reasoning, 40, 1-2, 35-43, (2005) · Zbl 1099.68113
[10] W.J. Liu, Topological space properties of rough sets, in: Proceedings of the Third International Conference on Machine Learning and Cybernetics, 2004, pp. 26-29.
[11] Lin, T.Y.; Liu, Q., Rough approximate operators: axiomatic rough set theory, (), 256-260 · Zbl 0818.03028
[12] Pal, S.; Mitra, P., Case generation using rough sets with fuzzy representation, IEEE transactions on knowledge and data engineering, 16, 3, 292-300, (2004)
[13] Pawlak, Z., Rough sets: theoretical aspects of reasoning about data, (1991), Kluwer Academic Publishers Boston · Zbl 0758.68054
[14] Pawlak, Z., Rough sets, International journal of computer and information sciences, 11, 341-356, (1982) · Zbl 0501.68053
[15] ()
[16] ()
[17] ()
[18] Pomykala, J.A., Approximation operations in approximation space, Bulletin of Polish Academic science, 35, 9-10, 653-662, (1987) · Zbl 0642.54002
[19] Slowinski, R.; Vanderpooten, D., A generalized definition of rough approximations based on similarity, IEEE transactions on knowledge and data engineering, 12, 2, 331-336, (2000)
[20] Skowron, A., On topology in information system, Bulletin of Polish Academic science and mathematics, 36, 477-480, (1988)
[21] Su, C.; Hsu, J., An extended chi2 algorithm for discretization of real value attributes, IEEE transactions on knowledge and data engineering, 17, 3, 437-441, (2005)
[22] Wang, F.Y., Outline of a computational theory for linguistic dynamic systems: toward computing with words, International journal of intelligent control and systems, 2, 2, 211-224, (1998)
[23] Wang, F.Y., On the abstraction of conventional dynamic systems: from numerical analysis to linguistic analysis, Information sciences, 171, 233-259, (2005) · Zbl 1068.93010
[24] Yao, Y., Two views of the theory of rough sets in finite universes, International journal of approximate reasoning, 15, 291-317, (1996) · Zbl 0935.03063
[25] Yao, Y., Relational interpretations of neighborhood operators and rough set approximation operators, Information sciences, 101, 239-259, (1998) · Zbl 0949.68144
[26] Yao, Y., Constructive and algebraic methods of theory of rough sets, Information sciences, 109, 21-47, (1998) · Zbl 0934.03071
[27] Zadeh, L., Fuzzy sets, Information and control, 8, 338-353, (1965) · Zbl 0139.24606
[28] Zadeh, L., The concept of a linguistic variable and its application to approximate reasoning - I, Information sciences, 8, 199-249, (1975) · Zbl 0397.68071
[29] Zadeh, L., The concept of a linguistic variable and its application to approximate reasoning - II, Information sciences, 8, 301-357, (1975) · Zbl 0404.68074
[30] Zadeh, L., The concept of a linguistic variable and its application to approximate reasoning - III, Information sciences, 9, 43-80, (1975) · Zbl 0404.68075
[31] Zadeh, L., Fuzzy logic=computing with words, IEEE transactions on fuzzy systems, 4, 103-111, (1996)
[32] Zhong, N.; Yao, Y.; Ohshima, M., Peculiarity oriented multidatabase mining, IEEE transactions on knowledge and data engineering, 15, 4, 952-960, (2003)
[33] F. Zhu, On covering generalized rough sets, Master’s thesis, The University of Arizona, Tucson, AZ, USA, May 2002.
[34] Zhu, W.; Wang, F.Y., Reduction and axiomization of covering generalized rough sets, Information sciences, 152, 217-230, (2003) · Zbl 1069.68613
[35] Zhu, F.; He, H.C., The axiomization of the rough set, Chinese journal of computers, 23, 3, 330-333, (2000)
[36] Zhu, F.; He, H.C., Logical properties of rough sets, (), 670-671
[37] W. Zhu, F.Y. Wang, Relationships among three types of covering rough sets, in: IEEE GrC 2006, Atlanta, USA, 12-14 May 2006, pp. 43-48.
[38] W. Zhu, F.Y. Wang, A new type of covering rough sets, in: IEEE IS 2006, 4-6 September, University of Westminster, London, UK.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.