BiasedWalk: Biased Sampling for Representation Learning on Graphs
Network embedding algorithms are able to learn latent feature representations of nodes, transforming networks into lower dimensional vector representations. Typical key applications, which have effectively been addressed using network embeddings, include link prediction, multilabel classification and community detection. In this paper, we propose BiasedWalk, a scalable, unsupervised feature learning algorithm that is based on biased random walks to sample context information about each node in the network. Our random-walk based sampling can behave as Breath-First-Search (BFS) and Depth-First-Search (DFS) samplings with the goal to capture homophily and role equivalence between the nodes in the network. We have performed a detailed experimental evaluation comparing the performance of the proposed algorithm against various baseline methods, on several datasets and learning tasks. The experiment results show that the proposed method outperforms the baseline ones in most of the tasks and datasets.
Code (1)
Tasks
Community DetectionGeneral ClassificationLink PredictionNetwork EmbeddingNode ClassificationRepresentation LearningSimilar Papers 제목 키워드 기반
BIGSAGE: unsupervised inductive representation learning of graph via bi-attended sampling and global-biased aggregating
Different kinds of representation learning techniques on graph have shown significant effect in downstream machine learning tasks. Recently, in order to inductively learn representations for graph structures that is unob…
Representation LearningTransfer LearningResidual2Vec: Debiasing graph embedding with random graphs
Graph embedding maps a graph into a convenient vector-space representation for graph analysis and machine learning applications. Many graph embedding methods hinge on a sampling of context nodes based on random walks. Ho…
Graph EmbeddingGraph Representation LearningLink PredictionRepresentation LearningMarkov Chain Truncation for Doubly-Intractable Inference
Computing partition functions, the normalizing constants of probability distributions, is often hard. Variants of importance sampling give unbiased estimates of a normalizer Z, however, unbiased estimates of the reciproc…
Signal Recovery on Graphs: Random versus Experimentally Designed Sampling
We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generaliz…
Graph self-supervised learning based on frequency corruption
Graph self-supervised learning can reduce the need for labeled graph data and has been widely used in recommendation, social networks, and other web applications. However, existing methods often underuse high-frequency s…
Self-Supervised LearningNode ClassificationTransfer Learning