Fuzzy multiple attribute decision-making model for synergic knowledge innovation in supply chain

The procedure of supply chain development is the process of continuously congregating knowledge and transforming knowledge.First,the precondition of synergic knowledge innovation in the supply chain is narrated.Then the characteristics of synergic knowledge innovation in the supply chain are analyzed,including complexity,accumulating and evolving process,and the cooperation of members and network integration.Due to the characteristics of multi-factors and uncertainties of the supply chain system,the fuzzy multi-attribution group decision-making model is introduced to solve the involved problem of synergic knowledge innovation in the supply chain.After elaborating on steps of using the fuzzy multiple attribute decision-making(MADM)model,the procedure of decision making for synergic knowledge innovation in the supply chain is explained from an example in the application of a fuzzy MADM model.The fuzzy MADM model,which amalgamates intuition and resolution decision-making can effectively improve the rationality of decision-making for synergic knowledge innovation in the supply chain.

Cotangent Similarity Measure of Consistent Neutrosophic Sets and Application to Multiple Attribute Decision-Making Problems in Neutrosophic Multi-Valued Setting

A neutrosophic multi-valued set(NMVS)is a crucial representation for true,false,and indeterminate multivalued information.Then,a consistent single-valued neutrosophic set(CSVNS)can effectively reflect the mean and consistency degree of true,false,and indeterminate multi-valued sequences and solve the operational issues between different multi-valued sequence lengths in NMVS.However,there has been no research on consistent single-valued neutrosophic similarity measures in the existing literature.This paper proposes cotangent similarity measures and weighted cotangent similarity measures between CSVNSs based on cotangent function in the neutrosophic multi-valued setting.The cosine similarity measures showthe cosine of the angle between two vectors projected into amultidimensional space,rather than their distance.The cotangent similaritymeasures in this study can alleviate several shortcomings of cosine similarity measures in vector space to a certain extent.Then,a decisionmaking approach is presented in viewof the established cotangent similarity measures in the case of NMVSs.Finally,the developed decision-making approach is applied to selection problems of potential cars.The proposed approach has obtained two different results,which have the same sort sequence as the compared literature.The decision results prove its validity and effectiveness.Meantime,it also provides a new manner for neutrosophic multi-valued decision-making issues.

Method for multiple attribute decision making based on incomplete linguistic judgment matrix

With respect to the multiple attribute decision making problems with linguistic preference relations on alternatives in the form of incomplete linguistic judgment matrix, a method is proposed to analyze the decision problem. The incomplete linguistic judgment matrix is transformed into incomplete fuzzy judgment matrix and an optimization model is developed on the basis of incomplete fuzzy judgment matrix provided by the decision maker and the decision matrix to determine attribute weights by Lagrange multiplier method. Then the overall values of all alternatives are calculated to rank them. A numerical example is given to illustrate the feasibility and practicality of the proposed method.

Attribute Reduction in Decision Systems Based on Relation Matrix

This paper proposes,from the viewpoint of relation matrix,a new algorithm of attribute reduction for decision systems.Two new and relative reasonable indices are first defined to measure significance of the attributes in decision systems and then a heuristic algorithm of attribute reduction is formulated.Moreover,the time complexity of the algorithm is analyzed and it is proved to be complete.Some numerical experiments are also conducted to access the performance of the presented algorithm and the results demonstrate that it is not only effective but also efficient.

Entropy-based procedures for intuitionistic fuzzy multiple attribute decision making

The class of multiple attribute decision making （MADM） problems is studied, where the attribute values are intuitionistic fuzzy numbers, and the information about attribute weights is completely unknown. A score function is first used to calculate the score of each attribute value and a score matrix is constructed, and then it is transformed into a normalized score matrix. Based on the normalized score matrix, an entropy-based procedure is proposed to derive attribute weights. Furthermore, the additive weighted averaging operator is utilized to fuse all the normalized scores into the overall scores of alternatives, by which the ranking of all the given alternatives is obtained. This paper is concluded by extending the above results to interval-valued intuitionistic fuzzy set theory, and an illustrative example is also provided.

Group decision-making method based on entropy and experts cluster analysis

According to the aggregation method of experts＇ evaluation information in group decision-making,the existing methods of determining experts＇ weights based on cluster analysis take into account the expert＇s preferences and the consistency of expert＇s collating vectors,but they lack of the measure of information similarity.So it may occur that although the collating vector is similar to the group consensus,information uncertainty is great of a certain expert.However,it is clustered to a larger group and given a high weight.For this,a new aggregation method based on entropy and cluster analysis in group decision-making process is provided,in which the collating vectors are classified with information similarity coefficient,and the experts＇ weights are determined according to the result of classification,the entropy of collating vectors and the judgment matrix consistency.Finally,a numerical example shows that the method is feasible and effective.

