Fast Node Embeddings: Learning Ego-Centric Representations
Representation learning is one of the foundations of Deep Learning and allowed important improvements on several Machine Learning tasks, such as Neural Machine Translation, Question Answering and Speech Recognition. Recent works have proposed new methods for learning representations for nodes and edges in graphs. Several of these methods are based on the SkipGram algorithm, and they usually process a large number of multi-hop neighbors in order to produce the context from which node representations are learned. In this paper, we propose an effective and also efficient method for generating node embeddings in graphs that employs a restricted number of permutations over the immediate neighborhood of a node as context to generate its representation, thus ego-centric representations. We present a thorough evaluation showing that our method outperforms state-of-the-art methods in six different datasets related to the problems of link prediction and node classification, being one to three orders of magnitude faster than baselines when generating node embeddings for very large graphs.
Code (0)
등록된 구현이 없습니다.
Tasks
Link PredictionMachine TranslationNode ClassificationQuestion AnsweringRepresentation Learningspeech-recognitionSpeech RecognitionTranslationSimilar Papers 제목 키워드 기반
Toward Edge-Centric Network Embeddings
Existing network embedding approaches tackle the problem of learning low-dimensional node representations. However, networks can also be seen in the light of edges interlinking pairs of nodes. The broad goal of this pape…
Link PredictionNetwork EmbeddingNCSTR: Node-Centric Decoupled Spatio-Temporal Reasoning for Video-based Human Pose Estimation
Video-based human pose estimation remains challenged by motion blur, occlusion, and complex spatiotemporal dynamics. Existing methods often rely on heatmaps or implicit spatio-temporal feature aggregation, which limits j…
Pose EstimationFast and Accurate Network Embeddings via Very Sparse Random Projection
We present FastRP, a scalable and performant algorithm for learning distributed node representations in a graph. FastRP is over 4,000 times faster than state-of-the-art methods such as DeepWalk and node2vec, while achiev…
Dimensionality ReductionNetwork EmbeddingPecanPy: A parallelized, efficient, and accelerated node2vec in Python
Learning low-dimensional representations (embeddings) of nodes in large graphs is key to applying machine learning on massive biological networks. Node2vec is the most widely used method for node embedding. However, its …
BIG-bench Machine LearningMaking Fast Graph-based Algorithms with Graph Metric Embeddings
The computation of distance measures between nodes in graphs is inefficient and does not scale to large graphs. We explore dense vector representations as an effective way to approximate the same information: we introduc…
Semantic SimilaritySemantic Textual SimilarityWord Sense DisambiguationWord Similarity