Hussein, Rana Yang, Dingqi Cudré-Mauroux, Philippe 2018 The graph embedding paradigm projects nodes of a graph into a vector space, which can facilitate various downstream graph analysis tasks such as node classification and clustering. To efficiently learn node embeddings from a graph, graph embedding techniques usually preserve the proximity between node pairs sampled from the graph using random walks. In the context of a heterogeneous graph, which contains nodes from different domains, classical random walks are biased towards highly visible domains where nodes are associated with a dominant number of paths. To overcome this bias, existing heterogeneous graph embedding techniques typically rely on meta-paths (i.e., fixed sequences of node types) to guide random walks. However, using these meta-paths either requires prior knowledge from domain experts for optimal meta-path selection, or requires extended computations to combine all meta- paths shorter than a predefined length. In this paper, we propose an alternative solution that does not involve any meta-path. Specifically, we propose JUST, a heterogeneous graph embedding technique using random walks with JUmp and STay strategies to overcome the aforementioned bias in an more efficient manner. JUST can not only gracefully balance between homogeneous and heterogeneous edges, it can also balance the node distribution over different domains (i.e., node types). By conducting a thorough empirical evaluation of our method on three heterogeneous graph datasets, we show the superiority of our proposed technique. In particular, compared to a state-of-the-art heterogeneous graph embedding technique Hin2vec, which tries to optimally combine all meta-paths shorter than a predefined length, our technique yields better results in most experiments, with a dramatically reduced embedding learning time (about 3x speedup). application/pdf https://folia.unifr.ch/global/documents/307801 https://folia.unifr.ch/documents/307801/files/cud_amp.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1145/3269206.3271777 info:eu-repo/semantics/openAccess License undefined Proceedings of the 27th ACM International Conference on Information and Knowledge Management. - 2018, p. 437–446 info:eu-repo/classification/udc/004 Are meta-paths necessary?: revisiting heterogeneous graph embeddings http://purl.org/coar/resource_type/c_5794