Some approaches to analogical mapping with structure-sensitive distributed representations

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 16, Issue 3, 2004, Pages 125-144

  Rachkovskij, Dmitri A ^a  

^a V M GLUSHKOV INSTITUTE OF CYBERNETICS   (Ukraine)

Author keywords

Analogical mapping; Analogy; APNN; Associative projective neural networks; Binary coding; Binding; Codevector; Connectionist symbol processing; Distributed representations; Reasoning; Representation of structure; Sparse coding

Indexed keywords

BINARY CODES; COGNITIVE SYSTEMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; NEURAL NETWORKS;

ANALOGICAL MAPPING; DISTRIBUTED REPRESENTATION; SPARSE CODING;

MAPPING;

EID: 4644348567     PISSN: 0952813X     EISSN: None     Source Type: Journal    
DOI: 10.1080/09528130410001712862     Document Type: Article

References (38)

1. Adamson, M. J., and Damper, R. I., 1999, B-RAAM: a connectionist model which develops holistic internal representations of symbolic structures. Connection Science, 11: 41-71.
2. Baidyk, T. N., 2002, Neural Networks and Problems of Artificial Intelligence (Kiev: Naukova Dumka) (in Russian).
3. Browne, A., and Sun, R., 2001, Connectionist inference models. Neural Networks 14(10): 1331-1355.
4. Callan, R., and Palmer-Brown, D., 1997, (S)RAAM: an analytical technique for fast and reliable derivation of connectionist symbol structure representations. Connection Science, 9(2): 139-159.
5. Dorffner, G., 1996, Categorization in early language acquisition - accounts from a connectionist model, Oesterreichisches Forschungsinstitut fuer Artificial Intelligence (Wien), TR-96-16, available at: ftp://ftp.al.univie.ac. at/papers/oefai-tr-96-16.ps.gz
6. Eliasmith, C., and Thagard, P., 2001, Integrating structure and meaning: a distributed model of analogical mapping. Cognitive Science, 25(2): 245-286.
7. Falkenhainer, B., Forbus, K. D., and Gentner, D., 1989, The structure-mapping engine: algorithm and examples. Artificial Intelligence, 41: 1-63.
8. Forbus, K. D., Gentner, D., and Law, K., 1995, MAC/FAC: a model of similarity-based retrieval. Cognitive Science, 19(2): 141-205.
9. Frolov, A. A., Rachkovskij, D. A., and Husek, D., 2002, On informational characteristics of Willshaw-like auto-associative memory. Neural Network World, 12 (2): 141-157.
10. Gayler, R. W., and Wales, R., 1998, Connections, binding, unification and nalogical promiscuity. In K. Holyoak, D. Gentner and B. Kokinov (eds) Advances in analogy research: Integration of theory and data from the cognitive, computational, and neural sciences, In Proceedings, Analogy'98 workshop, Sofia. NBU Series in Cognitive Science, Sofia, Bulgaria, New Bulgarian University, pp. 181-190.
11. Gentner, D., 1983, Structure-mapping: A theoretical framework for analogy. Cognitive Science, 7: 155-170.
12. Gentner, D., and Markman, A. B., 1995, Analogy-based reasoning. In M. A. Arbib (eds) Handbook of Brain Theory and Neural Networks (Cambridge, MA: MIT Press), pp. 91-93.
13. Gentner, D., and Markman, A. B., 1997, Structure mapping in analogy and similarity. American Psychologist, 52(1): 45-56.
14. Gray, B., Halford, G. S., Wilson, W. H., and Phillips, S., 1997, A neural net model for mapping hierarchically structured analogs. In Proceedings of the Fourth conference of the Australasian Cognitive Science Society, 26-28 September, University of Newcastle.
15. Hinton, 1990, Mapping part-whole hierarchies into connectionist networks. Artificial Intelligence, 46: 47-75.
16. Hofstadter, D. R., and Mitchell, M., 1988, Conceptual slippage and mapping: A report of the Copycat project, In Proceedings of the Tenth Annual Conference of the Cognitive Science Society (Hillsdale, NJ: Erlbaum), pp. 601-607.
17. Holyoak, K. J., and Thagard, P., 1989, Analogical mapping by constraint satisfaction. Cognitive Science, 13: 295-355.
18. Holyoak, K. J., and Thagard, P., 1995, Mental leaps: Analogy in creative thought (Cambridge, MA: MIT Press).
19. Hummel, J. E., and Holyoak K. J., 1997, Distributed representations of structure: A theory of analogical access and mapping. Psychological Review, 104: 427-466.
20. Kanerva, P., 1996, Binary spatter-coding of ordered K-tuples, In C. von der Malsburg, W. von Seelen, J. C. Vorbruggen and B. Sendhoff (eds) Proceedings of the International Conference on Artificial Neural Networks - ICANN'96, Bochum (Berlin: Springer). Lecture Notes in Computer Science, 1112: 869-873.
21. Kanerva, P., 1998, Dual role of analogy in the design of a cognitive computer, In K. Holyoak, D. Gentner and B. Kokinov (eds) Advances in Analogy Research: Integration of Theory and Data from the Cognitive, Computational, and Neural Sciences. In Proceedings Analogy'98 workshop, NBU Series in Cognitive Science (Sofia: New Bulgarian University), pp. 164-170.
22. Kanerva, P., 2000, Large patterns make great symbols: An example of learning from example, In S. Wermter and R. Sun (eds) Hybrid Neural Systems (Heidelberg: Springer), pp. 194-203.
23. Keane, M. T., Ledgeway T., and Duff S., 1994, Constraints on analogical mapping: a comparison of three models. Cognitive Science, 18: 387-438.
24. Kussul, E. M., 1992, Associative neuron-like structures (Kiev: Naukova Dumka) (in Russian).
25. Markman, A. B., 1997, Constraints on analogical inference. Cognitive Science, 21(4): 373-418.
26. Plate, T. A., 1995, Holographic reduced representations. IEEE Transactions on Neural Networks, 6: 623-641.
27. Plate, T. A., 1997, A common framework for distributed representation schemes for compositional structure. In F. Maire, R. Hayward and J. Diederich (eds) Connectionist systems for knowledge representation and deduction (Queensland: Queensland University of Technology), pp. 15-34.
28. Plate, T. A., 2000, Analogical retrieval and processing with distributed ector representations. Expert Systems: The International Journal of Knowledge Engineering and Neural Networks, 17(1): pp. 29-40.
29. Plate, T. A., 2003, Holographic reduced representations. Distributed Representations for Cognitive Structures (CLSI Publications, CA, USA).
30. Pollack, J. B., 1990, Recursive distributed representations. Artificial Intelligence, 46: 77-105.
31. Rachkovskij, D. A., and Kussul, E. M., 2001, Binding and normalization of binary sparse distributed representations by context-dependent thinning. Neural Computation 13(2): 411-452.
32. Rachkovskij, D., 2001, Representation and processing of structures with binary sparse distributed codes. IEEE Transactions on Knowledge and Data Engineering, 13(2): 261-276.
33. Ross, B., 1989, Distinguishing types of superficial similarities: different effects on the access and use of earlier problems. Journal of Experimental Psychology: Learning, Memory, and Cognition, 15: 456-468.
34. Shastri, L., and Ajjanagadde, V., 1993, From simple associations to systematic reasoning: connectionst representation of rules, variables, and dynamic bindings using temporal synchrony. Behavioral and Brain Sciences, 16: .417-494.
35. Smolensky, P., 1990, Tensor product variable binding and the representation of symbolic structures in connectionist systems. Artificial Intelligence, 46: 159-216.
36. Thagard, P., Holyoak, K. J., Nelson, G., and Gochfeld D., 1990, Analog retrieval by constraint satisfaction. Artificial Intelligence 46: 259-310.
37. Wharton, C. M., Holyoak, K. J., Downing, P. E., Lange, T. E., Wickens, T. D., and Melz, E. R., 1994, Below the surface: analogical similarity and retrieval competition in reminding. Cognitive Psychology, 26: 64-101.
38. Willshaw, D. J., Buneman, O. P., and Longuet-Higgins, H. C., 1969, Non-holographic associative memory. Nature, 222: 960-962.