Deep convolutional adversarial graph autoencoder using positive pointwise mutual information for graph embedding

Graph embedding aims to map the high-dimensional nodes to a low-dimensional space and learns the graph relationship from its latent representations.Most existing graph embedding methods focus on the topological structure of graph data,but ignore the semantic information of graph data,which results in the unsatisfied performance in practical applications.To overcome the problem,this paper proposes a novel deep convolutional adversarial graph autoencoder(GAE)model.To embed the semantic information between nodes in the graph data,the random walk strategy is first used to construct the positive pointwise mutual information(PPMI)matrix,then,graph convolutional net-work(GCN)is employed to encode the PPMI matrix and node content into the latent representation.Finally,the learned latent representation is used to reconstruct the topological structure of the graph data by decoder.Furthermore,the deep convolutional adversarial training algorithm is introduced to make the learned latent representation conform to the prior distribution better.The state-of-the-art experimental results on the graph data validate the effectiveness of the proposed model in the link prediction,node clustering and graph visualization tasks for three standard datasets,Cora,Citeseer and Pubmed.

A graph autoencoder network to measure the geometric similarity of drainage networks in scaling transformation

Similarity measurement has been a prevailing research topic geographic information science.Geometric similarity measurement inin scaling transformation(GSM_ST)is critical to ensure spatial data quality while balancing detailed information with distinctive features.However,GSM_ST is an uncertain problem due to subjective spatial cognition,global and local concerns,and geometric complexity.Traditional rule-based methods considering multiple consistent conditions require subjective adjustments to characteristics and weights,leading to poor robustness in addressing GSM_ST.This study proposes an unsupervised representation learning framework for automated GSM_ST,using a Graph Autoencoder Network(GAE)and drainage networks as an example.The framework involves constructing a drainage graph,designing the GAE architecture for GSM_ST,and using Cosine similarity to measure similarity based on the GAE-derived drainage embeddings in different scales.We perform extensive experiments and compare methods across 71 drainage networks duringfive scaling transformations.The results show that the proposed GAE method outperforms other methods with a satisfaction ratio of around 88%and has strong robustness.Moreover,our proposed method also can be applied to other scenarios,such as measuring similarity between geographical entities at different times and data from different datasets.

GAEBic:A Novel Biclustering Analysis Method for miRNA-Targeted Gene Data Based on Graph Autoencoder

Unlike traditional clustering analysis,the biclustering algorithm works simultaneously on two dimensions of samples(row)and variables(column).In recent years,biclustering methods have been developed rapidly and widely applied in biological data analysis,text clustering,recommendation system and other fields.The traditional clustering algorithms cannot be well adapted to process high-dimensional data and/or large-scale data.At present,most of the biclustering algorithms are designed for the differentially expressed big biological data.However,there is little discussion on binary data clustering mining such as miRNA-targeted gene data.Here,we propose a novel biclustering method for miRNA-targeted gene data based on graph autoencoder named as GAEBic.GAEBic applies graph autoencoder to capture the similarity of sample sets or variable sets,and takes a new irregular clustering strategy to mine biclusters with excellent generalization.Based on the miRNA-targeted gene data of soybean,we benchmark several different types of the biclustering algorithm,and find that GAEBic performs better than Bimax,Bibit and the Spectral Biclustering algorithm in terms of target gene enrichment.This biclustering method achieves comparable performance on the high throughput miRNA data of soybean and it can also be used for other species.

Deep anomaly detection in horizontal axis wind turbines using GraphConvolutional Autoencoders for Multivariate Time series

Wind power is one of the fastest-growing renewable energy sectors instrumental in the ongoing decarbonizationprocess. However, wind turbines are subjected to a wide range of dynamic loads which can cause more frequentfailures and downtime periods, leading to ever-increasing attention to effective Condition Monitoring strategies.In this paper, we propose a novel unsupervised deep anomaly detection framework to detect anomalies in windturbines based on SCADA data. We introduce a promising neural architecture, namely a Graph ConvolutionalAutoencoder for Multivariate Time series, to model the sensor network as a dynamical functional graph. Thisstructure improves the unsupervised learning capabilities of Autoencoders by considering individual sensormeasurements together with the nonlinear correlations existing among signals. On this basis, we developeda deep anomaly detection framework that was validated on 12 failure events occurred during 20 months ofoperation of four wind turbines. The results show that the proposed framework successfully detects anomaliesand anticipates SCADA alarms by outperforming other two recent neural approaches.

A hybrid data-driven and mechanism-based method for vehicle trajectory prediction

Ensuring the safe and efficient operation of self-driving vehicles relies heavily on accurately predicting their future trajectories.Existing approaches commonly employ an encoder-decoder neural network structure to enhance information extraction during the encoding phase.However,these methods often neglect the inclusion of road rule constraints during trajectory formulation in the decoding phase.This paper proposes a novel method that combines neural networks and rule-based constraints in the decoder stage to improve trajectory prediction accuracy while ensuring compliance with vehicle kinematics and road rules.The approach separates vehicle trajectories into lateral and longitudinal routes and utilizes conditional variational autoencoder(CVAE)to capture trajectory uncertainty.The evaluation results demonstrate a reduction of 32.4%and 27.6%in the average displacement error(ADE)for predicting the top five and top ten trajectories,respectively,compared to the baseline method.