activity
20192022
most citedLearning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples

43 citations · 93 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LG202243 cited

Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samples

Wei Duan, Junyu Xuan, Maoying Qiao +1

Graph Convolutional Neural Networks (GCNs) has been generally accepted to be an effective tool for node representations learning. An interesting way to understand GCNs is to think…

cs.LG2020

Repulsive Mixture Models of Exponential Family PCA for Clustering

Maoying Qiao, Tongliang Liu, Jun Yu +2

The mixture extension of exponential family principal component analysis (EPCA) was designed to encode much more structural information about data distribution than the traditional…

cs.LG2020

Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach

Maoying Qiao, Jun Yu, Wei Bian +1

Community is a common characteristic of networks including social networks, biological networks, computer and information networks, to name a few. Community detection is a basic st…

cs.SI201925 cited

Adapting Stochastic Block Models to Power-Law Degree Distributions

Maoying Qiao, Jun Yu, Wei Bian +2

Stochastic block models (SBMs) have been playing an important role in modeling clusters or community structures of network data. But, it is incapable of handling several complex fe…

cs.LG201925 cited

Diversified Hidden Markov Models for Sequential Labeling

Maoying Qiao, Wei Bian, Richard Yida Xu +1

Labeling of sequential data is a prevalent meta-problem for a wide range of real world applications. While the first-order Hidden Markov Models (HMM) provides a fundamental approac…