Network Embedding Research Articles

The role of data embedding in equivariant quantum convolutional neural networks

AbstractGeometric deep learning refers to the scenario in which the symmetries of a dataset are used to constrain the parameter space of a neural network and thus, improve their trainability and generalization. Recently, this idea has been incorporated into the field of quantum machine learning, which has given rise to equivariant quantum neural networks (EQNNs). In this work, we investigate the role of classical-to-quantum embedding on the performance of equivariant quantum convolutional neural networks (EQCNNs) for the classification of images. We discuss the connection between the data embedding method and the resulting representation of a symmetry group and analyze how changing representation affects the expressibility of an EQCNN. We numerically compare the classification accuracy of EQCNNs with three different basis-permuted amplitude embeddings to the one obtained from a non-equivariant quantum convolutional neural network (QCNN). Our results show a clear dependence of classification accuracy on the underlying embedding, especially for initial training iterations. The improvement in classification accuracy of EQCNN over non-equivariant QCNN may be present or absent depending on the particular embedding and dataset used. The noisy simulation using simple noise models shows that certain EQCNNs are more robust to noise than non-equivariant QCNNs. It is expected that the results of this work can be useful to the community for a better understanding of the importance of data embedding choice in the context of geometric quantum machine learning.

Network Embedding Technology Based on Breadth Learning for Information Extraction and Review in Social Media

Network Embedding Technology Based on Breadth Learning for Information Extraction and Review in Social Media

RLL-SWE: A Robust Linked List Steganography Without Embedding for intelligence networks in smart environments

RLL-SWE: A Robust Linked List Steganography Without Embedding for intelligence networks in smart environments

Prediction of Drug Pathway-based Disease Classes using Multiple Properties of Drugs

Background: Drug repositioning now is an important research area in drug discovery as it can accelerate the procedures of discovering novel effects of existing drugs. However, it is challenging to screen out possible effects for given drugs. Designing computational methods are a quick and cheap way to complete this task. Most existing computational methods infer the relationships between drugs and diseases. The pathway-based disease classification reported in KEGG provides us a new way to investigate drug repositioning as such classification can be applied to drugs. A predicted class of a given drug suggests latent diseases it can treat. Objective: The purpose of this study is to set up efficient multi-label classifiers to predict the classes of drugs. Methods: We adopt three types of drug information to generate drug features, including drug pathway information, label information and drug network. For the first two types, drugs are first encoded into binary vectors, which are further processed by singular value decomposition. For the third type, the network embedding algorithm, Mashup, is employed to yield drug features. Above features are combined and fed into RAndom k-labELsets (RAKEL) to construct multi-label classifiers, where support vector machine is selected as the base classification algorithm. Results: The ten-fold cross-validation results show that the classifiers provide high performance with accuracy higher than 0.95 and absolute true higher than 0.92. The case study indicates the novel effects of three drugs, i.e., they may treat new diseases. Conclusion: The proposed classifiers have high performance and are superiority to the classifiers with other classic algorithms and drug information. Furthermore, they have the ability to discover new effects of drugs.

Graph-learning-based machine learning improves prediction and cultivation of commercial-grade marine microalgae Porphyridium

A graph learning [Binarized Attributed Network Embedding (BANE)] model enhances the single-target and multi-target prediction performances of random forest and eXtreme Gradient Boosting (XGBoost) by learning complex interrelationships between cultivation parameters of Porphyridium. The BANE-XGBoost has the best prediction performance (train R2 > 0.96 and test R2 > 0.87). Based on Shapley Additive Explanation (SHAP) model, illumination intensity, culture time, and KH2PO4 are the most critical factors for Porphyridium growth. The combined facilitating roles of cultivation parameters are found using the SHAP value-based heat map and group. To reach high biomass and daily production rate concurrently, one-way and two-way partial dependent plots models find the optimal conditions. The top 2 critical parameters (illumination intensity and KH2PO4) were selected to verify using the graphical user interface website based on the optimized model and lab experiments, respectively. This study shows thegraph-learning-based model can improve prediction performance and optimize intricate low-carbon microalgal cultivation.

FCG-MFD: Benchmark function call graph-based dataset for malware family detection

