Search Mailing List Archives


Limit search to: Subject & Body Subject Author
Sort by: Reverse Sort
Limit to: All This Week Last Week This Month Last Month
Select Date Range     through    

[protege-owl] measurement of the similarity/dissimilarity

Carlo Torniai carlotorniai at gmail.com
Fri Aug 24 11:06:15 PDT 2007


Hi,
I'm interested in the same topic too.
You should take a look at iSPARQL.
http://www.ifi.unizh.ch/ddis/isparql.html

They've released source code this week and it seems that it can fit my needs.
I'll let you know how useful I'll find this implementation.
Cheers.
Carlo

On 8/24/07, Taylor Cowan <taylor_cowan at yahoo.com> wrote:
>
> It's interesting how many people are asking for this...I've recently done
> the same on the jena group.  IMO seems like we're missing a large part of
> the power of "graphs" without standard LCA, max flow, shortest paths, etc.
> and seems strange to me that SPARQL didn't include semantics to solve these
> types of questions.
>
>
>
>
> ----- Original Message ----
> From: Anjum Sheikh <yasheikh at yahoo.com>
> To: protege-owl at lists.stanford.edu
> Sent: Friday, August 24, 2007 12:08:23 PM
> Subject: [protege-owl] measurement of the similarity/dissimilarity
>
>
> Hi All
>
> I  would like to cordially ask the following research question about
> designing algorithm "measurement of the similarity/dissimilarity and edit
> distance" in ontology.
>
> Actually, I can explain in detail what I am going to do. In my research,
> I want to find cultural simialrity and eidt distance. Would you
> please let me know is there any ready source protégé code in ontology
> format for shortest path algorithm?
>
> Very thank you in advance.
>
> Sincerely,
> JAS
>
>
>
>
> I am looking algorithm "measurement of the similarity/dissimilarity and edit
> distance"
>
>
> Very thank you in advance
>
>
> Matt Williams <matthew.williams at cancer.org.uk> wrote:
> There is something called LCA (Which is a related graph-theory concept)
> in Pellet. I don't know much ore than this, though..
>
> HTH,
>
> Matt
>
> Samson Tu wrote:
> > Abolghasem,
> >
> > I don't know of any implementation of shortest-path algorithm for
> > Protege ontology or knowledge base. It would be great if you can
> > implement such algorithm for various graph structures in Protege. For
> > example, you can look at distance between classes along
> > asserted/inferred subclass/superclass relationships, or distance between
> > individuals by following some set of property relationships.
> >
> > SAmson
> >
> > Abolghasem Sadeghi wrote:
> >> *Dear Sir or Madam,*
> >> * *
> >> I would like to cordially ask the following research question about
> >> designing shortest path algorithm in ontology.
> >>
> >> Actually, I can explain in detail what I am going to do. In my research,
> >> I want to implement a route finding algorithm such as Dijkstra's
> >> algorithm by protégé[in owl format or RDF] in my new model. Would you
> >> please let me know is there any ready source protégé code in ontology
> >> format for shortest path algorithm?
> >>
> >> Very thank you in advance.
> >>
> >> Sincerely,
> >> Niaraki
> >
> >
> _______________________________________________
> protege-owl mailing list
> protege-owl at lists.stanford.edu
> https://mailman.stanford.edu/mailman/listinfo/protege-owl
>
> Instructions for unsubscribing:
> http://protege.stanford.edu/doc/faq.html#01a.03
>
>
>
>  ________________________________
>  Sick sense of humor? Visit Yahoo! TV's Comedy with an Edge to see what's
> on, when.
>
>
>
>
>  ________________________________
> Moody friends. Drama queens. Your life? Nope! - their life, your story.
>  Play Sims Stories at Yahoo! Games.
> _______________________________________________
> protege-owl mailing list
> protege-owl at lists.stanford.edu
> https://mailman.stanford.edu/mailman/listinfo/protege-owl
>
> Instructions for unsubscribing:
> http://protege.stanford.edu/doc/faq.html#01a.03
>
>


-- 
==========================================
School of Interactive Arts and Technology
Simon Fraser University Surrey
Central City Tower
250-13450 102 Ave.
Surrey, BC V3T 0A3
Canada
==========================================



More information about the protege-owl mailing list