The self-organizing map of trees

被引:7
作者
Peura, M
机构
[1] Helsinki Univ Technol, Lab Comp & Informat Sci, FIN-02105 HUT, Finland
[2] Univ Strasbourg 1, CNRS, ERII, LSIIT, Strasbourg, France
关键词
self-organizing map; tree; graph matching;
D O I
10.1023/A:1009648713183
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the standard version of the Self-Organizing Map, each neuron is associated with a vector. An extension using trees instead of vectors is presented. Compared to vectors, trees provide remarkably more degrees of freedom. The essential points of self-organization, the distance function and the learning rule, are adapted to trees by means of graph matching. In order to avoid exhaustive searching in tree matching an efficient heuristic is introduced. The results of the experiments are promising: the proposed methods apply elegantly in the process of self-organization.
引用
收藏
页码:155 / 162
页数:8
相关论文
共 10 条
[1]  
CHOY CST, 1995, 1995 INT C AC SPEECH, V5, P3351
[2]   A GRAPH DISTANCE MEASURE FOR IMAGE-ANALYSIS [J].
ESHERA, MA ;
FU, KS .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1984, 14 (03) :398-408
[3]  
FU KS, 1973, IEEE T COMPUT, VC 22, P1087, DOI 10.1109/T-C.1973.223654
[4]  
HERBIN S, 1995, P ICANN95 INT C ART, V2, P57
[5]   THE SELF-ORGANIZING MAP [J].
KOHONEN, T .
PROCEEDINGS OF THE IEEE, 1990, 78 (09) :1464-1480
[6]  
KOIKKALAINEN P, 1994, P ECAI 94 11 EUR C A, P211
[7]   EXACT AND APPROXIMATE ALGORITHMS FOR UNORDERED TREE MATCHING [J].
SHASHA, D ;
WANG, JTL ;
ZHANG, KZ ;
SHIH, FY .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1994, 24 (04) :668-678
[8]   ERROR-CORRECTING ISOMORPHISMS OF ATTRIBUTED RELATIONAL GRAPHS FOR PATTERN-ANALYSIS [J].
TSAI, WH ;
FU, KS .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1979, 9 (12) :757-768
[9]  
ULLMANN JR, 1976, J ACM, V23, P31, DOI 10.1145/321921.321925
[10]   ON THE EDITING DISTANCE BETWEEN UNORDERED LABELED TREES [J].
ZHANG, KZ ;
STATMAN, R ;
SHASHA, D .
INFORMATION PROCESSING LETTERS, 1992, 42 (03) :133-139