-
Notifications
You must be signed in to change notification settings - Fork 10
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
Improve introduction sections on related works #15
Comments
To get the ball rolling here is a list of papers that describe how two nodes are related via similarity score (cosine or some variant)
The last one is metapaths rather than nodes, but this coves many studies. One question to think about is how many different node and edge types are needed for a network to be considered heterogeneous? If it is greater than two then some of these sources will have to be removed as they only use two node types with three edge categories. |
Do these studies output how two nodes are related or whether two nodes are related? Whether could be something like ranked node pairs or a probability of being related. How is harder and requires an explanation for each prediction.
Anything more than one node type and one edge type is heterogeneous. Perhaps more important than the network the study applied the approach to is the theoretical limits of the approach. If the approach cannot scale to many node and edge types, then that is a major limitation. Many approaches are hardcoded to a specific metagraph. I imagine it is sometimes challenging to know whether a method can scale and the best evidence is the metagraphs of the networks it has been applied to. |
Oh shoot. I was under the impression you were looking for papers that stated whether two nodes are related. Will be back on the hunt. Still might be worth mentioning some of the above papers though. |
These are still interesting as examples of how connectivity search achieves something the prior works could not. So good to compile them and keep an eye out for whether they can explain how two nodes are related. Also good to keep an eye out for whether they require a training set (or gold standard) of known relationships. |
Okay round two. Here are papers that should be more along the lines of explaining how to nodes are related. The majority of these papers are focused on social media and general knowledge rather than biology.
|
@danich1, fantastic research! It is challenging to discover these studies since they're from a different field of study. A rare study cites across domains... and it is a sign of rigor. Do all of these studies apply to hetnets? Or are some restricted to simple or bipartite graphs? It can be hard to tell sometimes. For I think a paragraph that cites these studies would be extremely helpful for our introduction. It is okay to group multiple studies in a single sentence of explanation if their approaches and designs are similar. We also might want a paragraph on the "whether" two nodes are related, but with the clear caveat that these studies don't address the how. @danich1 do you think you could take the lead on these paragraphs? |
Sounds good to me!
Good question. Will need to dive deeper into these papers to confirm; however, I'll make sure the manuscript text reflects the answer to these questions. |
Currently we have a few mentions of related works in the introduction other works section.
The introduction currently describes Hetionet and Rephetio, but doesn't do a great job discussing other studies. It's hard to first figure out what studies are sufficiently related and worthy of mention, especially since terminology varies wildly between disciplines.
@danich1 offered to help, since he's more up to date on the latest literature here.
The top priority is identifying any pre-existing studies on detecting how two nodes are related in a hetnet. If those studies communicate themselves sufficiently and seem to be methodology sound, we should consider them for citation.
Ideally, we can group preexisting studies into sensible categories of how they relate to this work.
@danich1 do you want to take the lead here?
The text was updated successfully, but these errors were encountered: