Your SlideShare is downloading. ×
some unrefined ideas on recommendations
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Introducing the official SlideShare app

Stunning, full-screen experience for iPhone and Android

Text the download link to your phone

Standard text messaging rates apply

some unrefined ideas on recommendations

1,358
views

Published on

a bunch of raw slides describing a possible mechanisms to allow music bands recommendations using Semantic Web technologies and Linked Data stuff. …

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)

Published in: Technology

0 Comments
2 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total Views
1,358
On Slideshare
0
From Embeds
0
Number of Embeds
1
Actions
Shares
0
Downloads
21
Comments
0
Likes
2
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. 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
  • 2. 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
  • 3. 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
  • 4. 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
  • 5. Tuesday, September 15, 2009
  • 6. Tuesday, September 15, 2009
  • 7. Tuesday, September 15, 2009
  • 8. 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
  • 9. how to achieve this? analogically to spiders of a traditional web crawler we can imagine a set of profilers Tuesday, September 15, 2009
  • 10. 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
  • 11. 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
  • 12. 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
  • 13. 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
  • 14. 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