Cyber crimes related to malware families are on the rise. This growth persists despite the prevalence of various antivirus software and approaches for malware detection and classification. Security experts have implemented Machine Learning (ML) techniques to identify these cyber-crimes. However, these approaches demand updated malware datasets for continuous improvements amid the evolving sophistication of malware strains. Thus, we present the FCG-MFD, a benchmark dataset with extensive Function Call Graphs (FCG) for malware family detection. This dataset guarantees resistance against emerging malware families by enabling security systems. Our dataset has two sub-datasets (FCG & Metadata) (1,00,000 samples) from VirusSamples, Virusshare, VirusSign, theZoo, Vx-underground, and MalwareBazaar curated using FCGs and metadata to optimize the efficacy of ML algorithms. We suggest a new malware analysis technique using FCGs and graph embedding networks, offering a solution to the complexity of feature engineering in ML-based malware analysis. Our approach to extracting semantic features via the Natural Language Processing (NLP) method is inspired by tasks involving sentences and words, respectively, for functions and instructions. We leverage a node2vec mechanism-based graph embedding network to generate malware embedding vectors. These vectors enable automated and efficient malware analysis by combining structural and semantic features. We use two datasets (FCG & Metadata) to assess FCG-MFD performance. F1-Scores of 99.14% and 99.28% are competitive with State-of-the-art (SOTA) methods.

Anomaly Detection System Based on Graph Neural Network and Node Embedding for Cybersecurity

Anomaly Detection System Based on Graph Neural Network and Node Embedding for Cybersecurity

Academic collaboration recommendation based on graph neural network and multi-attribute embedding

Academic collaboration recommendation (ACR) can help researchers find potential partners for research and thus promote academic innovation. Recent works mostly use graph learning-based methods to explore various ways of combining node information with topology, which consists of multiple steps, including network construction, node feature extraction, network representation learning and link prediction. One limitation is that they only conduct research on co-authorship networks and ignore citation relationship between publications. Besides, they tend to use attributes from a single dimension of researchers and do not take attributes of researchers from multiple dimensions into consideration at the same time. To address the above issues, we present the multi-dimensional attributes enhanced heterogeneous (MAH) network representation learning method, which constructs heterogeneous networks with both co-authorship and citation information and makes use of multi-dimensional attributes. Three research questions are addressed in this work: (RQ1) Is our proposed method effective on academic collaboration recommendation compared with existing state-of-the-art methods? (RQ2) Does incorporating citation information into co-authorship network help improve the performance of academic collaboration recommendation? (RQ3) How does fusing multi-dimensional attributes affect the performance of academic collaboration recommendation? A publicly available real-world data set is used in our experiments. The superior performance of MAH compared with baseline methods demonstrates that the proposed multi-dimensional feature-based researcher profile can enrich node information in academic network and effective researcher representations can be learned by applying graph representation learning methods on the network.

Graph-Root: Prediction of Root-Associated Proteins in Maize, Sorghum, And Soybean Based on Graph Convolutional Network and Network Embedding Method

Background: The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such a system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. Objective: The purpose of this study was to design an efficient computational method to predict root-associated proteins in three plants: maize, sorghum, and soybean. Method: In this study, we proposed a machine learning based model, named Graph-Root, for the identification of root-related proteins in maize, sorghum, and soybean. The features derived from protein sequences, functional domains, and one network were extracted, where the first type of features were processed by graph convolutional neural network and multi-head attention, the second type of features reflected the essential functions of proteins, and the third type of features abstracted the linkage between proteins. These features were fed into the fully connected layer to make predictions. Results: The 5-fold cross-validation and independent tests suggested its acceptable performance. It also outperformed the only previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated. Conclusion: Graph-Root had a good performance and can be a useful tool to identify novel rootrelated proteins. BLOSUM62 features were found to be important in determining root-related proteins.

A novel recovery controllability method on temporal networks via temporal lost link prediction

Abstract Temporal networks are essential in representing systems where interactions between elements evolve over time. A crucial aspect of these networks is their controllability the ability to guide the network to a desired state through a set of control inputs. However, as these networks evolve, links between nodes can be lost due to various reasons, such as network failures, disruptions, or attacks. The loss of these links can severely impair the network’s controllability, making it challenging to recover desired network functions. In this paper, while investigating the destructive effects of various attacks on controllability processes in temporal networks, a new controllability recovery method is proposed, in which it prevents disruptions in this type of network processes by predicting lost links. In the proposed method, using network embedding and feature extraction, the dissimilarity of the nodes is calculated and then the missing links are predicted by designing a neural network. The results of the implementation of the proposed method on the datasets have demonstrates that the proposed method performed better than other conventional methods.

From communities to interpretable network and word embedding: an unified approach