A multi-objective decision-making method for the treatment scheme of landslide hazard

The treatment engineering of landslide hazard is a complicated systemengineering. The selecting treatment scheme is influenced by many factors such as technology,economics, environment, and risk. The decision-making of treatment schemes of landslide hazard is aproblem of comprehensive judgment with multi-hierarchy and multi-objective. The traditional analysishierarchy process needs identity test. The traditional analysis hierarchy process is improved bymeans of optimal transfer matrix here. An improved hierarchy decision-making model for the treatmentof landslide hazard is set up. The judgment matrix obtained by the method can naturally meet therequirement of identity, so the identity test is not necessary. At last, the method is applied tothe treatment decision-making of the dangerous rock mass at the Slate Mountain, and its applicationis discussed in detail.

An improved reduction algorithm based on the degree of attribute discernibility

This paper deals with the problem of attribute discernibility reduction and proposes some new concepts to rough set theory （RST） based on the discernibility matrix of Skowron, such as secondary core, regeneration matrix and the degree of attribute discernibility （DAD）. This paper puts forward an attribute reduction algorithm based on maximum discernibility degree, which opens up an effective way of gaining minimum attribute reduction of decision table. The efficacy of this algorithm has been verified by practical application in a diagnostic system of loader, which substantially decreases information gathering requirement and lowers the overall cost with no loss of accuracy.

Attribute reduction algorithm based on discernibility for decision table

The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which reduces efficiency of algorithms. In this paper, the relationship between attribute discernible matrix and its discernibility is first established for general information systems. Based on the idea that the equivalent discernible matrix has a same attribute reduction, existing matrices are modified and a formula of attribute discernibility associated with algebraic reduction for decision table is proposed. A heuristic attribute reduction algorithm based on attribute discernibility is presented. Experimental results indicate that the algorithm can more easily explore an optimal or sub-optimal reduction, and is efficient.

Aczel-Alsina Weighted Aggregation Operators of Simplified Neutrosophic Numbers and Its Application in Multiple Attribute Decision Making

The simplified neutrosophic number(SNN)can represent uncertain,imprecise,incomplete,and inconsistent information that exists in scientific,technological,and engineering fields.Hence,it is a useful tool for describing truth,falsity,and indeterminacy information in multiple attribute decision-making(MADM)problems.To suit decision makers’preference selection,the operational flexibility of aggregation operators shows its importance in dealing with the flexible decision-making problems in the SNN environment.To solve this problem,this paper develops the Aczel-Alsina aggregation operators of SNNs for MADM problems in view of the Aczel-Alsina operational flexibility.First,we define the Aczel-Alsina operations of SNNs.Then,the Aczel-Alsina aggregation operators of SNNs are presented based on the defined Aczel-Alsina operations of SNNs.Next,a MADM method is established using the proposed aggregation operators under the SNN environment.Lastly,an illustrative example about slope treatment scheme choices is provided to indicate the practicality and efficiency of the established method.By comparison with the existing relative MADM methods,the results show that the established MADM method can overcome the insufficiency of decision flexibility in the existing MADM methods and demonstrate the metric of flexible decision-making.

On the Matrices of Pairwise Frequencies of Categorical Attributes for Objects Classification

This paper proposes two new algorithms for classifying objects with categorical attributes. These algorithms are derived from the assumption that the attributes of different object classes have different probability distributions. One algorithm classifies objects based on the distribution of the attribute frequencies, and the other classifies objects based on the distribution of the pairwise attribute frequencies described using a matrix of pairwise frequencies. Both algorithms are based on the method of invariants, which offers the simplest dependencies for estimating the probabilities of objects in each class by an average frequency of their attributes. The estimated object class corresponds to the maximum probability. This method reflects the sensory process models of animals and is aimed at recognizing an object class by searching for a prototype in information accumulated in the brain. Because these matrices may be sparse, the solution cannot be determined for some objects. For these objects, an analog of the k-nearest neighbors method is provided in which for each attribute value, the class to which the majority of the k-nearest objects in the training sample belong is determined, and the most likely class value is calculated. The efficiencies of these two algorithms were confirmed on five databases.

Group training on the improvement of college students'career decision-making self-efficacy

A group training was conducted on 17 college students to improve their career decision-making self-efficacy (CDMSE). The result showed that there was significant difference between the pre-test and the post-test for the experimental group (n = 17), whereas no significant difference was found between the pre-test and the post- test for the control group (n = 17). In the pre-test, there was no significant difference between the experimental group and the control group, and obvious difference between the two groups was found in the post-test. This indicated that the group training was effective on improving the CDMSE of the college students whose scores of CDMSE were below 27% point of the total students.

Improved Fuzzification Method for Multi-Objective Decision-Making and Its Application in Evaluation of Highway Planning

