Abstract
AbstractIn this paper, we introduce the concepts of j-ideal lower and j-ideal upper approximations as a generalization of approximation by Pawlak by using j-ideal open sets where j ∈ {α, S, P, γ, β, ⋀β}. Some of their basic properties with the aid of examples are proven. Furthermore, we study the relationships between these approximations to get the best of them.
Publisher
Springer Science and Business Media LLC
Reference34 articles.
1. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences. 11, 341–356 (1982)
2. Pawlak, Z.: Rough sets: theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)
3. Chmielewshi, M.R., Grzymala-Busse, J.W.: Global discretization of continuous attributes as preprocessing for machine learning. Int. J. Approx. Reason. 15(4), 319–331 (1966)
4. Ziarko, W.: The discovery, analysis, and representation of data dependencies in databases. In: Piatetsky-Shapiro, G., Frawley, W.G. (eds.) Knowledge Discovery in Databases, pp. 213–228. MIT Press, Cambridge, MA (1990)
5. Chan, C.C.: A rough set approach to attribute generalization in data mining. J. Inf. Sci. 107, 169–176 (1998)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献