activity
20152020
most citedAEGCN: An Autoencoder-Constrained Graph Convolutional Network

41 citations · 58 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2020★ 41 cited

AEGCN: An Autoencoder-Constrained Graph Convolutional Network

Mingyuan Ma, Sen Na, Hongyu Wang

We propose a novel neural network architecture, called autoencoder-constrained graph convolutional network, to solve node classification task on graph domains. As suggested by its…

cs.IR2018★ 1 cited

The Graph-Based Behavior-Aware Recommendation for Interactive News

Mingyuan Ma, Sen Na, Hongyu Wang +2

Interactive news recommendation has been launched and attracted much attention recently. In this scenario, user's behavior evolves from single click behavior to multiple behaviors…

cs.CR2018★ 9 cited

Graph Theory Towards New Graphical Passwords In Information Networks

Bing Yao, Hui Sun, Hongyu Wang +2

Graphical passwords (GPWs) have been studied over 20 years. We are motivated from QR codes that can be considered GPWs, are successfully applied in today's world. However, one need…

cs.DS2016★ 1 cited

Maximum Leaf Spanning Trees of Growing Sierpinski Networks Models

Bing Yao, Xia Liu, Jin Xu

The dynamical phenomena of complex networks are very difficult to predict from local information due to the rich microstructures and corresponding complex dynamics. On the other ha…

cs.SI2016★ 2 cited

Two Cumulative Distributions For Scale-freeness of Dynamic Networks

Xiaomin Wang, Bing Yao

It is well-known that the scale-free networks are ubiquitous in nature and society and have been one of the hotspot topic in complex networks. Recently, scholars presented a large…

cs.DM2015

Improper Graceful and Odd-graceful Labellings of Graph Theory

Hongyu Wang, Jin Xu, Bing Yao

In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can ind…

cs.SI2015★ 3 cited

The Join of Scale-free Network Models

Xiaomin Wang, Bing Yao, Jin Xu

We focus on constructing the domi-join model by doing the join operation based on two smallest dominating sets of two network models and analysis the properties of domi-join model,…

cs.SI2015★ 1 cited

Growing Network Models Having Part Edges Removed/added Randomly

Bing Yao, Xiaomin Wang, Xia Liu +1

Since network motifs are an important property of networks and some networks have the behaviors of rewiring or reducing or adding edges between old vertices before new vertices ent…