Knowledge Graph for Cultural Heritage

A special issue of Heritage (ISSN 2571-9408).

Deadline for manuscript submissions: closed (1 May 2021) | Viewed by 1117

Special Issue Editor


E-Mail Website
Guest Editor
Knowledge Engineering Laboratory, Department of Computer Engineering, Chung-Ang University, 84 Heukseok, Dongjak, Seoul 156-756, Republic of Korea
Interests: artificial intelligence; big data; data mining; social networks; digital storytelling
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Knowledge graphs (KG) are graph-driven representations of real-world entities along with their semantic attributes and their relationships. Over the past few years, we have observed the emergence of many state-of-the-art knowledge graphs, some of which are Cyc and OpenCyc, Freebase, DBpedia, Wikidata, YAGO, and NELL. However, standalone knowledge graphs are of no use unless we integrate them into smart systems. In several well-known industrial services (e.g., Google’s Knowledge Graph, Microsoft’s Satori, and Facebook’s Graph Search), knowledge graphs became a backbone for helping these organizations as well as their users in fully discovering social knowledge. In particular, in cultural heritage, these systems are able to provide hyper-precise information in various applications (e.g., semantic search engine, complex question answering, and users’ behavior comprehension). Regarding the importance of smart systems with knowledge graphs, the increasing presence of innovative research has been recognized to tackle different kinds of cultural heritage domains.

Our main goal is to look for high-quality studies that focus on both theoretical papers and practical applications of knowledge graphs for cultural heritage. In particular, this Special Issue aims at gathering advanced research to support constructing state-of-the-art smart systems with knowledge graphs, including two main topics of interest: (1) cutting-edge techniques for constructing, managing, and analyzing knowledge graphs, ensuring their coverage, correctness, and freshness, and (2) useful applications of knowledge graphs for providing our society with prominent services for cultural heritage domains.

Dr. Jason J. Jung
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Heritage is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Cutting-edge techniques for constructing
  • Managing and analyzing knowledge graphs
  • Ensuring their coverage
  • Correctness and freshness
  • Useful applications of knowledge graphs for providing our society with prominent services for cultural heritage domains

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop