A Decision-Making Approach Based on Score Matrix for Pythagorean Fuzzy Soft Set

Pythagorean fuzzy soft set (PFSS) is the most powerful and effective extension of Pythagorean fuzzy sets (PFS) which deals with the parametrized values of the alternatives. It is also a generalization of intuitionistic fuzzy soft set (IFSS) which provides us better and precise information in the decision-making process comparative to IFSS. The core objective of this work is to construct some algebraic operations for PFSS such as OR-operation, AND-operation, and necessity and possibility operations. Furthermore, some fundamental properties have been established for PFSS utilizing the developed operations. Moreover, a decision-making technique has been offered for PFSS based on a score matrix. To demonstrate the validity of the proposed approach, a numerical example has been presented. Finally, to ensure the practicality of the established approach, a comprehensive comparative analysis has been presented. The obtained results show that our developed approach is most effective and delivers better information comparative to prevailing techniques.

GSS-RiskAsser: A Multi-Modal Deep-Learning Framework for Urban Gas Supply System Risk Assessment on Business Users

Gas supply system risk assessment is a serious and important problem in cities. Existing methods tend to manually build mathematical models to predict risk value from single-modal information, i.e., pipeline parameters. In this paper, we attempt to consider this problem from a deep-learning perspective and define a novel task, Urban Gas Supply System Risk Assessment (GSS-RA). To drive deep-learning techniques into this task, we collect and build a domain-specific dataset GSS-20K containing multi-modal data. Accompanying the dataset, we design a new deep-learning framework named GSS-RiskAsser to learn risk prediction. In our method, we design a parallel-transformers Vision Embedding Transformer (VET) and Score Matrix Transformer (SMT) to process multi-modal information, and then propose a Multi-Modal Fusion (MMF) module to fuse the features with a cross-attention mechanism. Experiments show that GSS-RiskAsser could work well on GSS-RA task and facilitate practical applications. Our data and code will be made publicly available.

Influence model with opinions and trust score evaluations under the leader-follower environment

A group decision-making process is introduced by utilizing the influence model together with a matrix of interpersonal influences and an opinion matrix. The opinion matrix is constructed with the opinions/advice from one group of experts towards the other. Experts are divided into two groups, one which has more experienced, skilled and qualified persons is known as the group of opinion leaders and the other is known as the group of opinion followers. Sometimes, decision-makers are ordinary agents and their opinion formation is profoundly influenced by opinion leaders. The truthfulness of opinion leaders and the interpersonal influences of decision-makers is also taken into account. Also, a modified definition of trust score evaluation is presented with the understanding of the fact that the maximum trust which a decision-maker can do upon some opinion leader is his/her truthfulness. On the basis of this definition, a trust score matrix is constructed and the influence model is modified to take into account that matrix.

Time-Weighted Collaborative Filtering Algorithm Based on Improved Mini Batch K-Means Clustering

The traditional collaborative filtering recommendation algorithm has the defects of sparse score matrix, weak scalability and user interest deviation, which lead to the low efficiency of algorithm and low accuracy of score prediction. Aiming at the above problems, this paper proposed a time-weighted collaborative filtering algorithm based on improved Mini Batch K-Means clustering. Firstly, the algorithm selected the Pearson correlation coefficient to improve the Mini Batch K-Means clustering, and used the improved Mini Batch K-Means algorithm to cluster the sparse scoring matrix, calculated the user interest score to complete the filling of the sparse matrix. Then, considering the influence of user interest drift with time, the algorithm introduced the Newton cooling time-weighted to improve user similarity. And then calculated user similarity based on the filled score matrix, which helped to get the last predicted score of unrated items The experimental results show that, compared with the traditional collaborative filtering algorithms, the mean absolute error of Proposed improved algorithm is d, and the Precision, Recall and F1 value of MBKT-CF also get a large improvement, which has a higher rating prediction accuracy.

Link community detection combined with network pruning and local community expansion

Studying overlapping community structure can help people understand complex network. In this paper, we propose a link community detection method combined with network pruning and local community expansion (NPLCE). Firstly, we delete unattractive links and transform pruned graph into line graph. Secondly, we calculate score matrix on line graph through pagerank algorithm. Then, we search seed nodes and expand local communities from the seed nodes. Finally, we merge those communities and transform them back into node communities. The experiment results on several real-world networks demonstrate the performance of our algorithm in terms of accuracy.

Formulation and Analysis of Patterns in a Score Matrix for Global Sequence Alignment

Global sequence alignment is one of the most basic pairwise sequence alignment procedures used in molecular biology to understand the similarity that arises among the structure, function, or evolutionary relationship between two nucleotide sequences. The general algorithm associated with global sequence alignment is the dynamic programming algorithm of Needleman and Wunsch. In this paper, patterns are exploited in the score matrix of the Needleman–Wunsch algorithm. With the help of some examples, the general patterns realized are formulated as new a priori propositions and corollaries that are established for both equal and unequal length comparisons of any two arbitrary sequences.

RFDTI: Using Rotation Forest with Feature Weighted for Drug-Target Interaction Prediction from Drug Molecular Structure and Protein Sequence

The identification and prediction of Drug-Target Interactions (DTIs) is the basis for screening drug candidates, which plays a vital role in the development of innovative drugs. However, due to the time-consuming and high cost constraints of biological experimental methods, traditional drug target identification technologies are often difficult to develop on a large scale. Therefore, in silico methods are urgently needed to predict drug-target interactions in a genome-wide manner. In this article, we design a new in silico approach, named RFDTI to predict the DTIs combine Feature weighted Rotation Forest (FwRF) classifier with protein amino acids information. This model has two outstanding advantages: a) using the fusion data of protein sequence and drug molecular fingerprint, which can fully carry information; b) using the classifier with feature selection ability, which can effectively remove noise information and improve prediction performance. More specifically, we first use Position-Specific Score Matrix (PSSM) to numerically convert protein sequences and utilize Pseudo Position-Specific Score Matrix (PsePSSM) to extract their features. Then a unified digital descriptor is formed by combining molecular fingerprints representing drug information. Finally, the FwRF is applied to implement on Enzyme, Ion Channel, GPCR, and Nuclear Receptor data sets. The results of the five-fold cross-validation experiment show that the prediction accuracy of this approach reaches 91.68%, 88.11%, 84.72% and 78.33% on four benchmark data sets, respectively. To further validate the performance of the RFDTI, we compare it with other excellent methods and Support Vector Machine (SVM) model. In addition, 7 of the 10 highest predictive scores in predicting novel DTIs were validated by relevant databases. The experimental results of cross-validation indicated that RFDTI is feasible in predicting the relationship among drugs and target, and can provide help for the discovery of new candidate drugs.