| Blank, Douglas S. (1997). Learning to see analogies: A connectionist exploration. PhD thesis, Dept. of Comp Science & Cognitive Science, Indiana University, Bloomington. |
....Memory (RAAM) by Pollack (1990) However, they experimented only on toy sized problems with up to 300 sequences. Another interesting approach proposed for holistic computations is the tensor products (Smolensky, 1990) which however, are not intrinsically connectionist, although see (Blank, 1997) for a connectionist implementation. II Recurrent Autoassociative Networks An interesting architecture designed to develop static representations of sequences the Recurrent Autoassociative Networks (RAN) see (Fig. 1a) was presented by Stoianov in (1999a) It is an extension of the popular ....
Blank, Douglas S. (1997). Learning to see analogies: A connectionist exploration. PhD thesis, Dept. of Comp Science & Cognitive Science, Indiana University, Bloomington.
....[127] Many researchers have been focusing on such explanations by attempting to solve high level problems via a purely connectionist framework. Some high level systems that come to mind include Elman s developmental models, Meeden s planning system, and my own connectionist analogy making system [43, 133, 20]. Rather than focusing on some assumed necessary symbolically based process (say, variable binding) these models look at a bigger goal: modeling a complex behavior. My analogical model does not assume that analogies are correspondences made via searching through symbolic structures. Rather, a ....
D.S. Blank. Learning to see analogies: a connectionist exploration. PhD thesis, Indiana University, Bloomington, 1997. http://dangermouse.uark.edu/thesis.html.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC