some unrefined ideas on recommendations
DESCRIPTION
a bunch of raw slides describing a possible mechanisms to allow music bands recommendations using Semantic Web technologies and Linked Data stuff.Informal presentation done at the 3rd project meeting of the NoTube project (http://notube.tv)TRANSCRIPT
![Page 1: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/1.jpg)
some unrefined ideas on recommendations
giving a try to the black layout working largely offline...apologize for this crap presentation :)
Davide Palmisano - WP3 meeting, 15/09/2009@VU
Tuesday, September 15, 2009
![Page 2: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/2.jpg)
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
![Page 3: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/3.jpg)
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
![Page 4: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/4.jpg)
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
![Page 5: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/5.jpg)
Tuesday, September 15, 2009
![Page 6: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/6.jpg)
Tuesday, September 15, 2009
![Page 7: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/7.jpg)
Tuesday, September 15, 2009
![Page 8: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/8.jpg)
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
![Page 9: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/9.jpg)
how to achieve this?
analogically to spiders of a traditional web crawler we can imagine a set of profilers
Tuesday, September 15, 2009
![Page 10: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/10.jpg)
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
![Page 11: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/11.jpg)
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
![Page 12: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/12.jpg)
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 DoWTuesday, September 15, 2009
![Page 13: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/13.jpg)
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
![Page 14: some unrefined ideas on recommendations](https://reader033.vdocuments.site/reader033/viewer/2022051514/54b7a11e4a795993718b46f3/html5/thumbnails/14.jpg)
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