Skip to main content

SEED V3: Entity-Oriented Exploratory Search in Knowledge Graphs on Tablets

  • Conference paper
  • First Online:
Advances in Conceptual Modeling (ER 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11158))

Included in the following conference series:

  • 1181 Accesses

Abstract

Entity-oriented information access is becoming a key enabler for next-generation information retrieval and exploration systems. Previously, researchers have demonstrated that knowledge graphs allow the exploitation of semantic correlation among entities to improve information access. However, less attention is devoted to user interfaces of tablets for exploring knowledge graphs effectively and efficiently. In this paper, we design and implement a system called SEED to support entity-oriented exploratory search in knowledge graphs on tablets. It utilizes a dataset of hundreds of thousands of film-related entities extracted from DBpedia V3.9, and applies the knowledge embedding derived from a graph embedding model to rank entities and their relevant aspects, as well as explaining the correlation among entities via their links. Moreover, it supports touch-based interactions for formulating queries rapidly.

This work is supported by the National Science Foundation of China under grants No. 61472426, U1711261, 61432006.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
eBook
USD 39.99
Price excludes VAT (USA)
Softcover Book
USD 54.99
Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008)

    Article  Google Scholar 

  2. Bordes, A., Usunier, N., García-Durán, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: NIPS, pp. 2787–2795 (2013)

    Google Scholar 

  3. Chen, J., Chen, Y., Du, X., Zhang, X., Zhou, X.: SEED: a system for entity exploration and debugging in large-scale knowledge graphs. In: ICDE, pp. 1350–1353 (2016)

    Google Scholar 

  4. Chen, J., Jacucci, G., Chen, Y., Ruotsalo, T.: SEED: entity oriented information search and exploration. In: IUI, pp. 137–140 (2017)

    Google Scholar 

  5. Dong, X., et al.: Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: KDD, pp. 601–610 (2014)

    Google Scholar 

  6. Garcia-Molina, H., Ullman, J.D., Widom, J.: Database System Implementation. Prentice-Hall, Upper Saddle River (2000)

    Google Scholar 

  7. Meij, E., Balog, K., Odijk, D.: Entity linking and retrieval for semantic search. In: WSDM, pp. 683–684 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yueguo Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, J., Shao, M., Chen, Y., Du, X. (2018). SEED V3: Entity-Oriented Exploratory Search in Knowledge Graphs on Tablets. In: Woo, C., Lu, J., Li, Z., Ling, T., Li, G., Lee, M. (eds) Advances in Conceptual Modeling. ER 2018. Lecture Notes in Computer Science(), vol 11158. Springer, Cham. https://doi.org/10.1007/978-3-030-01391-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-01391-2_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-01390-5

  • Online ISBN: 978-3-030-01391-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics