ENTROPY AND DISTANCE OF RANDOM GRAPHS WITH APPLICATION TO STRUCTURAL PATTERN-RECOGNITION

被引：183

作者：

WONG, AKC

YOU, M

机构：

来源：

关键词：

D O I：

10.1109/TPAMI.1985.4767707

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：599 / 609

页数：11

共 22 条

[1] ACZEL J, 1975, MEASURES INFORMATION
[2] Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[3] Fu K. S., 1980, Pictorial information systems, P104
[4] GHAHRAMAN DE, 1980, IEEE T SYST MAN CYB, V10, P189
[5] GRAPH OPTIMAL MONOMORPHISM ALGORITHMS
GHAHRAMAN, DE
WONG, AKC
AU, T
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (04): : 181 - 188
[6] IMPEDOVO S, 1982, 1982 P INT C PATT RE, V1, P40
[7] KALBFLEISCH JG, PROBABILITY STATISTI, V2
[8] MASUMI AE, 1973, THESIS U ILLINOIS UR
[9] NIEMANN H, 1980, 1980 P INT C PATT RE, P213
[10] REPRESENTATION OF FIGURES BY LABELED GRAPHS
PAVLIDIS, T
[J]. PATTERN RECOGNITION, 1972, 4 (01) : 5 - &