Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

metapath strategy: strictly or non strictly? #5

Open
chenhui-bupt opened this issue Jun 10, 2018 · 2 comments
Open

metapath strategy: strictly or non strictly? #5

chenhui-bupt opened this issue Jun 10, 2018 · 2 comments

Comments

@chenhui-bupt
Copy link

for v ∈ V do
MP = MetaPathRandomWalk(G, P, v, l) ;
X = HeterogeneousSkipGram(X, k, MP) ;
end
if the type of v is not equal to the first of your input metapath P, then you will skip it and use the next node v or choose the neighborhood node of v in its appropriate type in P. For example, the metapath is "author-conf-author" and node v is a conf, i wonder should i choose one author node of conf v according the partial path "conf-author" of the metapath P? or we skip the node v until we get an author node to match the metapath "author-conf-author" strictly ?
I appreciate your answer on it, Thanks!

@chenhui-bupt
Copy link
Author

if the random walk must starts with the node belong to the first type in metapath P? can you tell why?
I hope I can express my problem clearly?

@apple2373
Copy link
Owner

You should ask the author of the original paper. I think it's reasonable that the random walk must start with the first type of the meta-path, but I don't know the answer for sure. My implementation does NOT include the random walk generator. The input to my implementation assume you already have random walks following the meta-path.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants