Saved in:
Bibliographic Details
Main Authors: Zhao, Zhouxiang, Yang, Zhaohui, Hu, Ye, Lin, Licheng, Zhang, Zhaoyang
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2309.08879
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912314622476288
author Zhao, Zhouxiang
Yang, Zhaohui
Hu, Ye
Lin, Licheng
Zhang, Zhaoyang
author_facet Zhao, Zhouxiang
Yang, Zhaohui
Hu, Ye
Lin, Licheng
Zhang, Zhaoyang
contents In this paper, the problem of semantic information extraction for resource constrained text data transmission is studied. In the considered model, a sequence of text data need to be transmitted within a communication resource-constrained network, which only allows limited data transmission. Thus, at the transmitter, the original text data is extracted with natural language processing techniques. Then, the extracted semantic information is captured in a knowledge graph. An additional probability dimension is introduced in this graph to capture the importance of each information. This semantic information extraction problem is posed as an optimization framework whose goal is to extract most important semantic information for transmission. To find an optimal solution for this problem, a Floyd's algorithm based solution coupled with an efficient sorting mechanism is proposed. Numerical results testify the effectiveness of the proposed algorithm with regards to two novel performance metrics including semantic uncertainty and semantic similarity.
format Preprint
id arxiv_https___arxiv_org_abs_2309_08879
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Semantic Information Extraction for Text Data with Probability Graph
Zhao, Zhouxiang
Yang, Zhaohui
Hu, Ye
Lin, Licheng
Zhang, Zhaoyang
Computation and Language
Signal Processing
In this paper, the problem of semantic information extraction for resource constrained text data transmission is studied. In the considered model, a sequence of text data need to be transmitted within a communication resource-constrained network, which only allows limited data transmission. Thus, at the transmitter, the original text data is extracted with natural language processing techniques. Then, the extracted semantic information is captured in a knowledge graph. An additional probability dimension is introduced in this graph to capture the importance of each information. This semantic information extraction problem is posed as an optimization framework whose goal is to extract most important semantic information for transmission. To find an optimal solution for this problem, a Floyd's algorithm based solution coupled with an efficient sorting mechanism is proposed. Numerical results testify the effectiveness of the proposed algorithm with regards to two novel performance metrics including semantic uncertainty and semantic similarity.
title Semantic Information Extraction for Text Data with Probability Graph
topic Computation and Language
Signal Processing
url https://arxiv.org/abs/2309.08879