some unrefined ideas on
recommendations
Davide Palmisano - WP3 meeting, 15/09/2009@VU
giving a try to the black layout working largely
offline...apologize for this crap presentation :)
Tuesday, September 15, 2009

a realistic scenario:
an instance of the Beancounter is running
for each user registered on it, we have:
a large RDF graph regarding user’s
activities, friend relationships,
geolocalization and more...
Tuesday, September 15, 2009

not exactly a coherent, meaningful
and immediately usable user
profile
but, for sure, something where mine
interests, topics and user habits
Tuesday, September 15, 2009

not exactly a coherent, meaningful
and immediately usable user
profile
but, for sure, something where mine
interests, topics and user habits
“the treasury is there, you just need to
know where to dig” - anonymous
Tuesday, September 15, 2009

Tuesday, September 15, 2009

Tuesday, September 15, 2009

Tuesday, September 15, 2009

in this case we can reasonably
claim that:
<http://dpalmisano.myopenid.com> foaf:interest
<http://dbpedia.org/resource/Category:Post-rock>
and then recommend him other
stuff with that SKOS subject
Tuesday, September 15, 2009

how to achieve this?
analogically to spiders of a traditional web
crawler we can imagine a set of profilers
Tuesday, September 15, 2009

how to achieve this?
analogically to spiders of a traditional web
crawler we can imagine a set of profilers
according to a predefined set of rules
they explore the links and produce a set
of coherent triples stating explicit
interests
Tuesday, September 15, 2009

a rule like a SPARQL construct:
construct {<http://
dpalmisano.myopenid.com> foaf:interest ?skos}
where { <http://dpalmisano.myopenid.com> ?
r ?s. ?s skos:Subject ?skos }
Tuesday, September 15, 2009

a rule like a SPARQL construct:
construct {<http://
dpalmisano.myopenid.com> foaf:interest ?skos}
where { <http://dpalmisano.myopenid.com> ?
r ?s. ?s skos:Subject ?skos }
and where is the statistical side of
the hybrid algoritm?[1]
[1] NoTube DoW
Tuesday, September 15, 2009

construct {<http://dpalmisano.myopenid.com>
foaf:interest ?skos} where { <http://
dpalmisano.myopenid.com> ?r ?s. ?s
skos:Subject ?skos }
trivially we could consider the number of
incoming links of the SKOS subject ?skos
starting from resources that are linked with
<http://dpalmisano.myopenid.com>
an higher number leads to a more enforced
foaf:interest ?skos
Tuesday, September 15, 2009

from a technology perspective
Hadoop could be a reasonable choice
the links discovery is a pure batch
process that needs heavy computations
Hadoop is mature enough to be
experimented within NoTube
Tuesday, September 15, 2009