Rule acquisition of three-way semi-concept lattices in formal decision context

Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way semi-concept lattices have three-way operators with weaker constraints,which can generate more concepts.In this article,the problem of rule acquisition for three-way semi-concept lattices is discussed in general.The authors construct the finer relation of three-way semi-concept lattices,and propose a method of rule acquisition for three-way semi-concept lattices.The authors also discuss the set of decision rules and the relationships of decision rules among object-induced three-way semi-concept lattices,object-induced three-way concept lattices,classical concept lattices and semi-concept lattices.Finally,examples are provided to illustrate the validity of our conclusions.

Three-way group decision making with linguistic evaluations

Based on linguistic evaluations, a linguistic threeway decision method is proposed. First, the alternatives are rated in linguistic forms and divided into acceptance, rejection and uncertainty regions. Secondly, the linguistic three-way group decision steps are provided. Specifically, the experts determine the lower bound and upper bound of the uncertainty region, respectively. When the evaluation is superior to the upper bound, the corresponding alternative is put into the acceptance region directly. Similarly, when the evaluation is inferior to the lower bound, the corresponding alternative is put into the rejection region directly, and the remaining alternatives are put into the uncertain region. Moreover, the objects in the uncertainty region are especially discussed. The linguistic terms are transformed into fuzzy numbers and then aggregated. Finally, a recommendation example is provided to illustrate the practicality and validity of the proposed method.

An adaptive dwell time scheduling model for phased array radar based on three-way decision

Real-time resource allocation is crucial for phased array radar to undertake multi-task with limited resources,such as the situation of multi-target tracking,in which targets need to be prioritized so that resources can be allocated accordingly and effectively.A three-way decision-based model is proposed for adaptive scheduling of phased radar dwell time.Using the model,the threat posed by a target is measured by an evaluation function,and therefore,a target is assigned to one of the three possible decision regions,i.e.,positive region,negative region,and boundary region.A different region has a various priority in terms of resource demand,and as such,a different radar resource allocation decision is applied to each region to satisfy different tracking accuracies of multi-target.In addition,the dwell time scheduling model can be further optimized by implementing a strategy for determining a proper threshold of three-way decision making to optimize the thresholds adaptively in real-time.The advantages and the performance of the proposed model have been verified by experimental simulations with comparison to the traditional twoway decision model and the three-way decision model without threshold optimization.The experiential results demonstrate that the performance of the proposed model has a certain advantage in detecting high threat targets.

Optimal decision fusion given sensor rules

When all the rules of sensor decision are known, the optimal distributeddecision fusion, which relies only on the joint conditional probability densities, can be derivedfor very general decision systems. They include those systems with interdependent sensorobservations and any network structure. It is also valid for m-ary Bayesian decision problems andbinary problems under the Neyman-Pearson criterion. Local decision rules of a sensor withcommunication from other sensors that are optimal for the sensor itself are also presented, whichtake the form of a generalized likelihood ratio test. Numerical examples are given to reveal someinteresting phenomena that communication between sensors can improve performance of a senordecision, but cannot guarantee to improve the global fusion performance when sensor rules were givenbefore fusing.

Attributes reduct and decision rules optimization based on maximal tolerance classification in incomplete information systems with fuzzy decisions

A new approach to knowledge acquisition in incomplete information system with fuzzy decisions is proposed. In such incomplete information system, the universe of discourse is classified by the maximal tolerance classes, and fuzzy approximations are defined based on them. Three types of relative reducts of maximal tolerance classes are then proposed, and three types of fuzzy decision rules based on the proposed attribute description are defined. The judgment theorems and approximation discernibility functions with respect to them are presented to compute the relative reduct by using Boolean reasoning techniques, from which we can derive optimal fuzzy decision rules from the systems. At last, three types of relative reducts of the system and their computing methods are given.

Three-Way Behavioral Decision Making With Hesitant Fuzzy Information Systems:Survey and Challenges

Three-way decision(T-WD)theory is about thinking,problem solving,and computing in threes.Behavioral decision making(BDM)focuses on effective,cognitive,and social processes employed by humans for choosing the optimal object,of which prospect theory and regret theory are two widely used tools.The hesitant fuzzy set(HFS)captures a series of uncertainties when it is difficult to specify precise fuzzy membership grades.Guided by the principles of three-way decisions as thinking in threes and integrating these three topics together,this paper reviews and examines advances in three-way behavioral decision making(TW-BDM)with hesitant fuzzy information systems(HFIS)from the perspective of the past,present,and future.First,we provide a brief historical account of the three topics and present basic formulations.Second,we summarize the latest development trends and examine a number of basic issues,such as one-sidedness of reference points and subjective randomness for result values,and then report the results of a comparative analysis of existing methods.Finally,we point out key challenges and future research directions.

