2,979 publications from this institution
Probabilistic dual hesitant fuzzy sets (PDHFSs) are sound information granules to describe decision maker's aleatory and epistemic uncertainty in multiple criteria group decision making (MCGDM) process. In this paper, a bivariate almost stochastic dominance-based PROMETHEE-II method is presented to solve probabilistic dual hesitant fuzzy MCGDM problems which consider correlation averse behavior of decision makers. First, probabilistic dual hesitant fuzzy power Bonferroni mean (PDHFPBM) operator and probabilistic dual hesitant fuzzy power geometric Bonferroni mean (PDHFPGBM) operator are proposed to acquire collective preference information of decision makers. Second, based on the defined bivariate almost stochastic dominance (BASD) and BASD degree, qualitative and quantitative relationships between two probabilistic dual hesitant fuzzy elements (PDHFEs) with corresponding to all criteria are obtained. Third, distance-based correlation coefficient method for computing combined weight with respect to all criteria is proposed. Finally, a BASD-based PROMETHEE-II method is developed to determine the ranking results. Three illustrative examples followed by comparative analysis are included to show the practicality and effectiveness of the proposed method.
The one-class classification problem is a well-known research endeavor in pattern recognition. The problem is also known under different names, such as outlier and novelty/anomaly detection. The core of the problem consists in modeling and recognizing patterns belonging only to a so-called target class. All other patterns are termed nontarget, and therefore, they should be recognized as such. In this paper, we propose a novel one-class classification system that is based on an interplay of different techniques. Primarily, we follow a dissimilarity representation-based approach; we embed the input data into the dissimilarity space (DS) by means of an appropriate parametric dissimilarity measure. This step allows us to process virtually any type of data. The dissimilarity vectors are then represented by weighted Euclidean graphs, which we use to determine the entropy of the data distribution in the DS and at the same time to derive effective decision regions that are modeled as clusters of vertices. Since the dissimilarity measure for the input data is parametric, we optimize its parameters by means of a global optimization scheme, which considers both mesoscopic and structural characteristics of the data represented through the graphs. The proposed one-class classifier is designed to provide both hard (Boolean) and soft decisions about the recognition of test patterns, allowing an accurate description of the classification process. We evaluate the performance of the system on different benchmarking data sets, containing either feature-based or structured patterns. Experimental results demonstrate the effectiveness of the proposed technique.
In this chapter, we discuss a novel approach to pattern classification using a concept of fuzzy Petri nets. In contrast to the commonly encountered Petri nets with their inherently Boolean character of processing tokens and firing transitions, the proposed generalization involves continuous variables. This extension makes the nets to be fully in rapport with the panoply of the real-world classification problems. The introduced model of the fuzzy Petri net hinges on the logic nature of the operations governing its underlying behavior. The logic-driven effect in these nets becomes especially apparent when we are concerned with the modeling of its transitions and expressing pertinent mechanisms of a continuous rather than an on-off firing phenomenon. An interpretation of fuzzy Petri nets in the setting of pattern classification is provided. This interpretation helps us gain a better insight into the mechanisms of the overall classification process. Input places correspond to the features of the patterns. Transitions build aggregates of the generic features giving rise to their logical summarization. The output places map themselves onto the classes of the patterns while the marking of the places correspond to the class of membership values. Details of the learning algorithm are also provided along with an illustrative numeric experiment.
Motivation is crucial for enhancing the effectiveness of knowledge transfer. This study aims to investigate how motivation for knowledge transfer and organisational context influence the effectiveness of knowledge transfer in project-based organisations. We further identify the key factors of motivation in an organisation context. We applied Dynamic Granular Cognitive Maps (DGCMs) to reveal the influencing mechanism of motivation and organisation context. Results show that three factors – knowledge transfer involvement, knowledge transfer satisfaction, and knowledge psychological ownership – are global controlled variables that reflect knowledge transfer performance. The motivation factors balanced reciprocity, avoiding punishment, organisational affective commitment, and achievement motivation are more important than others for knowledge transfer. Moreover, organisation context has a serious impact on knowledge transfer performance. Based on these results, a series of strategies are recommended to improve knowledge transfer in project-based organisations. This study offers a new approach to establishing crucial organisational relationships based on empirical evidence.