German Tourism Knowledge Graph

As an important infrastructure in the era of big data, the knowledge graph can integrate and manage data resources. Therefore, the construction of tourism knowledge graphs with wide coverage and of high quality in terms of information from the perspective of tourists’ needs is an effective solution to the problem of information clutter in the tourism field. This paper first analyzes the current state of domestic and international research on constructing tourism knowledge graphs and highlights the problems associated with constructing knowledge graphs, which are that they are time-consuming, laborious and have a single function. In order to make up for these shortcomings, this paper proposes a set of systematic methods to build a tourism knowledge graph. This method integrates the BiLSTM and BERT models and combines these with the attention mechanism. The steps of this methods are as follows: First, data preprocessing is carried out by word segmentation and removing stop words; second, after extracting the features and vectorization of the words, the cosine similarity method is used to classify the tourism text, with the text classification based on naive Bayes being compared through experiments; third, the popular tourism words are obtained through the popularity analysis model. This paper proposes two models to obtain popular words: One is a multi-dimensional tourism product popularity analysis model based on principal component analysis; the other is a popularity analysis model based on emotion analysis; fourth, this paper uses the BiLSTM-CRF model to identify entities and the cosine similarity method to predict the relationship between entities so as to extract high-quality tourism knowledge triplets. In order to improve the effect of entity recognition, this paper proposes entity recognition based on the BiLSTM-LPT and BiLSTM-Hanlp models. The experimental results show that the model can effectively improve the efficiency of entity recognition; finally, a high-quality tourism knowledge was imported into the Neo4j graphic database to build a tourism knowledge graph.

The simplest and effective way to store human knowledge through centuries was using text. Along with the advancement of technology nowadays, the volume of text has grown to be larger and larger. To extract useful information from this amount of text becomes an exceptionally complex task. As an effort to solve that problem, in this paper, we present a pipeline to extract core knowledge from large quantity text using distributed computing. The components of our pipeline are systems that were known to yield good results. The outputs of our proposed system are stored in a knowledge graph. A knowledge graph is a graph for storing knowledge in the form of triples (head, relation, tail). Some of the existing knowledge graphs in the world are Google knowledge graph, YAGO, DBLP, or DBpedia. These knowledge graphs have one thing in common—they are in English. The English language is studied by many researchers in the world and it had become a rich-resource language (with many natural language processing tools and data set). Vietnamese, on the other hand, is a low-resource language. Therefore, we use cross-lingual transfer method to build a Vietnamese knowledge graph. Firstly, we collect data in form of text about Vietnam tourism, which was written mostly in Vietnamese, using Google search and Wikipedia. In the next step, we translate them into English with Google Translate and use English Natural Language Processing tools like Stanford Parser, Co-referencing, ClausIE, MinIE to extract useful triples from this text. Lastly, the triples are translated back to Vietnamese to build a Vietnam tourism knowledge graph. Since we are working with massive text, we develop a distributed algorithm to extract triples from sentences of massive text. This is a distributed version of MinIE, which was originally developed for a single machine model. In Apache Spark framework, we divide massive text into many smaller parts and move them to the worker nodes with distributed MinIE function. Spark distributed MinIE will extract the triples of sentences in the local text of this worker node in parallel. Finally, the result of worker nodes will be sent back to the master node for building the knowledge graph. We conduct experiments with the distributed MinIE on spark cluster to prove the outperformance of our proposed algorithm.

With the advent of the digital era, promoting the digital and intelligent transformation of cultural tourism has become an inevitable trend. This paper constructs a characteristic model of cultural tourism in Liaoning Province through the three-level coding of grounded theory. On this basis, it completes the design of the logical architecture of the knowledge graph covering the schema layer and data layer, clarifies various entities, data attributes and object attributes, and finally builds a structured ontology model of cultural tourism in Liaoning Province. To verify the feasibility of the model, this paper takes the Liaoshen Campaign Memorial Hall as an empirical case and uses the Neo4j graph database to realize the visual storage and display of its knowledge graph. This lays a solid foundation for the intelligent development of cultural tourism in Liaoning Province and provides a reference paradigm for the digital construction of cultural tourism resources in other regions of the country.

In recent years, the tourism field related websites are increasing day by day, the network has produced massive tourist generation data. Based on the semi-structured data of scenic spots, hotels and caterings on tourist websites and the travel notes published by tourists, this paper constructed the tourism knowledge graph. The extraction of entities from travel notes was faced with the problems of named entity recognition and entity alignment. In order to improve the accuracy of extracting entities from travel notes, in this paper, the named entity recognition model based on BiLSTM-CRF and the entity alignment model based on siamese network were proposed. F values can reach 90.8% and 93.0%, respectively.

The digital transformation of Tibetan cultural tourism is hindered by high manual costs, weak semantic adaptability, and cultural security risks. To address these, this paper proposes RLT2C, a "Rule+LLM-Verify" approach for automated and culturally secure KG construction. It employs a lightweight-large model collaboration mechanism, where a fine-tuned lightweight model generates initial Cypher statements, rigorously verified by LLMs for local semantic accuracy and cultural compliance. This two-stage process, combined with a dynamic-static cultural constraint system, ensures high efficiency and preserves cultural integrity, supporting knowledge-driven naked-eye 3D immersive experiences.Experimental results on 1200 Tibetan tourism texts show RLT2C outperforms baselines in construction efficiency (14.5 triples/1000 words), relationship accuracy (91.5%), local semantic adaptability (87.9%), and graph redundancy rate (5.4%). RLT2C exhibits strong practicality and scalability. The constructed KG serves not only as an information repository but also as a foundational engine for immersive visualization. By acting as a "central index" for 3D assets and a "safety gatekeeper" for content generation, it enables the dynamic and secure rendering of culturally authentic naked-eye 3D experiences from natural language queries.

Purpose In recent years, road trips have become a popular travel mode in China. However, existing attraction recommendation methods often overlook conflicting preferences among tourists and key factors specific to road trips, resulting in suboptimal recommendations. To address this issue, we propose a knowledge-enhanced non-compensatory group decision-making approach to improve the accuracy of road trip attraction recommendations. Design/methodology/approach First, our approach constructs a comprehensive tourism knowledge graph by integrating information about both tourists and attractions. Second, an 11-dimensional modeling framework is proposed to better portray tourist preferences and attraction characteristics in the road trip context. Finally, the non-compensatory group decision-making algorithm, Elimination Et Choix Traduisant la REalité III (ELECTRE-III), is applied to model each tourist's preferences within the group and rank attractions for the tourist group. Findings Experimental results demonstrate the effectiveness of the proposed method in road trip attraction recommendation. Compared to existing approaches, our method maintains a recommendation failure rate below 15% across varying levels of conflict rates and group sizes, consistently outperforming all baseline methods. Statistical analysis further confirms that the non-compensatory mechanism effectively identifies attractions that align with the collective preferences of tourist groups. Originality/value This paper proposes a novel method for recommending attractions to road trip tourist groups by integrating non-compensatory group decision-making with knowledge integration. The approach effectively incorporates individual preferences while maintaining a low recommendation failure rate, thereby enhancing both recommendation performance and overall tourist satisfaction.