Three-way decisions based on semi-three-way decision spaces

New constructions of decision evaluation functions in three-way decision spaces based on uninorms

In 2014, Hu introduced the concept of three-way decision spaces and axiomatic definition of decision evaluation functions. In three-way decision spaces, decision evaluation function satisfies minimum element axiom, monotonicity axiom and complement axiom. Since then, the research on construction method of decision evaluation functions from commonly used binary aggregation functions becomes a research hotspot. Meanwhile, uninorms, as one class of binary aggregation functions, have been successfully applied in various application problems, such as in decision making, image processing, data mining, etc. This paper continues to consider this research topic and mainly explores the new construction methods of decision evaluation functions based on uninorms. Firstly, we show two novel transformation methods from semi-decision evaluation functions to decision evaluation functions based on uninorms. Secondly, using known semi-decision evaluation functions, we give some new construction methods of semi-decision evaluation functions. Thirdly, we give some novel construction methods of decision evaluation functions and semi-decision evaluation functions related to fuzzy sets, interval-valued fuzzy sets, fuzzy relations and hesitant fuzzy sets. Based on them, decision maker can obtain more useful decision evaluation functions, thereby more choices can be used for realistic decision-making problems. Finally, we consider two real evaluation problems to illustrate the results obtained in this paper. The three-way decisions results of evaluation problem show that the construction method proposed in this paper is superior to some existing construction methods under some conditions.

A three-way decision method based on hybrid data1

An information system as a database that represents relationships between objects and attributes is an important mathematical model in the field of artificial intelligence. Hybrid data means boolean, categorical, real-valued, set-valued data and missing data in this paper. A hybrid information system is an information system where its attribute is hybrid data. This paper proposes a three-way decision method based on hybrid data. First, the distance between two objects based on the conditional attribute set in a given hybrid information system is developed and Gaussian kernel based on this distance is acquired. Then, the fuzzy Tcos-equivalence relation, induced by this information system, is obtained by using Gaussian kernel. Next, the decision-theoretic rough set model in this hybrid information system is presented. Moreover, a three-way decision method is given by means of this decision-theoretic rough set model and inclusion degree between two fuzzy sets. Finally, an example is employed to illustrate the feasibility of the proposed method, which may provide an effective method for hybrid data analysis in real applications.

Data-driven sequential three-way decisions for unlabeled information system

Based on the granular computing and three-way decisions theory, the sequential three-way decisions (S3WD) model implements the idea of progressive computing. However, almost S3WD models are established based on labeled information system, and there is still a lack of S3WD model for processing unlabeled information system (UIS). In this paper, to solve the issue of given accepted number for UIS, a data-driven sequential three-way decisions (DDS3WD) model is proposed. Firstly, from the perspective of similarity computed by TOPSIS, a general three-way decisions model for UIS based on decision risk is presented and its shortcomings are analyzed. Then, a concept of optimal density difference is defined to establish the DDS3WD model for UIS by updating attributes. Finally, the related experiments show that DDS3WD is feasible and effective for dealing with UIS under the condition of given accepted number of objects.

A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

The time resource management of phased-array radars is the key to fulfilling their performance, such as how phased-array radar can efficiently and reasonably schedule tasks under limited resources. Therefore, this paper proposes a task scheduling algorithm for phased-array radar based on dynamic three-way decision. The algorithm introduces three-way decision into the scheduling algorithm and divides the target into three threat areas according to the threat degree (i.e., threat area, nonthreat area, and potential threat area). Different threat domains are assigned different weights and combine the working mode and the task deadline to carry out comprehensive priority planning, so that the radar can reasonably allocate time according to the difference of the target threat level and the threat area in the tracking stage. In addition, an improved adaptive threshold algorithm is proposed to obtain a dynamic three-way decision to achieve the adaptation of the algorithm. A set of performance indicators have been defined to evaluate the algorithm. The relevant experiments have demonstrated that the proposed algorithm can effectively improve the processing capability of phased-array radars when dealing with high-threat targets.