MAPPING PART-WHOLE HIERARCHIES INTO CONNECTIONIST NETWORKS

被引:142
作者
HINTON, GE
机构
[1] Department of Computer Science, University of Toronto, Toronto
关键词
D O I
10.1016/0004-3702(90)90004-J
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Three different ways of mapping part-whole hierarchies into connectionist networks are described. The simplest scheme uses a fixed mapping and is inadequate for most tasks because it fails to share units and connections between different pieces of the part-whole hierarchy. Two alternative schemes are described, each of which involves a different method of time-sharing connections and units. The scheme we finally arrive at suggests that neural networks have two quite different methods for performing inference. Simple "intuitive" inferences can be performed by a single settling of a network without changing the way in which the world is mapped into the network. More complex "rational" inferences involve a sequence of such settlings with mapping changes after each settling. © 1990.
引用
收藏
页码:47 / 75
页数:29
相关论文
共 33 条
[1]  
Barlow H B, 1972, Perception, V1, P371, DOI 10.1068/p010371
[2]  
BERLINER H, 1982, P AAAI 82 PITTSBURGH, P213
[3]  
CHARNIAK E, 1987, 9TH P ANN C COGN SCI
[4]  
DERTHICK M, 1987, P AAAI87 SEATTLE
[5]  
Fahlman SE., 1979, NETL SYSTEM REPRESEN
[6]   CONNECTIONISM AND COGNITIVE ARCHITECTURE - A CRITICAL ANALYSIS [J].
FODOR, JA ;
PYLYSHYN, ZW .
COGNITION, 1988, 28 (1-2) :3-71
[7]  
Gazdar G., 1982, NATURE SYNTACTIC REP, P131
[8]  
Hillis W. D., 1985, THESIS MASSACHUSETTS
[9]  
Hinton G. E., 1981, PARALLEL MODELS ASS
[10]  
HINTON GE, 1987, 9TH P ANN C COGN SCI