Informatica

In this paper, a new approach has been proposed for multi-label text data class verification and adjustment. The approach helps to make semi-automated revisions of class assignments to improve the quality of the data. The data quality significantly influences the accuracy of the created models, for example, in classification tasks. It can also be useful for other data analysis tasks. The proposed approach is based on the combination of the usage of the text similarity measure and two methods: latent semantic analysis and self-organizing map. First, the text data must be pre-processed by selecting various filters to clean the data from unnecessary and irrelevant information. Latent semantic analysis has been selected to reduce the vectors dimensionality of the obtained vectors that correspond to each text from the analysed data. The cosine similarity distance has been used to determine which of the multi-label text data class should be changed or adjusted. The self-organizing map has been selected as the key method to detect similarity between text data and make decisions for a new class assignment. The experimental investigation has been performed using the newly collected multi-label text data. Financial news data in the Lithuanian language have been collected from four public websites and classified by experts into ten classes manually. Various parameters of the methods have been analysed, and the influence on the final results has been estimated. The final results are validated by experts. The research proved that the proposed approach could be helpful to verify and adjust multi-label text data classes. 82% of the correct assignments are obtained when the data dimensionality is reduced to 40 using the latent semantic analysis, and the self-organizing map size is reduced from 40 to 5 by step 5.

In our daily life, we could be confronted with numerous multiple attribute group decision making (MAGDM) problems. For such problems we designed a model which employs probabilistic linguistic MABAC (multi-attributive border approximation area comparison) based on the cumulative prospect theory (CPT-PL-MABAC) method to solve the MAGDM. The CPT-PL-MABAC method can take experts’ psychological behaviour and preferences into consideration. Furthermore, we utilize the combined weight consisting of subjective weight and objective weight. The objective weight is acquired by the entropy method. Additionally, the concrete calculating steps of CPT-PL-MABAC method are proposed to solve the MAGDM for selecting the optimal location of express distribution centre. Also, a numerical example for location selection of express distribution centre is given as the justification of the usefulness of the designed method. Finally, we compare the designed model with the other three existing models, and summarize the advantages and shortcomings.

In this paper we propose modifications of the well-known algorithm of particle swarm optimization (PSO). These changes affect the mapping of the motion of particles from continuous space to binary space for searching in it, which is widely used to solve the problem of feature selection. The modified binary PSO variations were tested on the dataset SVC2004 dedicated to the problem of user authentication based on dynamic features of a handwritten signature. In the example of k-nearest neighbours (kNN), experiments were carried out to find the optimal subset of features. The search for the subset was considered as a multicriteria optimization problem, taking into account the accuracy of the model and the number of features.

This paper models and solves the scheduling problem of cable manufacturing industries that minimizes the total production cost, including processing, setup, and storing costs. Two hybrid meta-heuristics, which combine simulated annealing and variable neighbourhood search algorithms with tabu search algorithm, are proposed. Applying some case-based theorems and rules, a special initial solution with optimal setup cost is obtained for the algorithms. The computational experiments, including parameter tuning and final experiments over the benchmarks obtained from a real cable manufacturing factory, show superiority of the combination of tabu search and simulated annealing comparing to the other proposed hybrid and classical meta-heuristics.

Ligand Based Virtual Screening methods are used to screen molecule databases to select the most promising compounds for a query. This is performed by decision-makers based on the information of the descriptors, which are usually processed individually. This methodology leads to a lack of information and hard post-processing dependent on the expert’s knowledge that can end up in the discarding of promising compounds. Consequently, in this work, we propose a new multi-objective methodology called MultiPharm-DT where several descriptors are considered simultaneously and whose results are offered to the decision-maker without effort on their part and without relying on their expertise.

In order to avoid working in a constrained hazardous environment, manual spray painting operation is gradually being replaced by automated robotic systems in many manufacturing industries. Application of spray painting robots ensures defect-free painting of dissimilar components with higher repeatability, flexibility, productivity, reduced cycle time and minimum wastage of paint. Due to availability of a large number of viable options in the market, selection of a spray painting robot suitable for a given application poses a great problem. Thus, this paper proposes the integrated application of step-wise weight assessment ratio analysis (SWARA) and combined compromise solution (CoCoSo) methods to identify the most apposite spray painting robot for an automobile industry based on seven evaluation criteria (payload, mass, speed, repeatability, reach, cost and power consumption). The SWARA method identifies cost as the most significant criterion based on a set preference order, whereas, Fanuc P-350iA/45 is selected as the best spray painting robot by CoCoSo method. The derived ranking results are also contrasted with other popular multi-criteria decision making (MCDM) techniques (TOPSIS, VIKOR, COPRAS, PROMETHEE and MOORA) and subjective criteria weighting methods (AHP, PIPRECIA, BWM and FUCOM). High degrees of similarity in the ranking patterns between the adopted approach and other MCDM techniques prove its effectiveness in solving complex industrial robot selection problems. This integrated approach is proved to be quite robust being almost unaffected by the changing values of the corresponding tuning parameter in low-dimensional MCDM problems.

The theory of T-spherical fuzzy (T-SF) sets possesses remarkable capability to manage intricate uncertain information. The REGIME method is a well-established technique concerning discrete choice analysis. This paper comes up with a multiple-criteria choice analysis approach supported by the REGIME structure for manipulating T-SF uncertainties. This paper constructs new-created measurements such as superiority identifiers and guide indices for relative attractiveness and fittingness, respectively, between T-SF characteristics. This study evolves the T-SF REGIME I and II prioritization procedures for decision support. The application and comparative studies exhibit the effectiveness and favorable features of the propounded T-SF REGIME methodology in real decisions.

This paper aims to develop a Fermatean fuzzy ELECTRE method for solving multi-criteria group decision-making problems with unknown weights of decision makers and incomplete weights of criteria. First, a new distance measure between Fermatean fuzzy sets is proposed based on the Jensen–Shannon divergence. The cross entropy for Fermatean fuzzy sets is defined. Three kinds of dominance relationships for Fermatean fuzzy sets are proposed. Then, two optimization models are constructed to obtain positive ideal decision-making information and negative ideal decision-making information, respectively. Accordingly, the credibility degree of each decision maker is calculated. Decision makers’ dynamic weights are determined by their credibility degrees. Besides, to obtain the weights of criteria, an optimization model is constructed based on grey relational analysis for Fermatean fuzzy numbers. Finally, the strong, medium and weak Fermatean fuzzy concordance and discordance sets are identified to construct the Fermatean fuzzy concordance and discordance matrices, respectively. A practical case study is carried out to illustrate the feasibility and applicability of the proposed ELECTRE method. Comparative analyses are performed to demonstrate the superiority and effectiveness of the proposed ELECTRE method.

A proper CNC machine selection problem is an important issue for manufacturing companies under competitive market conditions. The selection of an improper machine tool can cause many problems such as production capabilities and productivity indicators considering time and money industrially and practically. In this paper, a comprehensive solution approach is presented for the CNC machine tool selection problem according to the determined criteria. Seven main and thirteen sub-criteria were determined for the evaluation of the seven alternatives. To purify the selection process from subjectivity, instead of a single decision-maker, the opinions of six different experts on the importance of the criteria were taken and evaluated using the Best-Worst method. According to the evaluations, the order of importance of the main criteria has been determined as cost, productivity, flexibility, and dimensions. After the weighting of the criteria, three different ranking methods (GRA, COPRAS, and MULTIMOORA) were preferred due to the high investment costs of the selected alternatives. The findings obtained by solving the problem of selection of the CNC machine are close to those obtained by past researchers. As a result, using the suggested methodology, effective alternative decision-making solutions are obtained.