GraphLSHC: Towards large scale spectral hypergraph clustering

Weighted hypergraph learning and adaptive inductive matrix completion for SARS-CoV-2 drug repositioning

MOTIVATION

The outbreak of the human coronavirus (SARS-CoV-2) has placed a huge burden on public health and the world economy. Compared with de novo drug discovery, drug repurposing is a promising therapeutic strategy that facilitates rapid clinical treatment decisions, shortens the development process, and reduces costs.

RESULTS

In this study, we propose a weighted hypergraph learning and adaptive inductive matrix completion method, WHAIMC, for predicting potential virus-drug associations. Firstly, we integrate multi-source data to describe viruses and drugs from multiple perspectives, including drug chemical structures, drug targets, virus complete genome sequences, and virus-drug associations. Then, WHAIMC establishes an adaptive inductive matrix completion model to improve performance through adaptive learning of similarity relations. Finally, WHAIMC introduces weighted hypergraph learning into adaptive inductive matrix completion to capture higher-order relationships of viruses (or drugs). The results showed that WHAIMC had a strong predictive performance for new virus-drug associations, new viruses, and new drugs. The case study further demonstrates that WHAIMC is highly effective for repositioning antiviral drugs against SARS-CoV-2 and provides a new perspective for virus-drug association prediction. The code and data in this study is freely available at https://github.com/Mayingjun20179/WHAIMC.

EtHgSC: Eigen Trick-Based Hypergraph Stable Clustering Algorithm in VANET

A smart city’s vehicular communication strategy is important. A significant problem with vehicular communication is scalability. Clustering can help with vehicular ad hoc network (VANET) problems; however, clustering in VANET faces stability problems because of the rapid mobility of the vehicles. To achieve high stability for the VANET, this paper presents a new efficient Eigen-trick-based hypergraph stable clustering algorithm (EtHgSC). This algorithm has a twofold scheme for stable CH selection. In the first part of the proposed scheme, the cluster generation is handled using an improved hypergraph-based spectral clustering algorithm using the Eigen-trick method. The “Eigen-trick” method is used to partition both vertices and hyperedges, which provides an approach for reducing the computational complexity of the clustering. The cluster head (CH) is chosen in the second part, taking into account the requirements for keeping a stable connection with most neighbors. In addition to relative speed, neighboring degree, and eccentricity that are used to select the CH, the vehicle time to leave metric is introduced to increase the CH stability. The grey relational analysis model is used to find each vehicle’s score, and the CH is selected based on the maximum vehicle’s score. The results show the supremacy of our proposed scheme in terms of CH lifetime, cluster member (CM) lifetime, and the change rate of CH. Also, the proposed scheme achieves a considerable reduction in terms of packet delay.

Economic Order Quantity Model-Based Optimized Fuzzy Nonlinear Dynamic Mathematical Schemes

Fuzzy mathematics-informed methods are beneficial in cases when observations display uncertainty and volatility since it is of vital importance to make predictions about the future considering the stages of interpreting, planning, and strategy building. It is possible to realize this aim through accurate, reliable, and realistic data and information analysis, emerging from past to present time. The principal expenditures are treated as fuzzy numbers in this article, which includes a blurry categorial prototype with pattern-diverse stipulation and collapse with salvation worth. Multiple parameters such as a shortage, ordering, and degrading cost are not fixed in nature due to uncertainty in the marketplace. Obtaining an accurate estimate of such expenditures is challenging. Accordingly, in this research, we develop an adaptive and integrative economic order quantity model with a fuzzy method and present an appropriate structure to manage such uncertain parameters, boosting the inventory system's exactness, and computing efficiency. The major goal of the study was to assess a set of changes to the company current inventory processes that allowed an achievement in its inventory costs optimization and system development in optimizing inventory costs for better control and monitoring. The approach of graded mean integration is used to determine the most efficient actual solution. The evidence-based model is illustrated with the help of appropriate numerical and sensitivity analysis through the related visual graphical depictions. The proposed method in our study aims at investigating the economic order quantity (EOQ), as the optimal order quantity, which is significant in inventory management to minimize the total costs related to ordering, receiving, and holding inventory in the dynamic domains with nonlinear features of the complex dynamic and nonlinear systems as well as structures.

Incremental Fuzzy Clustering Based on Feature Reduction

In the era of big data, more and more datasets are gradually beyond the application scope of traditional clustering algorithms because of their large scale and high dimensions. In order to break through the limitations, incremental mechanism and feature reduction have become two indispensable parts of current clustering algorithms. Combined with single-pass and online incremental strategies, respectively, we propose two incremental fuzzy clustering algorithms based on feature reduction. The first uses the Weighted Feature Reduction Fuzzy C-Means (WFRFCM) clustering algorithm to process each chunk in turn and combines the clustering results of the previous chunk into the latter chunk for common calculation. The second uses the WFRFCM algorithm for each chunk to cluster at the same time, and the clustering results of each chunk are combined and calculated again. In order to investigate the clustering performance of these two algorithms, six datasets were selected for comparative experiments. Experimental results showed that these two algorithms could select high-quality features based on feature reduction and process large-scale data by introducing the incremental strategy. The combination of the two phases can not only ensure the clustering efficiency but also keep higher clustering accuracy.