A Rough Set Based Algebraic Approach to Modelling Complex Systems

A Rough Set Based Algebraic Approach to Modelling Complex Systems

D. Sitnikov O. Ryabov I. Mishcheriakov A. Kovalenko 

Kharkiv National University of Radio Electronics, Ukraine

National Institute of Advanced Industrial Science and Technology, Japan

Page: 
324-329
|
DOI: 
https://doi.org/10.2495/DNE-V13-N3-324-329
Received: 
N/A
| |
Accepted: 
N/A
| | Citation

OPEN ACCESS

Abstract: 

A complex system is considered as an algebraic structure having specific properties that do not allow expressing precisely the meaning of information objects included in the system. An algebraic definition of complexity has been given. the complexity has been considered from two viewpoints. A system can be considered to be a complex one if (a) boundary regions for system’s objects and processes are broad; (b) possibilities for system’s decompositions are limited. difficulties associated with complex system description and decomposition have been discussed in the framework of rough set methodology. A method for extracting salient features of information objects available in the system has been outlined. some theoretical aspects of rough set based analysis of complex systems have been discussed. All the operations designated to obtaining new knowledge or data patterns in complex systems are algebraically described from the viewpoint of algebraic systems including predicates (in particular, finite ones) and operations on them. thus, a system is considered to be complex if there is a great degree of uncertainty in the data and/or there are some serious problems with system’s decomposition.”

Keywords: 

big data, complex system, knowledge discovery, rough set, system decomposition, uncertainty in data

1. Introduction
2. Algebraic Approach Versus Knowledge Granularity Based Approach
3. Decomposition of a System. Measure of Complexity
4. Conclusions
  References

[1] Pawlak, Z., AI and intelligent industrial applications: the rough set perspective. Cybernetics and Systems, 31, pp. 227–252, 2000. https://doi.org/10.1080/019697200124801

[2] Sitnikov, D. & Ryabov, O., An algebraic approach to defining rough set approximations and generating logic rules. Data Mining V: Proc. 5th International Conference, Malaga, Spain, 2004, pp. 179–188, 2004.

[3] Sitnikov, D., Ryabov, O., Titova, E. & Romanenko, O., A generalized algebraic approach to finding rough set approximations and generating logic rules. Data Mining VIII: Proc. 8th International Conference, Great Britain, pp. 3–12, 2007.

[4] Sitnikov, D., Titova, E., Ryabov, O. & Romanenko, O., An approach to finding reduced sets of information features describing discrete objects based on rough sets theory. Data Mining IX: Proc. 9th International Conference, Spain, pp. 3–11, 2008.

[5] Sitnikov, D., Titova, E. & Ryabov, O., A method for finding minimal sets of features adequately describing discrete information objects. Data Mining X: Proc. 10th International Conference, Greece, pp. 22–30, 2009.