Abstract Modelling information from complex systems such as humans social interaction or words co-occurrences in our languages can help to understand how these systems are organized and function. Such systems can be modelled by networks, and network theory provides a useful set of methods to analyze them. Among these methods, graph embedding is a powerful tool to summarize the interactions and topology of a network in a vectorized feature space. When used in input of machine learning algorithms, embedding vectors help with common graph problems such as link prediction, graph matching, etc In Natural Language Processing (NLP), such a vectorization process is also employed. Word embedding has the goal of representing the sense of words, extracting it from large text corpora. Despite differences in the structure of information in input of embedding algorithms, many graph embedding approaches are adapted and inspired from methods in NLP. Limits of these methods are observed in both domains. Most of these methods require long and resource greedy training. Another downside to most methods is that they are black-box, from which understanding how the information is structured is rather complex. Interpretability of a model allows understanding how the vector space is structured without the need for external information, and thus can be audited more easily. With both these limitations in mind, we propose a novel framework to efficiently embed network vertices in an interpretable vector space. Our Lower Dimension Bipartite Framework (LDBGF) leverages the bipartite projection of a network using cliques to reduce dimensionality. Along with LDBGF, we introduce two implementations of this framework that rely on communities instead of cliques: SINr-NR and SINr-MF. We show that SINr-MF can perform well on classical graphs and SINr-NR can produce high-quality graph and word embeddings that are interpretable and stable across runs.

Optimizing Virtual Network Embedding for Avionics with Time-Triggered Traffic Scheduling

Network virtualization technology abstracts the nodes and links resources in the physical network, and enables multiple virtual networks (VNs) to share the substrate network (SN) resources through the Virtual Netw ork Embedding (VNE) method. For time-triggered Ethernet (TTE) used in avionics, a time-triggered traffic scheduling oriented virtual network embedding (TT-VNE) method is proposed. While meeting the total resource constraints of traditional VNE problem, it ensures the strict periodicity of time-triggered (TT) traffic. During the solution process, the method sorts the virtual nodes according to the TT traffic bandwidth requirements and the total bandwidth requirements of the links connected to the virtual nodes, embeds the virtual nodes using the breadth first search algorithm, and plans the virtual links in candidate shortest path aggregation. If the TT traffic in the current virtual link is not schedulable, the iterative design of local virtual node re embedding and path planning is carried out. The simulation shows that the request acceptance rate of TT-VNE is not lower than that of existing methods, and when the number of virtual network requests in the star topology exceeds 30 , its request acceptance rate is about 14.3%higher than the VNE-NTANRC-D method which only considers the network topology and resource attributes.

Trustworthiness-Driven Graph Convolutional Networks for Signed Network Embedding

The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks (GCNs) have been proposed for this problem, we point out that they significantly rely on the assumption that the decades-old balance theory always holds in the real-world. To address this limitation, we propose a novel GCN-based SNE approach, named as TrustSGCN, which corrects for incorrect embedding propagation in GCN by utilizing the trustworthiness on edge signs for high-order relationships inferred by the balance theory. The proposed approach consists of three modules: (M1) generation of each node’s extended ego-network; (M2) measurement of trustworthiness on edge signs; and (M3) trustworthiness-aware propagation of embeddings. Specifically, TrustSGCN leverages topological information to measure trustworthiness on edge sign for high-order relationships inferred by balance theory. It then considers structural properties inherent to an input network, such as the ratio of triads, to correct for incorrect embedding propagation. Furthermore, TrustSGCN learns the node embeddings by leveraging two well-known social theories, i.e., balance and status, to jointly preserve the edge sign and direction between nodes connected by existing edges in the embedding space. The experiments on six real-world signed network datasets demonstrate that TrustSGCN consistently outperforms six state-of-the-art GCN-based SNE methods. The code is available at https://github.com/kmj0792/TrustSGCN .

Knowledge Graph Completion for High-Speed Railway Turnout Switch Machine Maintenance Based on the Multi-Level KBGC Model

The incompleteness of the existing knowledge graphs in the railway domain creates information gaps, impacting their quality and effectiveness in the operation and maintenance of high-speed railway turnout switch machines. To address this, we propose a multi-layer model (KBGC) that combines KG-BERT, graph attention network (GAT), and Convolutional Embedding Network (ConvE) for knowledge graph completion in railway maintenance. KG-BERT fine-tunes a pre-trained BERT model to extract deep semantic features from entities and relationships, converting them into graph structures. GAT captures key structural relationships between nodes using an attention mechanism, producing enriched semantic and structural embeddings. Finally, ConvE reshapes and convolves these embeddings to learn complex entity interactions, enabling accurate link prediction. Extensive experiments on the HRTOM dataset, containing triplet data from high-speed railway turnout switch machines, demonstrate the model’s effectiveness, achieving an MRR of 50.8% and a Hits@10 of 60.7%. These findings show that the KBGC model significantly improves knowledge graph completion, aiding railway maintenance personnel in decision making and preventive maintenance, and providing new tools for railway maintenance applications.

