-
Notifications
You must be signed in to change notification settings - Fork 30
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
Decide on graph walking vs EL inference for using taxon constraints to make subsets #2137
Comments
Whelk Strategy@balhoff to fill in |
Relation Graph strategyproponent: @cmungall
Advantages
Disadvantage:
|
The property chains are in RO, right? (although I think Uberon adds some itself). Filters and pre-processing seems to apply to all approaches.
One note on this: this is effectively included in the subset computation, because any existential to an unsatisfiable class is unsatisfiable. But it's not included in "normal" reasoning tasks checking the regular ontology classification. The subset computation is more aggressive. |
@cmungall - your graph strategy looks reasonable to me. It would be good to see a side-by-side comparison. How many additional unwanted classes make it through if we switch to the graph-based approach? Maybe we could compare on the previous Uberon release? It looks like the process with unsatisfiables will never scale, even with ELK, but I wonder if we can get a better sense of scaling with by running some tests with stripped down OWL files as input. I appreciate that we're resource constrained right now for running these tests (unless someone in Chris's group can take this on). I think it's something that devs in my group could work on in the new year. Can we get by for now? Does anyone have a juiced up machine or access to a cluster we could use to run the current release? |
@dosumis if you want @shawntanzk, @anitacaron and me to act on this, we need some specific instructions as it will fall to @anitacaron to take the bulk of this work, and it will occupy her for a few weeks (given she only has a few hours a week to dedicate to this project I mean). From the meeting I gather we need to:
@shawntanzk I think we can handle this after all, its just going to be a slow process. If you want, you can put it up on the board again for next week. |
For the graph strategy, it is easy to explore this using the existing ubergraph instance, which includes relation-graph inferences See this query: Which is hardcoded to return classes EXCLUDED from a human view Scroll up for an explanation of the query Note that for demonstrative purposes, this is highly aggressive. For example, annotation shortcuts like spatially-disjoint-with are treated like any other triples in relation-graph (we should exclude not owl entailed NG in query). If there were homology assertions in any ontology, these would also be propagated over. However, it is trivial to exclude these either at sparql time or as a post-processing step |
@dosumis - could you provide some guidance for how the tech team can proceed with this? thanks |
This issue has not seen any activity in the past 6 months; it will be closed automatically in one year from now if no action is taken. |
Should be reconsidered eventually |
This issue has not seen any activity in the past 6 months; it will be closed automatically one year from now if no action is taken. |
Since last year, this has been a low priority. If it should have a higher priority, please give some action items. |
I think this is covered by the new subset command, we should double check |
This issue has not seen any activity in the past 6 months; it will be closed automatically one year from now if no action is taken. |
Current strategy to make a taxon subset:
Note this has issues if we have:
See
geneontology/go-annotation#3942
@balhoff says he has a solution
Some additional issues with the approach
Outline alternative strategies in this ticket
The text was updated successfully, but these errors were encountered: