4. related work…
Aemoo Kaminskas & al. LED MORE Seevl Yovisto
Purpose Explorator
y search
Cross-domain
recommendation
Exploratory
search on
ICT domain
Film
recommendati
on
Musical
recommendati
on
Video
exploratory
search
Data DBpedia
EN +
external
services
DBpedia EN
subset
DBpedia +
external
services
DBpedia EN
subset
DBpedia EN
subset
DBpedia
EN+DE
subset
Multi-domain Yes Cross two
domains
No No, cinema No, music Yes
Query Entity
search
Entity selection in
a pre-processed
list
Entity search Entity search Entity
recognition
from Youtube.
Entity
recognition in
keywords
Algorithm EKP
filtered
view
weighted
activation
DBpedia
Ranker
sVSM algo. DBrec
algorithm
Set of
heuristics
Ranking No Yes Yes Yes Yes Yes
Explanations Wikipedia-
based
Path-based No Shared prop. Shared
properties
No
Offline proc. Yes , EKP
part
Yes Yes Yes Yes Yes
goal: domain-independent, customizable, on the fly, remote sources
5. composite interest queries
knowing my interest for X and Y what can I
discover/learn which is related to all these resources?
The Beatles Ken Loach
8. research questions
1. How can we discover linked resources of interest
to be explored ?
2. How to address remote LOD sources for this?
3. How to present and explain the results to the user
for an exploratory objective ?
http://fr.dbpedia.org/sparql
http://es.dbpedia.org/sparql
http://it.dbpedia.org/sparql
11. Album, Band, Film,
Musical Artist, Music
Genre, Person, Radio
Station, Single, Song,
Television Show
Company, Election, Film,
Journalist, Musical
Artist, Newspaper,
Office Holder,
Organisation, Politician,
School, Single,
Television Show, Writer
propagation domain propagation domain
12. research questions
1. How can we discover linked resources of interest
to be explored ?
2. How to address remote LOD sources for it?
3. How to present and explain the results to the user
for an exploratory objective ?
http://fr.dbpedia.org/sparql
http://es.dbpedia.org/sparql
http://it.dbpedia.org/sparql
13. sampling algorithm
1.sparql endpoint = http://xxx/sparql
2.seeds = xxx//The_Beatles, xxx/Ken_Loach
3. compute the propagation domain (w(i,o))
4. find a path between the seeds
5. import path nodes & their neighbors
6. for(i=1; i<=maxPulse; i++){
7. pulse();
8. if(sampleSize <= maxSampleSize){
9. extend the sample
10. }
11.}
19. research questions
1. How can we discover linked resources of interest
to be explored ?
2. How to address remote LOD sources for it?
3. How to present and explain the results to the user
for an exploratory objective ?
http://fr.dbpedia.org/sparql
http://es.dbpedia.org/sparql
http://it.dbpedia.org/sparql
20. Discovery Hub 1.0
1. Start from what you like
or are interested in
3. Be redirected on third-party
platforms to continue the
discovery experience
Book
2.
Explore, understand, disco
ver
…
24. composite queries
• randomly combining Facebook likes of 12 users
• two queries for each participants to judge the top 20 results
- The result interests me [Strongly Disagree … Strongly Agree ]
- The result is unexpected [Strongly Disagree … Strongly Agree ]
Very interesting
Not interesting at all
25. overall
•61.6% of the results were rated as strongly relevant
or relevant by the participants.
•65% of the results were rated as strongly
unexpected or unexpected.
•35.42% of the results were rated both as strongly
relevant or relevant and strongly unexpected or
unexpected.
29. •semantic spreading activation
algorithm coupled to a graph
sampling to address remote
LOD sources.
•faceted browsing and
multiple explanations of
the results.
•on-going extensive user
evaluation
•publicly available http://discoveryhub.co
Discovery Hub : enabling exploratory
search starting from several interests
using linked data sources
1
0,2
0,2 0,2
0,6
0,6
1
0,8
1
30. current work:
- propagation over multiple data sources in parallel.
- redesign of the interface: Discovery Hub 2.0 released
perspective: other applications of semantic spreading
activation