One-class classification (OCC) is a supervised classification problem where the training data is solely one class. OCC cannot execute hyperparameter tuning because its evaluation requires access to other classes; the algorithm will no longer be OCC if the model is updated after accessing other classes. To address this issue, this paper proposes hyperparameter fusion, which is applicable without the evaluation. The fusion process applies ensemble learning techniques, voting, and stacking into OCC models trained on different hyperparameters. The experiments involve 54 OCC problems from 27 imbalanced learn datasets and 115 hyperparameter candidates. The experiment results show that hyperparameter fusion outperformed the average base learners in the area under the receiver operating characteristic (AUC) score. Moreover, removing the worst base learner can improve the AUC score for the ensemble. The discussion section predicts the worst base learner from correlations of normality rankings created by model outputs. The worst base learner has relatively small ranking correlations to the ensemble model compared to other base learners.

Evaluating startup companies is an important management process for technology business incubators and it is also a typical multicriteria decision-making (MCDM) problem. There exist various methods that have proposed to solve MCDM problems, but these methods heavily depend on the exact criteria weight values. The decision results of these methods are unstable. Moreover, they cannot provide the improvement suggestions for the nonoptimal startup companies. To overcome these two drawbacks, we propose a novel hesitant fuzzy linguistic decision-making method to solve the problem of evaluating startup companies. To this end, a novel semantic comparison method based on the experts' psychology and the ratio of score value to deviation degree is proposed to compare the hesitant fuzzy linguistic term sets. Then, a novel definition of hesitant fuzzy linguistic information envelopment efficiency (HFLIEE) is proposed, based on which, a novel hesitant fuzzy linguistic information envelopment analysis (HFLIEA) model and a novel preference model are proposed. By solving these models, all the alternatives can be ranked and nonoptimal alternatives can be improved. Finally, the numerical analysis is given to illustrate the applicability of the proposed models and the robustness analyses of the proposed models are provided. At the same time, they are compared with the previous hesitant fuzzy linguistic decision-making methods.

Dual hesitant fuzzy elements (DHFEs) are suitable to express hesitant possible preferred and nonpreferred judgments of decision makers. Preference relation is an important tool in decision making that only needs the decision makers to compare a pair of objects at one time. This study focuses on decision making with dual hesitant fuzzy preference relations (DHFPRs). Considering the consistency, an additive consistency concept is defined. Meanwhile, the property of the new concept is studied. Using this consistency concept, a method for assessing the additive consistency of DHFPRs is offered. To extend the application of DHFPRs, a programming model to determine the missing DHFEs in incomplete DHFPRs is built, which have the highest additive consistency level for the known ones. Two equivalent methods to calculate the priority vector are offered. One method obtains the probabilistic dual hesitant fuzzy priority vector, and the other derives the intuitionistic fuzzy priority vector. Furthermore, a consensus index is defined to measure the consensus of individual opinions in group decision making (GDM), and an interactive method for increasing the consensus level is offered. On the basis of the additive consistency and consensus, an algorithm to GDM with DHFPRs is offered that can address inconsistent and incomplete cases. Finally, a practical example about evaluating color TV is provided to demonstrate the usefulness of the new procedure.

Data mining is a method for extracting useful information that is necessary for a system from a database. As the types of data processed by the system are diversified, the transformed pattern mining techniques for processing these type of data have been proposed. Unlike the traditional pattern mining methods, erasable pattern mining is a technique for finding the patterns that can be removed by coming with a small profit. Erasable pattern mining should be able to process data by considering both the environment that the data are generated from and the characteristics of the data. An uncertain database is a database that is composed of uncertain data. Since erasable patterns discovered from uncertain data contain significant information, these patterns need to be extracted. In addition, databases gradually increase, because the data from various fields is generated and accumulated over data streams. Data streams should be processed as intelligently as possible to provide the useful data to the system in real time. In this paper, we propose an efficient erasable pattern mining algorithm that processes uncertain data that is generated over data streams. The uncertain erasable patterns discovered through the suggested technique are more meaningful information by considering the probability of the item and the profit. Moreover, the proposed method can perform efficient mining operations by using both tree and list structures. The performance of the suggested algorithm is verified through the performance tests compared with state-of-the-art algorithms using real data sets and synthetic data sets.

