scholarly journals Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity

2019 ◽  
Author(s):  
Yunsheng Bai ◽  
Hao Ding ◽  
Yang Qiao ◽  
Agustin Marinovic ◽  
Ken Gu ◽  
...  
Keyword(s):  
Neural Network ◽  
Vector Space ◽  
General Framework ◽  
Representation Learning ◽  
Generation Mechanism ◽  
Graph Visualization ◽  
Graph Classification ◽  
Training Set ◽  
Multi Scale ◽  
Novel Approach

We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGraphEmb, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Scale Node Attention (MSNA), is proposed. Experiments on five real graph datasets show that UGraphEmb achieves competitive accuracy in the tasks of graph classification, similarity ranking, and graph visualization.

scholarly journals Multi-Scale Neural Network for EEG Representation Learning in BCI

2021 ◽  
Vol 16 (2) ◽  
pp. 31-45
Author(s):  
Wonjun Ko ◽  
Eunjin Jeon ◽  
Seungwoo Jeong ◽  
Heung-Il Suk
Keyword(s):  
Neural Network ◽  
Representation Learning ◽  
Multi Scale

scholarly journals Multi-scale Hierarchical Residual Network for Dense Captioning

2019 ◽  
Vol 64 ◽  
pp. 181-196 ◽  
Author(s):  
Yan Tian ◽  
Xun Wang ◽  
Jiachen Wu ◽  
Ruili Wang ◽  
Bailin Yang
Keyword(s):  
Neural Network ◽  
Recurrent Neural Network ◽  
Feature Space ◽  
Image Feature ◽  
Feature Maps ◽  
Residual Network ◽  
Multi Scale ◽  
Residual Learning ◽  
Novel Approach ◽  
Great Progress

Recent research on dense captioning based on the recurrent neural network and the convolutional neural network has made a great progress. However, mapping from an image feature space to a description space is a nonlinear and multimodel task, which makes it difficult for the current methods to get accurate results. In this paper, we put forward a novel approach for dense captioning based on hourglass-structured residual learning. Discriminant feature maps are obtained by incorporating dense connected networks and residual learning in our model. Finally, the performance of the approach on the Visual Genome V1.0 dataset and the region labelled MS-COCO (Microsoft Common Objects in Context) dataset are demonstrated. The experimental results have shown that our approach outperforms most current methods.

scholarly journals Independence Promoted Graph Disentangled Networks

2020 ◽  
Vol 34 (04) ◽  
pp. 4916-4923
Author(s):  
Yanbei Liu ◽  
Xiao Wang ◽  
Shu Wu ◽  
Zhitao Xiao
Keyword(s):  
Real World ◽  
Experimental Studies ◽  
Representation Learning ◽  
Graph Visualization ◽  
Graph Classification ◽  
Latent Factors ◽  
Convolutional Networks ◽  
Network Applications ◽  
The Arts ◽  
Latent Representations

We address the problem of disentangled representation learning with independent latent factors in graph convolutional networks (GCNs). The current methods usually learn node representation by describing its neighborhood as a perceptual whole in a holistic manner while ignoring the entanglement of the latent factors. However, a real-world graph is formed by the complex interaction of many latent factors (e.g., the same hobby, education or work in social network). While little effort has been made toward exploring the disentangled representation in GCNs. In this paper, we propose a novel Independence Promoted Graph Disentangled Networks (IPGDN) to learn disentangled node representation while enhancing the independence among node representations. In particular, we firstly present disentangled representation learning by neighborhood routing mechanism, and then employ the Hilbert-Schmidt Independence Criterion (HSIC) to enforce independence between the latent representations, which is effectively integrated into a graph convolutional framework as a regularizer at the output layer. Experimental studies on real-world graphs validate our model and demonstrate that our algorithms outperform the state-of-the-arts by a wide margin in different network applications, including semi-supervised graph classification, graph clustering and graph visualization.

scholarly journals Geometric property-based convolutional neural network for indoor object detection

2021 ◽  
Vol 18 (1) ◽  
pp. 172988142199332
Author(s):  
Xintao Ding ◽  
Boquan Li ◽  
Jinbao Wang
Keyword(s):  
Neural Network ◽  
Object Detection ◽  
Convolutional Neural Network ◽  
Geometric Property ◽  
Ground Truth ◽  
Geometric Constraints ◽  
Depth Information ◽  
Training Set ◽  
Object Knowledge ◽  
The Mean

Indoor object detection is a very demanding and important task for robot applications. Object knowledge, such as two-dimensional (2D) shape and depth information, may be helpful for detection. In this article, we focus on region-based convolutional neural network (CNN) detector and propose a geometric property-based Faster R-CNN method (GP-Faster) for indoor object detection. GP-Faster incorporates geometric property in Faster R-CNN to improve the detection performance. In detail, we first use mesh grids that are the intersections of direct and inverse proportion functions to generate appropriate anchors for indoor objects. After the anchors are regressed to the regions of interest produced by a region proposal network (RPN-RoIs), we then use 2D geometric constraints to refine the RPN-RoIs, in which the 2D constraint of every classification is a convex hull region enclosing the width and height coordinates of the ground-truth boxes on the training set. Comparison experiments are implemented on two indoor datasets SUN2012 and NYUv2. Since the depth information is available in NYUv2, we involve depth constraints in GP-Faster and propose 3D geometric property-based Faster R-CNN (DGP-Faster) on NYUv2. The experimental results show that both GP-Faster and DGP-Faster increase the performance of the mean average precision.

W-MMP2Vec: Topic-driven network embedding model for link prediction in content-based heterogeneous information network

2021 ◽  
Vol 25 (3) ◽  
pp. 711-738
Author(s):  
Phu Pham ◽  
Phuc Do
Keyword(s):  
Link Prediction ◽  
Representation Learning ◽  
Information Network ◽  
Network Embedding ◽  
Heterogeneous Information Network ◽  
Heterogeneous Information ◽  
Learning Framework ◽  
Novel Approach ◽  
Proposed Model ◽  
Meta Path

Link prediction on heterogeneous information network (HIN) is considered as a challenge problem due to the complexity and diversity in types of nodes and links. Currently, there are remained challenges of meta-path-based link prediction in HIN. Previous works of link prediction in HIN via network embedding approach are mainly focused on exploiting features of node rather than existing relations in forms of meta-paths between nodes. In fact, predicting the existence of new links between non-linked nodes is absolutely inconvincible. Moreover, recent HIN-based embedding models also lack of thorough evaluations on the topic similarity between text-based nodes along given meta-paths. To tackle these challenges, in this paper, we proposed a novel approach of topic-driven multiple meta-path-based HIN representation learning framework, namely W-MMP2Vec. Our model leverages the quality of node representations by combining multiple meta-paths as well as calculating the topic similarity weight for each meta-path during the processes of network embedding learning in content-based HINs. To validate our approach, we apply W-TMP2Vec model in solving several link prediction tasks in both content-based and non-content-based HINs (DBLP, IMDB and BlogCatalog). The experimental outputs demonstrate the effectiveness of proposed model which outperforms recent state-of-the-art HIN representation learning models.

Sign in / Sign up

Export Citation Format

Share Document