Roberto Mirizzi wrote: > Il 07/05/2010 15:51, Kingsley Idehen ha scritto: >>> In [1] we compute the similarity value among pairs of resources by >>> applying an hybrid approach to rank node exploiting both the graph >>> structure of the underlying RDF DBpedia graph and querying several >>> external information sources (search engines and social tagging >>> system). I think it can be useful when you need to know resources >>> that are more relevant than other w.r.t. a given "query". >>> >>> [1] R. Mirizzi, A. Ragone, T. Di Noia, E. Di Sciascio. Ranking the >>> Linked Data: the case of DBpedia. 10th International Conference on >>> Web Engineering (ICWE). 2010. >>> http://sisinflab.poliba.it/publications/2010/MRDD10b/ >>> >> >> >> How do you pull in the external data sources? > > We ask search engines through their APIs, looking for some > co-occurrence-like/google-similarity-distance-like measure between two > DBpedia resources. >
We do this sort of thing in our sponger cartridges, so it really comes down to simply slotting this into Virtuoso via the Entity Rank customization capability. As you can imagine, this feature is quite esoteric, hence the customization slot etc.. -- Regards, Kingsley Idehen President & CEO OpenLink Software Web: http://www.openlinksw.com Weblog: http://www.openlinksw.com/blog/~kidehen Twitter/Identi.ca: kidehen ------------------------------------------------------------------------------ _______________________________________________ Dbpedia-discussion mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/dbpedia-discussion
