Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Exploratory search on topics through different perspectives with DBpedia

1,168 views

Published on

Presentation at SEMANTICS2014: http://www.semantics.cc/www.semantics.cc/index.html

Paper: Exploratory search on topics through different perspectives with DBpedia

https://hal.inria.fr/hal-01057031

A promising scenario for combining linked data and search is exploratory search. During exploratory search, the search objective is ill-defined and favorable to discovery. A common limit of the existing linked data based exploratory search systems is that they constrain the exploration through single results selection and ranking schemes. The users can not influence the results to reveal specific aspects of knowledge that interest them. The models and algorithms we propose unveil such knowledge nuances by allowing the exploration of topics through several perspectives. The users adjust important computation parameters through three operations that help retrieving desired exploration perspectives: specification of interest criteria about the topic explored, controlled randomness injection to reveal unexpected knowledge and choice of the processed knowledge source(s). This paper describes the corresponding models, algorithms and the Discovery Hub implementation. It focuses on the three mentioned operations and presents their evaluations.

Published in: Technology

Exploratory search on topics through different perspectives with DBpedia

  1. 1. Exploratory search on topics through different perspectives with DBpedia Nicolas Marie, Fabien Gandon, Alain Giboin, Émilie Palagi COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  2. 2. CONTEXT PROPOSITION EVALUATION CONCLUSION 2 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  3. 3. CONTEXT PROPOSITION EVALUATION CONCLUSION 3 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  4. 4. Search is only a partially solved problem [White, 2009] Ambiguous queries, natural language queries, exploratory search tasks… COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  5. 5. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub 10 blue links paradigm, simple, fast Exploratory search bottleneck
  6. 6. Exploratory search systems are optimized to support exploratory search tasks, common functionalities: Overviews Faceted interfaces Results clustering Low-cost of browsing (going back-and-forth functionalities) Query-suggestions and refinement Serendipitous discoveries provocation In-session of account related memory features COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub
  7. 7. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub Linked data are promising for supporting exploratory search: • new algorithms • new interaction models optimized for exploration.
  8. 8. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub
  9. 9. Discovery Hub Maturity COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  10. 10. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 1 perspective
  11. 11. I want to discover Claude Monet (painter)... In American culture COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub Topics are complex, multifaceted, One entity => multiple perspectives & knowledge nuances Entourage Art. movement In French culture Curiosities…
  12. 12. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. MORE Aemoo
  13. 13. CONTEXT PROPOSITION EVALUATION CONCLUSION 13 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  14. 14. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub The models and algorithms we propose unveil topic knowledge nuances by allowing the exploration of topics through several perspectives. In the graph context of linked data these perspectives correspond to different non exclusive sets of objects and relations that are informative on a topic regarding specific aspects. Flexible querying and data processing
  15. 15. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  16. 16. Building perspectives thanks to spreading activation …… Refer to the papers for the complete formalization COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  17. 17. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  18. 18. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  19. 19. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  20. 20. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  21. 21. Discovery Hub 3 perspective-operations to expose knowledge nuances : • Criteria of interest specification • Controlled randomness injection • Data source selection COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  22. 22. Discovery Hub Criteria of interest specification , dcterms:category, ?x , dcterms:category, ?x COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Classic similarity measure , dcterms:category, ?a | ?b | ?c |... , dcterms:category, ?a | ?b | ?c |... Criteria spec. similarity
  23. 23. Discovery Hub Criteria of interest specification COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  24. 24. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Classic – top 5 artists « French / not impressonist » criteria specification – top 5 artists « Not French / Impressonist » criteria specification – top 5 artists
  25. 25. * r + (1-r)* Chosen level of randomness Randomness injection COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. * r + (1-r)* * r + (1-r)* * r + (1-r)* * r + (1-* r +
  26. 26. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub Local Kgram instance Data source selection dbpedia.org/sparql de.dbpedia.org/sparql es.dbpedia.org/sparql fr.dbpedia.org/sparql it.dbpedia.org/sparql
  27. 27. Discovery Hub Data source selection COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  28. 28. CONTEXT PROPOSITION EVALUATION CONCLUSION 28 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  29. 29. Evaluated algorithm versions •Basis algorithm of Discovery Hub •Personalized algorithm through criteria specification •Randomized algorithm, with 0.5 threshold •Highly randomized algorithm (Highly R.), with 1.0 threshold COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub
  30. 30. • Hypothesis 1: Users who specify their criteria of interest about a topic find the results of the search more relevant. • Hypothesis 2: Users who specify their criteria of interest about a topic do not find the results of the search less novel. • Hypothesis 3: The stronger is the level of randomness the more surprising the results are for the users. • Hypothesis 4: Even if the level of surprise is high, the majority of the top results are still relevant to the users. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub
  31. 31. Discovery Hub 푃푒푟푠표푛푎푙푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > [퐵푎푠푖푠 ; 퐼푛푡푒푟푒푠푡] " ; 퐷푖푠푡푎푛푐푒 < [ " ; 퐷푖푠푡푎푛푐푒] 푃푒푟푠표푛푎푙푖푧푒푑 ; 푆푢푝푟푖푠푖푛푔 푅푒푠푢푙푡 > [퐵푎푠푖푠 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡] [ " ; Surprising Relation] > [ " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛] COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 퐻3 퐻1 퐻2 퐻푖푔ℎ푙푦 푅. ; 푆푢푝푟푖푠푖푛푔 푅푒푠푢푙푡 > 푅푎푛푑표푚푖푧푒푑 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡 > [퐵푎푠푖푠 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡] [ " ; Suprising Relation] > " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛 > [ " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛] (Highly R. : Highly Randomized) 퐻4 퐻푖푔ℎ푙푦 푅푎푛푑표푚푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > 퐴푣푒푟푎푔푒 (2,5) 푅푎푛푑표푚푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > 퐴푣푒푟푎푔푒 (2,5)
  32. 32. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. A « good » result in ESS is… Our definitions Chosen metrics : Questions (Likert Scale) … A surprising result A result is surprising if : • You discovered an unknown resource or relation • You discovered something unexpected Surprising Result This result is suprising ? Surprising Relation This relation between the topic searched and the result is surprising ? … An intersting result A result is interesting if : • You think it is similar to the topic explored • You think you will remind or reuse it Interesting Result This result is interesting ? Distance between the Result and the topic searched This result is too distant from the topic searched ? Discovery Hub
  33. 33. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub • 16 participants • Phase 1 : Selection of 2 topics in a list of 20 queries randomly choose in the query log of Discovery Hub - Information Visualization - Serge Gainsbourg (french singer) • Phase 2 : Specification of the categories of interest • Phase 3 : User Test (~1h) - Before the test - Interview (name, age, do they know Discovery Hub ?,…) - Presentation of Discovery Hub and the objective of the test - Presentation of the questions and simulation
  34. 34. H1 : Users who specify their criteria of interest about a topic find the results of the search more relevant. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 퐻1 푃푒푟푠표푛푎푙푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > [퐵푎푠푖푠 ; 퐼푛푡푒푟푒푠푡] " ; 퐷푖푠푡푎푛푐푒 < [ " ; 퐷푖푠푡푎푛푐푒]
  35. 35. H2: Users who specify their criteria of interest about a topic do not find the results of the search less novel COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 퐻2 푃푒푟푠표푛푎푙푖푧푒푑 ; 푆푢푝푟푖푠푖푛푔 푅푒푠푢푙푡 > [퐵푎푠푖푠 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡] [ " ; Surprising Relation] > [ " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛]
  36. 36. H3: The stronger is the level of randomness the more surprising the results are for the users COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 퐻3 퐻푖푔ℎ푙푦 푅. ; 푆푢푝푟푖푠푖푛푔 푅푒푠푢푙푡 > 푅푎푛푑표푚푖푧푒푑 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡 > [퐵푎푠푖푠 ; 푆푢푟푝푟푖푠푖푛푔 푅푒푠푢푙푡] [ " ; Suprising Relation] > " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛 > [ " ; 푆푢푟푝푟푖푠푖푛푔 푅푒푙푎푡푖표푛] (Highly R. : Highly Randomized)
  37. 37. H4: Even if the level of surprise is high, the majority of the top results are still relevant to the users COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. 퐻4 퐻푖푔ℎ푙푦 푅푎푛푑표푚푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > 퐴푣푒푟푎푔푒 (2,5) 푅푎푛푑표푚푖푧푒푑 ; 퐼푛푡푒푟푒푠푡 > 퐴푣푒푟푎푔푒 (2,5)
  38. 38. CONTEXT PROPOSITION EVALUATION CONCLUSION 38 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  39. 39. COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub •We proposed a framework to enable multi-perspective exploratory search: - Formalization - Implementation - Evaluation • 3 operators : criteria spec., randomization, data selection • Evaluations globally positive, slight adjustements needed • Interesting propositions from the reviewers, thank you
  40. 40. Thank you ! Questions ? http://semreco.inria.fr werarediscoveryhub@gmail.com COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. Discovery Hub

×