Modeling rough granular computing based on approximation spaces

详细信息    查看全文

• 作者：Andrzej Skowron^a ;   ; ^{skowron@mimuw.edu.pl} ; Jarosł ; aw Stepaniuk^b ;   ; ^{j.stepaniuk@pb.edu.pl} ; Roman Swiniarski^c ;   ; ^d ;   ; ^{rswiniar@sciences.sdsu.edu}
• 关键词：Rough sets ; Approximation spaces ; Granular computing ; Concept ; Interactions ; Data models
• 刊名：Information Sciences
• 出版年：2012
• 出版时间：1 February 2012
• 年：2012
• 卷：184
• 期：1
• 页码：20-43
• 全文大小：538 K

文摘

The results reported in this paper create a step toward the rough set-based foundations of data mining and machine learning. The approach is based on calculi of approximation spaces. In this paper, we present the summarization and extension of our results obtained since 2003 when we started investigations on foundations of approximation of partially defined concepts (see, e.g., ). We discuss some important issues for modeling granular computations aimed at inducing compound granules relevant for solving problems such as approximation of complex concepts or selecting relevant actions (plans) for reaching target goals. The problems discussed in this article are crucial for building computer systems that assist researchers in scientific discoveries in many areas such as biology. In this paper, we present foundations for modeling of granular computations inside of system that is based on granules called approximation spaces. Our approach is based on the rough set approach introduced by Pawlak . Approximation spaces are fundamental granules used in searching for relevant complex granules called as data models, e.g., approximations of complex concepts, functions or relations. In particular, we discuss some issues that are related to generalizations of the approximation space introduced in . We present examples of rough set-based strategies for the extension of approximation spaces from samples of objects onto a whole universe of objects. This makes it possible to present foundations for inducing data models such as approximations of concepts or classifications analogous to the approaches for inducing different types of classifiers known in machine learning and data mining. Searching for relevant approximation spaces and data models are formulated as complex optimization problems. The proposed interactive, granular computing systems should be equipped with efficient heuristics that support searching for (semi-)optimal granules.