Show simple item record

dc.contributor.authorBasu, Prithwish
dc.contributor.authorBao, Jie
dc.contributor.authorDean, Mike
dc.contributor.authorHendler, James A.
dc.identifier.citationP. Basu, J. Bao, M. Dean and J. Hendler, "Preserving quality of information by using semantic relationships," 2012 IEEE International Conference on Pervasive Computing and Communications Workshops, Lugano, Switzerland, 2012, pp. 58-63, doi: 10.1109/PerComW.2012.6197583.en_US
dc.description.abstractWe show how semantic relationships that exist within an information-rich source can be exploited for achieving parsimonious communication between a pair of semantically-aware nodes that preserves quality of information. We extend the source coding theorem of classical information theory to encompass semantics in the source and show that by utilizing semantic relations between source symbols, higher rate of lossless compression may be achieved compared to traditional syntactic compression methods. We define the capacity of a semantic source as the mutual information between its models and syntactic messages, and show that it equals the average semantic entropy of its messages. We further show the duality of semantic redundancy and semantic ambiguity in compressing semantic data, and establish the semantic capacity of a source as the lower bound on semantic compression. Finally, we give a practical semantic compression algorithm that exploits the graph structure of a shared knowledge base to facilitate semantic communication between a pair of nodes.en_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.titlePreserving Quality of Information by using Semantic Relationshipsen_US

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States