INFORMATIONAL SIMILARITY OF GRAPHS IN SYNTACTIC PATTERN-RECOGNITION

被引：2
|
作者：
JUMARIE, G [1 ]
机构：
[1] UNIV QUEBEC,DEPT MATH,MONTREAL,PQ H3C 3P8,CANADA
来源：
PATTERN RECOGNITION LETTERS | 1994年 / 15卷 / 12期
关键词：
GRAPHS; ENTROPY; INFORMATION; GRAPH SIMILARITY; WEIGHTED GRAPH;
D O I：
10.1016/0167-8655(94)90107-4
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Weighted treelike graphs can be utilized to describe syntactic pattern recognition processes in which semantics is taken into account. We show how an informational entropy can be defined on such graphs. This provides an approach to measuring their complexities and their similarity.
引用
收藏
页码：1177 / 1181
页数：5
相关论文
共 50 条
12345