Journals / Bilişim Teknolojileri Dergisi / 2017 / Cilt: 10 - Sayı: 2

Attribute Reduction in Stochastic Information Systems Based on α-Dominance

Pages
211–219
Publication Date
2017-04-28
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Also this research proposes many research fields and new application areas show a tendency to concerning rough set approach to stochastic information systems.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Öz Rough set has been commonly taken part in literature to examine inadequate and incomplete information systems.
📊
Key Findings & Data:Furthermore, attribute reduction methods are studied by considering discernibility matrix and this approach is applied to explanatory examples to demonstrate its validity.
💡
Conclusion & Impact:Also this research proposes many research fields and new application areas show a tendency to concerning rough set approach to stochastic information systems.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Anahtar Kelimeler Rough Sets · Stochastic Information Systems · Attribute Reduction

Özet

Öz Rough set has been commonly taken part in literature to examine inadequate and incomplete information systems. The efficiency of rough set with stochastic data observed for developing convenience and scalability. In this study, we use a ranking approach for attribute reduction in stochastic information systems and generalized this via presenting a dominance relation. We obtained the rough set approach of attribute reduction in stochastic information systems by establishing the dominance degrees. Furthermore, attribute reduction methods are studied by considering discernibility matrix and this approach is applied to explanatory examples to demonstrate its validity. Also this research proposes many research fields and new application areas show a tendency to concerning rough set approach to stochastic information systems.

🔖

Cite This Article

AYDOĞAN, E. K., ÖZMEN, M. (2017). Attribute Reduction in Stochastic Information Systems Based on α-Dominance. Bilişim Teknolojileri Dergisi, Cilt: 10 - Sayı: 2, 211–219. https://ajindex.com/articles/251901

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. . Pawlak, Z. (1982). Rough sets. International Journal of Computer & Information Sciences, 11(5), 341-356. [2]. Skowron, A., & Pawlak, Z. (2007). Rough sets: Some extensions. Information Sciences, 177(1), 28-40. [3]. Pawlak, Z. (1991). Rough sets: theoretical aspects of reasoning about data, system theory, Knowledge Engineering and Problem Solving, vol. 9. [4]. Hu, Q., Yu, D., Liu, J., & Wu, C. (2008). Neighborhood rough set based heterogeneous feature subset selection. Information sciences, 178(18), 3577-3594. [5]. Li, T., Ruan, D., Geert, W., Song, J., & Xu, Y. (2007). A rough sets based characteristic relation approach for dynamic attribute generalization in data mining. Knowledge-Based Systems, 20(5), 485-494. [6]. Qian, Y., Liang, J., Pedrycz, W., & Dang, C. (2010). Positive approximation: an accelerator for attribute reduction in rough set theory. Artificial Intelligence, 174(9), 597-618. [7]. Zhang, J., Li, T., Ruan, D., Gao, Z., & Zhao, C. (2012). A parallel method for computing rough set approximations. Information Sciences, 194, 209-223. [8]. Zhang, J., Li, T., Ruan, D., & Liu, D. (2012). Neighborhood rough sets for dynamic data mining. International Journal of Intelligent Systems, 27(4), 317-342. [9]. Guan, J. W., & Bell, D. A. (1998). Rough computational methods for information systems. Artificial intelligence, 105(1), 77-103. [10]. Qian, Y., Liang, J., & Dang, C. (2008). Converse approximation and rule extraction from decision tables in rough set theory. Computers & Mathematics with Applications, 55(8), 1754-1765. [11]. Greco, S., Matarazzo, B., & Slowinski, R. (1998, June). A new rough set approach to multicriteria and multiattribute classification. In Rough sets and current trends in computing (pp. 60-67). Springer Berlin Heidelberg. [12]. Greco, S., Matarazzo, B., & Slowinski, R. (2001). Rough sets theory for multicriteria decision analysis. European journal of operational research, 129(1), 1-47. [13]. Greco, S., Matarazzo, B., & Slowinski, R. (2002). Rough sets methodology for sorting problems in presence of multiple attributes and criteria. European journal of operational research, 138(2), 247-259. [14]. Greco, S., Matarazzo, B., Slowinski, R., & Stefanowski, J. (2000, October). An algorithm for induction of decision rules consistent with the dominance principle. In Rough sets and current trends in computing (pp. 304-313). Springer Berlin Heidelberg. [15]. Dembczyński, K., Pindur, R., & Susmaga, R. (2003). Generation of exhaustive set