Rough-Set-Based Decision Model for Incomplete Information Systems

Rough-Set-Based Decision Model for Incomplete Information Systems

DOI: 10.4018/978-1-5225-7362-3.ch056
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Databases use the data and evaluate managerial decisions in the process of data mining, and it has become imperative that we give the name of the emergence of the field. The rough set is a concept derived from the fuzzy logic approach to carry out the analysis of structures with uncertain data mining techniques. The decision will be developed in conjunction with computerized decision support model, giving more efficient automation systems with cuckoo search algorithm that are targeted. The suggested decision support system covers the inputs, user knowledge and expertise, outputs, and decision components. In addition, data access, interactive mode, adaptability, and flexible mode provides solutions and decision-making process for certain and uncertain data with suggested rough-set-based algorithm structure.
Chapter Preview
Top

Background

Rough set theory is an extension of set theory which proposed by Pawlak (1991) for describe and classify the incomplete or insufficient information. Besides it is mathematical tool that overcome the uncertainties and doubts. Also it verifies logic, and allows inconsistent data and no certainty to the discovery of incomplete implications. It is made ​​as incomplete, inadequate and vague information by organizing. Rough set organizes the suitable data for analysis.

In real-world applications may includes the some uncertain and incomplete attributes in the knowledge representation systems in dynamic situation, for this reason knowledge discovery and processing is very important for decision system. Meanwhile it is supported as a framework for conceptualizing and analyzing certain and uncertain types of data that is a powerful tool for discovering patterns with upper and lower approximations. Some of the studies used the rough set theory with minimum vertex cover problem (Chen et al.2015; Chen et al.2016); interval-valued information systems (Leung et al. 2008); intuitionistic fuzzy sets (Zhang et al. 2016; Huang et al, 2016) for knowledge discovery in feature selection (Huang et al. 2016) and rule induction (Lin et al. 2015). Shu & Qian (2015) and Yao & Zhao (2008) used the rough set theory for attribute reduction in pre-processing of the data mining and knowledge discovery. Macia-Perez et al. (2015) proposed the formal expansion of the rough set theory based algorithm for detection of the abnormal behaviour in outlier.

Key Terms in this Chapter

Decision Support System: It is computer based information system that support decision making activities with inputs, user knowledge and expertise, outputs and decision components.

Sensitivity analysis: Analysis of the uncertainty output in system is evaluated by the different certain or uncertain input.

Rough Set Theory: It is first described by Zdzislaw I. Pawlak in early 1980’s. Every object of the universe of discourse some information (data, knowledge) is associated with lower and upper approximation.

Information System: It consists of objects and attributes that shown in table with rows-objects and columns-attributes.

Decision Rules: It determines decision with rules under certain and uncertain conditions.

Rough Relations: Collection of such relations is closed under different binary compositions such as, algebraic sum, algebraic product etc. for uncertainty and incomplete data.

Indiscernibility Relation: It is a central concept of Rough Set Theory which relates between two or more objects identical relation in subset of the attributes.

Incomplete Information: Three types of incomplete data consists of attribute values which are lost values; attribute missing values; irrelevant concept data in attribute.

Alternative Set Theory: It means system set theory that related the positive set theory and constructive set theory.

Attribute: Refers with decision table in rough set which is divided into two disjoint groups called condition and decision attributes (action, results, outcome, etc.).

Cuckoo Search Algorithm: A method of global optimization based on the behaviour of cuckoos was proposed by Yang & Deb (2009) . The breeding behaviour types are, laid their eggs in the host nests; if not detected and destroyed, the eggs are hatched to chicks by the hosts.

Complete Chapter List

Search this Book:
Reset