Representation learning of knowledge bases (KBs) aims to embed both entities and
relations into a low-dimensional space. Most existing methods only consider direct relations …

Google's PageRank method was developed to evaluate the importance of web-pages via
their link structure. The mathematics of PageRank, however, are entirely general and apply …

A novel sub-Markov random walk (subRW) algorithm with label prior is proposed for seeded
image segmentation, which can be interpreted as a traditional random walker on a graph …

To enjoy more social network services, users nowadays are usually involved in multiple
online social media sites at the same time. Across these social networks, users can be …

The first decade of Genome Wide Association Studies (GWAS) has uncovered a wealth of
disease-associated variants. Two important derivations will be the translation of this …

Given a large network, local community detection aims at finding the community that
contains a set of query nodes and also maximizes (minimizes) a goodness metric. This …

We consider the diffusive motion of a particle performing a random walk with Lévy
distributed jump lengths and subject to a resetting mechanism, bringing the walker to an …

The Heterogeneous Information Network (HIN) is a graph data model in which nodes and
edges are annotated with class and relationship labels. Large and complex datasets, such …

Recommender systems can suffer from data sparsity and cold start issues. However, social
networks, which enable users to build relationships and create different types of items …

Given a large graph, like a computer communication network, which k nodes should we
immunize (or monitor, or remove), to make it as robust as possible against a computer virus …