A new fuzzification method for multi-objective decision-making and selective sorting is proposed on the basis of the fuzzy consistent relation, and the specific algorithm is presented. The method is applied to the evaluation of highway planning of Zhanjiang city. To decrease the subjectivity in the process of decision-making, the LOWA operator is introduced, and a discussion on how to select appropriate weights involved in multi-objective sorting is made. It is concluded that it is feasible to apply the fuzzy consistent relation to multi-objective decision-making analysis, and the improved fuzzication method is workable.

认知诊断评估中Q矩阵理论及应用

Q矩阵是认知心理学与心理计量学结合的重要载体,Q矩阵在认知诊断中发挥着十分重要的作用。Q矩阵理论和应用研究近年来取得了重要进展。众多研究者从结构化到非结构化、属性二值到多值、简单到复杂模型、独立到一般结构、0-1到多级评分方面不断深入和拓展Q矩阵理论。Q矩阵理论也广泛应用于测验构念效度评价、计算机化自适应测验选题策略设计、Q矩阵学习和标定、认知诊断测验组卷等。与模型无关的Q矩阵理论和适合特定认知诊断模型下Q矩阵理论,以及最新Q矩阵理论的应用都值得深入研究。

基于重要性分数的CUR矩阵分解识别WSN异常节点

现有异常节点识别方法普遍存在精度低或者功耗大等不足,针对这些不足,提出一种基于低秩矩阵分解的无线传感器网络异常节点识别算法。根据传感器节点的特性进行特征选取和属性矩阵构建;通过改进的CUR矩阵分解方法计算异常矩阵;依据异常矩阵中节点向量的总体均值和标准差设定控制限,判断节点是否发生异常。实验结果表明,与其它异常识别方法相比,该方法具有较高的识别准确率。

基于分布可辨矩阵的属性重要性度量

针对目标信息系统中属性重要性度量问题,给出一种新的计算方法.首先,在分布可辨识属性矩阵基础上对条件属性集进行分布约简.然后,根据变精度粗糙集模型中下近似集定义,给出属性重要性度量公式.最后,对于给定的阈值β,分别计算分布约简属性集中各属性的重要度.实例分析表明该方法的有效性和可行性.

企业智能会计信息系统研究与设计——基于改进的Apriori算法和属性归纳学习算法

随着人工智能技术的发展,智能化会计核算系统成为会计发展的趋势。本文研究了会计核算智能化,重点在于实现学习和推理功能。采用机器学习算法,基于改进的关联规则挖掘算法(Apriori)和属性归纳学习算法,探索会计核算智能解决方案,促进会计人员的角色转变。本文结合会计实务流程,设计了智能会计核算系统,并实现了学习、推理和智能判断功能,为会计智能化研究与实践开辟了新途径。

基于属性值变化的动态三支冲突分析

冲突分析有利于信息系统的问题处理。为了促进相关动态学习,将冲突分析模型推广到动态形式信息系统中,并结合三支决策思想研究基于属性值变化的动态三支冲突分析。首先,考虑单行属性值变化,研究距离矩阵的变化,得到关于冲突集、中立集、联合集的三支分析模型的变化结果。其次,类似考虑多行属性值变化,得到对应的三支分析模型的变化规律,并由此设计相关的动态更新算法。进而,针对列属性值变化,基于形式信息系统来转换成行属性值变化,从而调用行值动态更新方法。最后,实例分析说明了所得动态三支冲突分析的性质与算法的有效性。

基于测试代价的三支邻域属性约简算法

针对粗糙集属性约简时很少考虑属性自身的测试代价等问题,提出了一种基于测试代价的三支邻域属性约简算法。算法根据各属性在邻域分辨矩阵中出现的频次和比例来计算属性重要性,并结合属性自身的测试代价来构造性价比指标,以此指导属性的甄选。三支决策方法被用于划分属性集,为属性的约简处理提供数据支撑。在7个UCI公共数据集上进行对比实验,结果表明,该算法可得到比对比算法更小的属性约简集合,在分类精度不降低的情况下,该算法具有更少的运行时间和更小的测试代价。基于财政收入的预测应用实例进一步证明了所提算法的有效性和实用性。

基于依赖空间的对象导出三支概念格的属性约简

在给定形式背景下,基于依赖空间提出了对象导出三支概念格属性约简的新定义,在此基础上讨论了属性约简方法。首先,借助三支算子定义了对象幂集上的一致关系,引入依赖空间。通过依赖空间生成闭包算子的闭元素,研究了闭元素和对象导出三支概念的外延之间的关系。其次,提出基于依赖空间的对象导出三支概念格属性约简的定义,该定义下的约简集是保持由原属性集确定的一致关系不变的最小属性子集。最后,给出协调集的判定定理,利用可辨识属性矩阵及辨识函数给出对象导出三支概念格的属性约简方法。