As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Meta-path-based methods for measuring the similarities between nodes in Heterogeneous Information Networks (HINs) have attracted attention from researchers due to excellent performance. However, these methods suffer from some issues: (1) it is difficult for users to provide effective meta-paths of complex HINs; (2) it is inefficient to enumerate all instances of meta-paths. In order to solve the above issues, this paper proposes a novel method, K-order Neighbors based Heterogeneous Graph Neural Network (KN-HGNN), for measuring node similarity. Firstly, KN-HGNN generates meta-paths based on network schema. Then, KN-HGNN obtains the features of nodes by aggregating itself type feature and its k-order neighbors’ type features under the constraints of meta-paths. Finally, KN-HGNN calculates the similarities between nodes based on the features of nodes. The experimental results on real datasets show that KN-HGNN outperforms the baselines.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.