Rule Extraction in Transient Stability Study Using Linear Decision Trees

为了提高精细规则的性能,提出一种基于支持样本的线性决策树的规则提取方法。该方法筛选临近稳定边界的支持样本,作为决策树的输入样本,精简了样本数目;提出基于线性分类器的决策树方法,以得到基于组合属性的安全稳定运行规则。在单机无穷大系统和IEEE 39节点系统中的对比研究表明：由于考虑了支持样本的特殊性,用线性组合规则代替单属性规则,减少了计算时间,提高了泛化能力,丰富了规则的物理含义,得到的灵敏度信息可用于辅助决策,在安全稳定精细规则提取中具有应用潜力。

A New Rules Processing Method Based on Decision Tree in Machine Translation

This paper gives the representation of rules, the strategy of rule controlling and the existing problems in English Chinese Machine Translation(MT) named BT863 I. Then it puts forward a method for processing these rules based on the decision tree. With this method, some problems such as rule conflic and rule redundancy occurring in BT863 I have been solved and the efficiency of MT system has been improved greatly. This method also has general meaning in the Rule based expert system.

Mining Hierarchical Decision Rules from Hybrid Data with Categorical and Continuous Valued Attributes

Decision rules mining is an important issue in machine learning and data mining.However,most proposed algorithms mine categorical data at single level,and these rules are not easily understandable and really useful for users.Thus,a new approach to hierarchical decision rules mining is provided in this paper,in which similarity direction measure is introduced to deal with hybrid data.This approach can mine hierarchical decision rules by adjusting similarity measure parameters and the level of concept hierarchy trees.

Identification and Classification of Multiple Power Quality Disturbances Using a Parallel Algorithm and Decision Rules

A multiple power quality(MPQ)disturbance has two or more power quality(PQ)disturbances superimposed on a voltage signal.A compact and robust technique is required to identify and classify the MPQ disturbances.This manuscript investigated a hybrid algorithm which is designed using parallel processing of voltage with multiple power quality(MPQ)disturbance using stockwell transform(ST)and hilbert transform(HT).This will reduce the computational time to identify theMPQdisturbances,whichmakes the algorithm fast.A MPQ identification index(IPI)is computed using statistical features extracted from the voltage signal using the ST and HT.IPI has different patterns for various types of MPQ disturbances which effectively identify the MPQ disturbances.A MPQ time location index(IPL)is computed using the features extracted from the voltage signal using ST and HT.IPL effectively identifies the initiation and end of PQ disturbances and thereby locates the MPQ events with respect to time.Classification of MPQ disturbances is performed using decision rules in both the noise-free and noisy environments with a 20 dB noise to signal ratio(SNR).The performance of the proposed hybrid algorithm using ST and HT with rule-based decision tree(RBDT)is better compared to the ST and RBDT techniques in terms of accuracy of classification of MPQ disturbances.MATLAB software is used to perform the study.

The Decision Rules of Rough Set and its Application in Aquaculture

In this article,the basic theory of rough set is presented,followed by a new heuristics approach for rule reduction,and the procedure of rule mining in aquaculture is illuminated with an example.

Rough Control Rule Mining Model Based on Decision Interval Concept Lattice and Its Application

Fusing the structure feature of interval concept lattice and the actual needs of rough control rules,we have constructed the decision interval concept lattice,further more,we also have built a rules mining model of rough control based on decision interval concept lattice,in order to achieve the optimality between rough control mining cost and control efficiency.Firstly,we have preprocessed the collected original data,so that we can transform it into Boolean formal context form,and then we have constructed the decision interval concept lattice in rough control;secondly,we have established the control rules mining algorithm based on decision interval concept lattice.By analyzing and judging redundant rules,we have formed the rough control association rule base in end.Analysis shows that under the premise of improving the reliability of rules,we have achieved the rough control optimization goal between cost and efficiency.Finally,the model of reservoir scheduling has verified its feasibility and efficiency.

Extension of Paraconsistent Many-Valued Similarity Method to Group Decision