Hyperbolic map unravels eight regions in temperature volatility regionalization of Mainland China

Abstract Abrupt temperature volatility has detrimental effects on daily activities, macroeconomic growth, and human health. Predicting abrupt temperature volatility and thus diminishing its negative impacts can be achieved by exploring homogeneous regions of temperature volatility and analyzing the driving factors. To investigate the regionalization of temperature volatility in Mainland China, a network constructed by the cosine similarity of temperature volatility series from Mainland China was embedded in hyperbolic space. Subsequently, we partitioned the network on the hyperbolic map using the critical gap method and then found eight regions in all. Ultimately, a network of communities was constructed while the interaction among communities was quantified. This yields a perspective of temperature volatility regionalization that can accurately reflect factors including altitude, climate type, and the geographic location of mountains. Further analysis demonstrates that the regionalization in the hyperbolic map is distinct from provinces and has a realistic basis: communities in southwest China show strong correlations due to the temperature sensitivity to altitude, and communities in northern China show a convergence in the area of Dingxi, Gansu, mainly owing to the strong temperature sensitivity to climate types. As a consequence, node distributions and community divisions in the hyperbolic map can offer new insights into the regionalization of temperature volatility in Mainland China. The results demonstrate the potential of hyperbolic embedding of complex networks in forecasting future node associations in real-world data.

FELRec: efficient handling of item cold-start with dynamic representation learning in recommender systems

AbstractRecommender systems suffer from the cold-start problem whenever a new user joins the platform or a new item is added to the catalog. To address item cold-start, we propose to replace the embedding layer in sequential recommenders with a dynamic storage that has no learnable weights and can keep an arbitrary number of representations. In this paper, we present , a large embedding network that refines the existing representations of users and items in a recursive manner, as new information becomes available. In contrast to similar approaches, our model represents new users and items without side information and time-consuming finetuning, instead it runs a single forward pass over a sequence of existing representations. During item cold-start, our method outperforms similar method by 29.50–47.45%. Further, our proposed model generalizes well to previously unseen datasets in zero-shot settings. The source code is publicly available at https://github.com/kweimann/FELRec.

Multiple network embedding for anomaly detection in time series of graphs

The problem of anomaly detection in time series of graphs is considered, focusing on two related inference tasks: the detection of anomalous graphs within a time series and the detection of temporally anomalous vertices. These tasks are approached via the adaptation of multiple adjacency spectral embedding (MASE), a statistically principled method for joint graph inference. The effectiveness of the method is demonstrated for these inference tasks, and its performance is assessed based on the nature of detectable anomalies. Theoretical justification is provided, along with insights into its use. The approach identifies anomalous vertices beyond just large degree changes when applied to the Enron communication graph, a large-scale commercial search engine time series, and a larval Drosophila connectome.

Network embedding-based directed community detection with unknown community number

Community detection of network analysis plays an important role in numerous application areas, in which estimating the number of communities is a fundamental issue. However, many existing methods focus on undirected networks ignoring the directionality of edges or unrealistically assume that the number of communities is known a priori. In this article, we develop a data-dependent community detection method for the directed network to determine the number of communities and recover community structures simultaneously, which absorbs the ideas of network embedding and penalized fusion by embedding the out- and in-nodes into low-dimensional vector space and forcing the embedding vectors towards its center. The asymptotic consistency properties of the proposed method are established in terms of network embedding, directed community detection, and estimation of the number of communities. The proposed method is applied on synthetic networks and real brain functional networks, which demonstrate the superior performance of the proposed method against a number of competitors.

MP-GIEN: Vehicle re-identification method based on multi-view progressive graph interactive embedding network

MP-GIEN: Vehicle re-identification method based on multi-view progressive graph interactive embedding network

Unsupervised motor incipient fault detection using lightweight network and orthogonal low-rank embedding

Abstract Electrical motor is a key component in industrial systems. Detecting incipient fault of motor is critical to system reliability. However, the characteristics of faults and normal stages are difficult to distinguish, Meanwhile, the lightweight requirements of the model and the imbalance of the samples also make incipient fault detection challenged. To address these problems, this paper proposes an unsupervised fault detection method combines lightweight network and orthogonal low-rank embedding (OLE). The raw signals are firstly transformed into time-frequency images and fed into lightweight convolution network for feature extraction. Then, the features are clustered into orthogonal subspaces to enhance inter-class separability. Finally, a detection module based on distance metric is designed to identify the incipient fault of motor. The effectiveness of the proposed method is validated on four industrial motor dataset and compared with other methods.