Hello everyone, i start begging pardon if it's not the right place to ask this.... anyway: I'm developing a software that navigates dbpedia instances and returns the node that satisfies certain requirements. Those requirements incude the "topological" distance between the actual node and another specified node. As you surely understand this distance is really intensive to compute, so i'm searching for new ways to get something similar but less expensive. I thought i could use the DBpedia ontology and to do something like this:
1 map the actual node to his dbpedia ontology class; 2 map the specified node to his class; 3 calculate the distance between the classes in the ontology (wich is smaller than the set of instances). I can do this because i don't need the full path between the nodes but just a value that represents the distance (in this case i think i can call it "semantic distance"). Now, i don't know where to start from for doing this (my software is in java). Wich dump should i use? Anyone knows reliable opensource libraries for managing owl (i never used it before so i'm really new to it)? Is there some kind of limitation i'm not aware of that can stop me doing what i described?I think i should use the "ontology types" dataset for the mappings... If someone can clarify everything for me i would be really grateful. Regards, Piero ------------------------------------------------------------------------------ Enter the BlackBerry Developer Challenge This is your chance to win up to $100,000 in prizes! For a limited time, vendors submitting new applications to BlackBerry App World(TM) will have the opportunity to enter the BlackBerry Developer Challenge. See full prize details at: http://p.sf.net/sfu/Challenge _______________________________________________ Dbpedia-discussion mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/dbpedia-discussion