The Paraconsistent Many-Valued Similarity (PMVS) method for multi-attribute decision making will be incomplete as a decision model if it is not extended to the realm of group decision-making. Therefore, in this article, our primary objective is to show how the paraconsistent many-valued similarity method can be used to solve group decision-making problems involving choice making or ranking of a finite set of decision alternatives. Moreover, since weights are very important parameters in multi-attribute decision-making, we have introduced the Borda rule to calculate the weights of experts and that of every criterion under consideration. To demonstrate how the proposed method works, a numerical example on energy sources of an economy from the points of view of a group of experts is investigated. Further, we compare the results of this new approach with that of fuzzy TOPSIS group decision-making method to illustrate the robustness and effectiveness of the former.

Approach to stochastic multi-attribute decision problems using rough sets theory

Multi-attribute decision problems where the performances of the alternatives are random variables are considered. The suggested approach grades the probabilities of preference of one alternative over another with respect to the same attribute. Based on the graded probabilistic dominance relation, the pairwise comparison information table is defined. The global preferences of the decision maker can be seen as a rough binary relation. The present paper proposes to approximate this preference relation by means of the graded probabilistic dominance relation with respect to the subsets of attributes. At last, the method is illustrated by an example.

Tactical intention recognition of aerial target based on XGBoost decision tree

In order to improve the accuracy of target intent recognition,a recognition method based on XGBoost(eXtreme Gradient Boosting)decision tree is proposed.This paper adopts relevant data and program of python to calculate the probability of tactical intention.Then the sequence intention probability is obtained by applying Dempster-Shafer rule of combination.To verify the accuracy of recognition results,we compare the experimental results of this paper with the results in the literatures.The experiment shows that the probability of tactical intention recognition through this method is improved,so this method is feasible.

Intelligent Decisions Modeling for Energy Saving in Lifts:An Application for Kleemann Hellas Elevators

The present work proposes a methodological approach for modeling decisions regarding energy reduction in an elevator. This is achieved with the integration of existing as well as acquired knowledge, in a decision module implemented in the electronics of an elevator. So far, elevators do not exploit information regarding their recent usage. In the developed system decisions are driven based on information arising from monitoring the use of the elevator. Monitoring provides various records of usage which consequently are used to predict elevator’s future usage and to adapt accordingly its functioning. Till now, there are only elevators that encompass in their electronics algorithms with if then rules in order to control elevator’s functioning. However, these if then rules are based only on good practice knowledge of similar elevators installed in similar buildings. Even this knowledge which unavoidably is associated with uncertainty is not encoded in a mathematically consisted way in the algorithms. The design, the implementation and a first pilot evaluation study of an elevator’s intelligent decision module are presented. The study concludes that the presented application sufficiently reduces energy consumption through properly controlled functioning.

Improving Decision Tree Performance by Exception Handling

This paper focuses on improving decision tree induction algorithms when a kind of tie appears during the rule generation procedure for specific training datasets. The tie occurs when there are equal proportions of the target class outcome in the leaf node＇s records that leads to a situation where majority voting cannot be applied. To solve the above mentioned exception, we propose to base the prediction of the result on the naive Bayes （NB） estimate, k-nearest neighbour （k-NN） and association rule mining （ARM）. The other features used for splitting the parent nodes are also taken into consideration.

Application of Decision Tree Algorithm in Stamping Process

Various process parameters exert different effects in stamping process. In order to study the relationships among the process parameters of box stamping process, including the blank holder force, friction coefficient, depth of drawbead, offset and length of drawbead, the decision tree algorithm C4.5 was performed to generate the decision tree using the result data of the box stamping simulation. The design and improvement methods of the decision tree were presented. Potential and valuable rules were generated by traversing the decision tree, which plays an instructive role on the practical design. The rules show that the correct combination of blank holder force and setting of drawbead are the dominant contribution for controlling the cracking and wrinkling in box stamping process. In order to validate the rules, the stamping process for box was also performed. The experiment results show good agreement with the generated rules.

Automated soil resources mapping based on decision tree and Bayesian predictive modeling

This article presents two approaches for automated building of knowledge bases of soil resources mapping. These methods used decision tree and Bayesian predictive modeling, respectively to generate knowledge from training data. With these methods, building a knowledge base for automated soil mapping is easier than using the conventional knowledge acquisition approach. The knowledge bases built by these two methods were used by the knowledge classifier for soil type classification of the Longyou area, Zhejiang Province, China using TM bi-temporal imageries and GIS data. To evaluate the performance of the resultant knowledge bases, the classification results were compared to existing soil map based on field survey. The accuracy assessment and analysis of the resultant soil maps suggested that the knowledge bases built by these two methods were of good quality for mapping distribution model of soil classes over the study area.