| 关于无向图节点信息量的比较 |
| |
| 引用本文： | 黄文婷,李开灿.关于无向图节点信息量的比较[J].湖北师范学院学报(自然科学版),2011,31(3):71-75. |
| |
| 作者姓名： | 黄文婷 李开灿 |
| |
| 作者单位： | 湖北师范学院数学与统计学院,湖北黄石,435002 |
| |
| 摘 要： | 运用图模型的基本理论,研究了离散型和连续型两种随机变量熵和信息量的相关性质,讨论了这两种情况下条件信息量的性质,再利用无向图的概念,推导了几种简单的无向图节点信息量的一般结论,即相邻节点间的信息量大于不相邻节点的信息量.
|
| 关 键 词： | 图模型 无向图 熵 条件信息量 |
Compare on the information content on nodes of undirected graph |
| |
| HUANG Wen-ting,LI Kai-can.Compare on the information content on nodes of undirected graph[J].Journal of Hubei Normal University(Natural Science),2011,31(3):71-75. |
| |
| Authors: | HUANG Wen-ting LI Kai-can |
| |
| Institution: | HUANG Wen-ting,LI Kai-can(College of Mathematics and Statistics,Hubei Normal University,Huangshi 435002,China) |
| |
| Abstract: | In this paper,we studied the related properties of entropy and information on the discrete and continuous random variables by using the basic theory of graphical model,discussed some properties of the conditional information in the two cases,then by use of the basic concept of undirected graph,we generalized a general conclusion about several simple information on node of undirected graph which is information on adjacent nodes are more than not adjacent nodes. |
| |
| Keywords: | graphical model undirected graph entropy conditional information |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
