Emergent rough set data analysis

Abstract

Many systems in nature produce complicated behaviors, which emerge from the local interactions of relatively simple individual components that live in some spatially extended world. Notably, this type of emergent behavior formation often occurs without the existence of a central control. The rough set concept is a new mathematical approach to imprecision, vagueness and uncertainty. This paper introduces the emergent computational paradigm and discusses its applicability and potential in rough sets theory. In emergence algorithm, the overall system dynamics emerge from the local interactions of independent objects or agents. For accepting a system is displaying an emergent behavior, the system should be constructed by describing local elementary interactions between components in different ways than those used in describing global behavior and properties of the running system over a period of time. The proposals of an emergent computation structure for implementing basic rough sets theory operators are also given in this paper. © Springer-Verlag 2004.