The notion of intuitionistic fuzzy soft sets (IFSSs) provides an effective tool for solving multiple attribute decision making with intuitionistic fuzzy information. The most crucial issue in decision making based on IFSSs is how to derive the ranking of alternatives from the information quantified in terms of intuitionistic fuzzy values. In this study, we propose a new extension of the preference ranking organization method for enrichment evaluation (PROMETHEE), by taking advantage of IFSSs. In addition to presenting a myriad of new notions, such as intuitionistic fuzzy membership (or nonmembership) deviation matrices, intuitionistic fuzzy membership (or nonmembership) preference matrices, and aggregated intuitionistic fuzzy preference matrices, we put more emphasis on the construction of three distinct preference structures and related utility functions on the corresponding weakly ordered sets by considering the positive, negative, and net flows of the alternatives based on the aggregated intuitionistic fuzzy preference matrix. We present a new algorithm for solving multiple attribute decision-making problems with the extended PROMETHEE method based on IFSSs. Moreover, a benchmark problem concerning risk investment is investigated to give a comparative analysis and show the feasibility of our approach.

The natural language processing (NLP) denotes a technique used to process data such as text and speech. Some of the fundamental research in NLP includes the named entity recognition, which recognizes the named entities (i.e., persons and companies) from texts, the semantic parsing, which converts a natural language utterance to a logical form, and the co-reference resolution, which extracts the nouns (including pronouns and noun phrases) pointing to the same reference body. In this paper, we focus on the mention extraction and classification, proposing a neural-encoded mention-hypergraph model named the BILU-NEMH to extract the mention entities from a content. The proposed BILU-NEMH model combines a mention hypergraph model with the encoding schema and neural network. The proposed model can effectively capture the overlapping mention entities of an unbounded length. The proposed model was verified by the experiments, and the obtained experimental results showed that the proposed model achieved better performance and greater effectiveness than the existing related models on most standard datasets.

Although fuzzy preference relations (FPRs) are among the most commonly used preference models in group decision making (GDM), they are not free from drawbacks. First of all, especially when dealing with many alternatives, the definition of FPRs becomes complex and time consuming. Moreover, they allow to focus on only two options at a time. This facilitates the expression of preferences but let experts lose the global perception of the problem with the risk of introducing inconsistencies that impact negatively on the whole decision process. For these reasons, different preference models are often adopted in real GDM settings and, if necessary, transformation functions are applied to obtain equivalent FPRs. In this paper, we propose fuzzy rankings, a new approximate preference model that offers a higher level of user-friendliness with respect to FPRs while trying to maintain an adequate level of expressiveness. Fuzzy rankings allow experts to focus on two alternatives at a time without losing the global picture so reducing inconsistencies. Conversion algorithms from fuzzy rankings to FPRs and backward are defined as well as similarity measures, useful when evaluating the concordance between experts’ opinion. A comparison of the proposed model with related works is reported as well as several explicative examples.

In group decision making, there are many situations where the opinion of the majority of participants is critical. The scenarios could be multiple, like a number of doctors finding commonality on the diagnose of an illness or parliament members looking for consensus on an specific law being passed. In this article, we present a method that utilizes induced ordered weighted averaging (IOWA) operators to aggregate a majority opinion from a number of sentiment analysis (SA) classification systems, where the latter occupy the role usually taken by human decision-makers as typically seen in group decision situations. In this case, the numerical outputs of different SA classification methods are used as input to a specific IOWA operator that is semantically close to the fuzzy linguistic quantifier ‘most of’. The object of the aggregation will be the intensity of the previously determined sentence polarity in such a way that the results represent what the majority think. During the experimental phase, the use of the IOWA operator coupled with the linguistic quantifier ‘most’ () proved to yield superior results compared to those achieved when utilizing other techniques commonly applied when some sort of averaging is needed, such as arithmetic mean or median techniques.