scholarly journals Recommendation Model Based on Semantic Features and a Knowledge Graph

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Yudong Liu ◽  
Wen Chen
Keyword(s):  
Semantic Similarity ◽  
Information Science ◽  
Absolute Error ◽  
Knowledge Graph ◽  
Semantic Features ◽  
Short Text ◽  
Model Based ◽  
Recommendation Algorithms ◽  
Tremendous Amount ◽  
Series Of Experiments

In the field of information science, how to help users quickly and accurately find the information they need from a tremendous amount of short texts has become an urgent problem. The recommendation model is an important way to find such information. However, existing recommendation models have some limitations in case of short text recommendation. To address these issues, this paper proposes a recommendation model based on semantic features and a knowledge graph. More specifically, we first select DBpedia as a knowledge graph to extend short text features of items and get the semantic features of the items based on the extended text. And then, we calculate the item vector and further obtain the semantic similarity degrees of the users. Finally, based on the semantic features of the items and the semantic similarity of the users, we apply the collaborative filtering technology to calculate prediction rating. A series of experiments are conducted, demonstrating the effectiveness of our model in the evaluation metrics of mean absolute error (MAE) and root mean square error (RMSE) compared with those of some recommendation algorithms. The optimal MAE for the model proposed in this paper is 0.6723, and RMSE is 0.8442. The promising results show that the recommendation effect of the model on the movie field is significantly better than those of these existing algorithms.

Similarity of Sentences With Contradiction Using Semantic Similarity Measures

2020 ◽  
Author(s):  
M Krishna Siva Prasad ◽  
Poonam Sharma
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Semantic Similarity ◽  
Language Processing ◽  
Word Order ◽  
Similarity Measures ◽  
Semantic Features ◽  
Short Text ◽  
Sentence Similarity ◽  
Expert Ratings

Abstract Short text or sentence similarity is crucial in various natural language processing activities. Traditional measures for sentence similarity consider word order, semantic features and role annotations of text to derive the similarity. These measures do not suit short texts or sentences with negation. Hence, this paper proposes an approach to determine the semantic similarity of sentences and also presents an algorithm to handle negation. In sentence similarity, word pair similarity plays a significant role. Hence, this paper also discusses the similarity between word pairs. Existing semantic similarity measures do not handle antonyms accurately. Hence, this paper proposes an algorithm to handle antonyms. This paper also presents an antonym dataset with 111-word pairs and corresponding expert ratings. The existing semantic similarity measures are tested on the dataset. The results of the correlation proved that the expert ratings are in order with the correlation obtained from the semantic similarity measures. The sentence similarity is handled by proposing two algorithms. The first algorithm deals with the typical sentences, and the second algorithm deals with contradiction in the sentences. SICK dataset, which has sentences with negation, is considered for handling the sentence similarity. The algorithm helped in improving the results of sentence similarity.

BERT-KG: A Short Text Classification Model Based on Knowledge Graph and Deep Semantics

2021 ◽  
pp. 721-733
Author(s):  
Yuyanzhen Zhong ◽  
Zhiyang Zhang ◽  
Weiqi Zhang ◽  
Juyi Zhu
Keyword(s):  
Text Classification ◽  
Classification Model ◽  
Knowledge Graph ◽  
Short Text ◽  
Model Based

scholarly journals Research on Semantic Similarity of Short Text Based on Bert and Time Warping Distance

2021 ◽  
Author(s):  
Shijie Qiu ◽  
Yan Niu ◽  
Jun Li ◽  
Xing Li
Keyword(s):  
Semantic Similarity ◽  
Feature Vector ◽  
Semantic Features ◽  
Time Warping ◽  
Short Text ◽  
Business Applications ◽  
Ambiguous Words ◽  
Text Feature ◽  
Feature Information ◽  
Short Text Similarity

The research on semantic similarity of short text plays an important role in machine translation, emotion analysis, information retrieval and other AI business applications. However, according to existing short text similarity research, the characteristics of ambiguous vocabularies are difficult to be effectively analyzed, the solution of the problem caused by words order needs to be further optimized as well. This paper proposes a short text semantic similarity calculation method that combines BERT and time warping distance algorithm, in order to solve the problem of vocabulary ambiguity. The model first uses the pre trained Bert model to extract the semantic features of the short text from the whole level, and obtains a 768 dimensional short text feature vector. Then, it transforms the extracted feature vector into a point sequence in space, uses the CTW algorithm to calculate the time warping distance between the curves connected by the point sequence, and finally uses the weight function designed by the analysis, according to the smaller the time warpage distance is, the higher the degree of small similarity is, to calculate the similarity between short texts. The experimental results show that this model can mine the feature information of ambiguous words, and calculate the similarity of short texts with lexical ambiguity effectively. Compared with other models, it can distinguish the semantic features of ambiguous words more accurately.

scholarly journals TransET: Knowledge Graph Embedding with Entity Types

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1407
Author(s):  
Peng Wang ◽  
Jing Zhou ◽  
Yuzhang Liu ◽  
Xingchen Zhou
Keyword(s):  
Link Prediction ◽  
State Of The Art ◽  
Score Function ◽  
Graph Embedding ◽  
Vector Spaces ◽  
Knowledge Graph ◽  
Semantic Features ◽  
Knowledge Graphs ◽  
Real World Datasets ◽  
Low Dimensional

Knowledge graph embedding aims to embed entities and relations into low-dimensional vector spaces. Most existing methods only focus on triple facts in knowledge graphs. In addition, models based on translation or distance measurement cannot fully represent complex relations. As well-constructed prior knowledge, entity types can be employed to learn the representations of entities and relations. In this paper, we propose a novel knowledge graph embedding model named TransET, which takes advantage of entity types to learn more semantic features. More specifically, circle convolution based on the embeddings of entity and entity types is utilized to map head entity and tail entity to type-specific representations, then translation-based score function is used to learn the presentation triples. We evaluated our model on real-world datasets with two benchmark tasks of link prediction and triple classification. Experimental results demonstrate that it outperforms state-of-the-art models in most cases.

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

Knowledge Graph Completion to Solve University Campus Issues

2020 ◽  
Vol 1 (3) ◽  
pp. 333-350
Author(s):  
Yuto Tsukagoshi ◽  
Takahiro Kawamura ◽  
Yuichi Sei ◽  
Yasuyuki Tahara ◽  
Akihiko Ohsuga
Keyword(s):  
Data Integration ◽  
Conventional Method ◽  
Current Literature ◽  
Statistical Data ◽  
Mean Absolute Error ◽  
Absolute Error ◽  
Knowledge Graph ◽  
University Campus ◽  
Combining Data ◽  
Conventional Methods

A number of urban challenges are encountered by modern societies. Governments, businesses and public bodies need to make statistical data widely available in order to tackle these challenges. Nonetheless, current literature and data are problematic; they have inaccuracies which lead to less effective methods of resolving these issues. This research aims to solve this challenge by thinking of a university campus as a microcosm of society, implementing a data integration schema, and combining data into a knowledge graph. Existing completion methods will then be applied and updated. Especially in regards to bicycle environment, our knowledge graph was tailored and evaluated in line with conventional methods, and secondly with our proposed derivative methods. Roughly 650 pieces of parking data, with various dates and times, was contrasted with each time's mean absolute error. Our approach accurately projected 54.5 more bicycles than the conventional method.

Sign in / Sign up

Export Citation Format

Share Document