Similarity-based retrieval with structure-sensitive sparse binary distributed representations

Computational Intelligence

Volumn 28, Issue 1, 2012, Pages 106-129

  Rachkovskij, Dmitri A ^a   Slipchenko, Serge V ^a  

^a International Research and Training Center for Information Technologies and Systems of the National Academy of Sciences of Ukraine and Ministry of Education and Science of Ukraine   (Ukraine)

Author keywords

analogical access; APNN; binary distributed representation; case based reasoning; codevector; similarity based retrieval

Indexed keywords

ANALOGICAL ACCESS; APNN; CODEVECTOR; DISTRIBUTED REPRESENTATION; SIMILARITY-BASED RETRIEVALS;

SEMANTICS;

KNOWLEDGE BASED SYSTEMS;

EID: 84858063371     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2011.00423.x     Document Type: Article

References (98)

1. Aamodt, A., and, E. Plaza,. 1994. Case-based reasoning: Foundational issues, methodological variations, and system approaches. AI Communications, 7 (1): 39-59.
2. Aha, D. W., 1998. The omnipresence of case-based reasoning in science and application. Knowledge-Based Systems, 11 (5-6): 261-273. (Pubitemid 128423101)
3. Beal, J., and, J. Roberts., 2009. Enhancing methodological rigor for computational cognitive science: Complexity analysis. In Proceedings of the 31th Annual Conference of the Cognitive Science Society. Edited by N.A. Taatgen and H. van Rijn. Cognitive Science Society: Austin, TX, pp. 99-104.
4. Bergmann, R., 2002. Experience Management: Foundations, Development Methodology, and Internet-Based Applications, Vol. 2432 of Lecture Notes in Computer Science, Springer: Berlin, New York, pp. 393.
5. Bergmann, R., K.-D. Althoff, S. Breen, M. Göker, M. Manago, R. Traphöner, and, S. Wess., 2009. Developing industrial case-based reasoning applications: The INRECA methodology. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. Springer: Berlin.
6. Bjornestad, S., 2003. Analogical reasoning for reuse of object-oriented specifications. In Case-Based Reasoning Research and Development, Vol. 2689 of Lecture Notes in Computer Science. Edited by, K. D. Ashley, and, D. G. Bridge,. Springer: Berlin/Heidelberg, pp. 50-64. (Pubitemid 36905822)
7. Borner, K., 1993. Structural similarity as guidance in case-based design. In Proceedings of the First European Workshop on Case-Based Reasoning. Springer: Berlin, pp. 197-208.
8. Browne, A., and, R. Sun., 2001. Connectionist inference models. Neural Networks, 14 (10): 1331-1355. (Pubitemid 33101874)
9. Bunke, H., 1997. On a relation between graph edit distance and maximum subgraph. Pattern Recognition Letters, 18: 689-694. (Pubitemid 127411238)
10. Bunke, H., 1999. Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21 (9): 917-922. (Pubitemid 30532491)
11. Bunke, H., 2000a. Graph matching: Theoretical foundations, algorithms, and applications. In Proceedings of Vision Interface 2000, pp. 82-88.
12. Bunke, H., 2000b. Recent developments in graph matching. In Proceedings of the Fifteenth International Conference on Pattern Recognition, Vol. 2, pp. 117-124.
13. Bunke, H., and, B. T. Messmer., 1993. Structural similarity as guidance in case-based design. In Proceedings of the First European Workshop on Case-Based Reasoning. Springer: Berlin, pp. 106-118.
14. Bunke, H., X. Jiang, and, A. Kandel., 2000. On the minimum common supergraph of two graphs. Computing, 65: 13-25.
15. Champin, P. A., and, C. Solnon,. 2003. Measuring the similarity of labeled graphs. In Proceedings of the Fifth International Conference on Case-Based Reasoning. Springer: Berlin, pp. 80-95. (Pubitemid 36905824)
16. Chaudhri, A. B., A. Rashid, and, R. Zicari,. 2003. XML Data Management: Native XML and XML-Enabled Database Systems. Addison-Wesley Professional: Redwood City, CA.
17. Doyle, D., P. Cunningham, D. Bridge, and, Y. Rahman,. 2004. Explanation oriented retrieval. In Proceedings of the Seventh European Conference on Case-Based Reasoning. Springer: Berlin, pp. 157-168.
18. Eliasmith, C., and, P. Thagard,. 2001. Integrating structure and meaning: A distributed model of analogical mapping. Cognitive Science, 25 (2): 245-286.
19. Falkenhainer, B., K. D. Forbus, and, D. Gentner,. 1989. The structure-mapping engine: Algorithm and examples. Artificial Intelligence, 41: 1-63.
20. Fellbaum, C., 1998. WordNet: An Electronic Lexical Database. The MIT Press: Cambridge, MA.
21. Fernández, M.-L., and, G. Valiente,. 2001. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters, 22: 753-758. (Pubitemid 32411931)
22. Forbus, K., 2001. Exploring analogy in the large. In The Analogical Mind: Perspectives from Cognitive Science. Edited by, D. Gentner, K. Holyoak, and, B. Kokinov,. MIT Press: Cambridge, MA, pp. 23-58.
23. Forbus, K. D., D. Gentner, and, K. Law,. 1995. MAC/FAC: A model of similarity-based retrieval. Cognitive Science, 1 9 (2): 141-205.
24. Forbus, K., and, T. Hinrichs,. 2006. Companion Cognitive Systems: A step towards human-level AI. AI Magazine, 27 (2): 83-95. (Pubitemid 44043587)
25. Forbus, K., K. Lockwood, and, A. Sharma,. 2009. Steps towards a 2nd generation learning by reading system. In Proceedings of AAAI Spring Symposium on Learning by Reading.
26. Frasconi, P., M. Gori, and, A. Sperduti,. 1998. A general framework for adaptive processing of data structures. IEEE Transactions on Neural Networks, 9 (5): 768-786. (Pubitemid 128743645)
27. Frolov, A. A., D. A. Rachkovskij, and, D. Husek,. 2002. On information characteristics of Willshaw-like auto-associative memory. Neural Network World, 2: 141-157. (Pubitemid 34474980)
28. Frolov, A. A., D. Husek, and, D. A. Rachkovskij,. 2006. Time of searching for similar binary vectors in associative memory. Cybernetics and Systems Analysis, 5: 615-623. (Pubitemid 46099779)
29. Gallant, S. I., 2000. Context vectors: A step toward a "Grand Unified Representation." In Hybrid Neural Systems, Lecture Notes in Computer Science, Vol. 1778. Edited by, S. Wermter, and, R. Sun., Springer: Berlin, pp. 204-210.
30. Gayler, R., 1998. Multiplicative binding, representation operators, and analogy. In Advances in Analogy Research: Integration of Theory and Data from the Cognitive, Computational, and Neural Sciences. Edited by, K. Holyoak, D. Gentner, and, B. Kokinov,. New Bulgarian University: Sofia, Bulgaria.
31. Gayler, R. W., and, S. D. Levy,. 2009. A distributed basis for analogical mapping. In Proceedings of the Second International Analogy Conference. NBU Press: Sofia, Bulgaria, pp. 165-174.
32. Gentner, D., 1983. Structure-mapping: A theoretical framework for analogy. Cognitive Science, 7: 155-170.
33. Gentner, D., and, A. B. Markman,. 2003. Analogy-based reasoning and metaphor. In The Handbook of Brain Theory and Neural Networks. Edited by, M. A. Arbib,. The MIT Press: Cambridge, MA, pp. 106-109.
34. Gray, B., G. S. Halford, W. H. Wilson, and, S. Phillips,. 1997. A neural net model for mapping hierarchically structured analogs. In Proceedings of the Fourth Conference of the Australasian Cognitive Science Society, University of Newcastle, NSW, Australia.
35. Hofstadter, D. R., and, M. Mitchell,. 1988. Conceptual slippage and mapping: A report of the copycat project. In Proceedings of the Tenth Annual Conference of Cognitive Science Society, pp. 601-607.
36. Holyoak, K. J., and, P. Thagard,. 1989. Analogical mapping by constraint satisfaction. Cognitive Science, 13 (3): 295-355.
37. Hummel, J., and, K. Holyoak,. 1997. Distributed representations of structure: A theory of analogical access and mapping. Psychological Review, 104: 427-466.
38. Jiang, X., and, H. Bunke,. 1999. Optimal quadratic-time isomorphism of ordered graphs. Pattern Recognition, 32: 1273-1283.
39. Jones, M. N., and, D. J. K. Mewhort., 2007. Representing word meaning and order information in a composite holographic lexicon. Psychological Review, 114: 1-37.
40. Kanerva, P., 1996. Binary spatter-coding of ordered k-tuples. In Artificial Neural Networks, Proceedings of ICANN 96. Edited by, C. von der Malsburg, W. von Seelen, J. Vorbruggen, and, B. Sendhoff,. Springer-Verlag: Berlin, pp. 869-873.
41. Kanerva, P., 2009. Hyperdimensional computing: An introduction to computing in distributed representation with highdimensional random vectors. Cognitive Computation, 1: 139-159.
42. Keane, M. T., T. Ledgeway, and, S. Duff,. 1994. Constraints on analogical mapping: A comparison of three models. Cognitive Science, 18: 287-334.
43. Kokinov, B., 1988. Associative memory based reasoning: How to represent and retrieve cases. In Artificial Intelligence III: Methodology, Systems, Applications. Edited by, T. O'Shea, and, V. Sgurev,. Elsevier Science Publishers B.V.: Amsterdam, the Netherlands, pp. 51-58.
44. Kokinov, B., and, R. French,. 2003 Computational models of analogy-making. In Encyclopedia of Cognitive Science. Edited by, L. Nadel,. Nature Publishing Group: London, pp. 113-118.
45. Kussul, E. M., 1992. Associative Neuron-Like Structures. Naukova Dumka: Kiev. (In Russian)
46. Kussul, E. M., T. N. Baidyk, D. C. Wunsch, O. Makeyev, and, A. Martin,. 2006. Permutation coding technique for image recognition systems. IEEE Ttransactions on Neural Networks, 17 (6): 1566-1579. (Pubitemid 44824268)
47. Levi, G., 1972. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9: 341-354.
48. Lopez De Mantaras, R., D. Mcsherry, D. Bridge, D. Leake, B. Smyth, S. Craw, B. Faltings, M. L. Maher, M. T. Cox, K. Forbus, M. Keane, A. Aamodt, and, I. Watson,. 2005. Retrieval, reuse, revision and retention in case-based reasoning. Knowledge Engineering Review, 20 (3): 215-240.
49. Markman, A. B., D. A. Rachkovskij, I. S. Misuno, and, E. G. Revunova,. 2003. Analogical reasoning techniques in intelligent counterterrorism systems. Informational Theories and Applications, 10 (2): 139-146.
50. Markman, A. B., and, D. Gentner,. 2000. Structure mapping in the comparison process. American Journal of Psychology, 113: 501-538.
51. Mcgregor, J. J., 1982. Backtrack search algorithms and the maximal common subgraph problem. Software Practice and Experience, 12: 23-34.
52. Mcsherry, D., 2003. Similarity and compromise. In Proceedings of the Fifth International Conference on Case-Based Reasoning. Springer: Berlin, pp. 291-305. (Pubitemid 36905839)
53. Medasani, S., R. Krishnapuram, and, Y. S. Choi,. 2001. Graph matching by relaxation of fuzzy assignments. IEEE Transactions on Fuzzy Systems, 9 (1): 173-182. (Pubitemid 32416236)
54. Messmer, B. T., and, H. Bunke,. 1998. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20 (5): 493-504. (Pubitemid 128741329)
55. Misuno, I. S., D. A. Rachkovskij, and, S. V. Slipchenko,. 2005. Vector and distributed representations reflecting semantic relatedness of words. Mathematical Machines and Systems, 3: 50-66. (In Russian)
56. Misuno, I. S., D. A. Rachkovskij, S. V. Slipchenko, and, A. M. Sokolov,. 2005. Searching for text information with vector representations. Problems in Programming, 4: 50-59. (In Russian)
57. Page, M., 2000. Connectionist modelling in psychology: A localist manifesto. Behavioral and Brain Sciences, 23: 443-512.
58. Pelillo, M., 1999. Replicator equations, maximal cliques, and graph isomorphism. Neural Computation, 11: 1933-1955.
59. Plate, T. A., 1991. Holographic Reduced Representations: Convolution algebra for compositional distributed representations. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI). Edited by, J. Mylopoulos, and, R. Reiter,. Morgan Kaufmann: San Mateo, CA, pp. 30-35.
60. Plate, T. A., 1994a. Estimating structural similarity by vector dot products of Holographic Reduced Representations. In Advances in Neural Information Processing Systems 6 (NIPS93). Edited by, J. D. Cowan, G. Tesauro, and, J. Alspector,. Morgan Kaufmann: San Mateo, CA, pp. 1109-1116.
61. Plate, T. A., 1994b. Distributed representations and nested compositional structure Ph.D. Thesis, Department of Computer Science, University of Toronto, Toronto, Canada Available at.
62. Plate, T. A., 2000. Analogy retrieval and processing with distributed vector representations. Expert Systems: The International Journal of Knowledge Engineering and Neural Networks, Special Issue on Connectionist Symbol Processing, 17 (1): 29-40.
63. Plate, T. A., 2003. Holographic Reduced Representation: Distributed Representation for Cognitive Science. CSLI Publications: Stanford, CA, pp. 300.
64. Ramscar, M., and, D. Yarlett,. 2003. Semantic grounding in models of analogy: An environmental approach. Cognitive Science, 27: 41-71. (Pubitemid 36106843)
65. Rachkovskij, D. A., 2001. Representation and processing of structures with binary sparse distributed codes. IEEE Transactions on Knowledge and Data Engineering, 13 (2): 261-276. (Pubitemid 32444140)
66. Rachkovskij, D. A., 2004. Some approaches to analogical mapping with structure sensitive distributed representations. Journal of Experimental and Theoretical Artificial Intelligence, 16 (3): 125-145.
67. Rachkovskij, D. A., and, E. M. Kussul,. 2001. Binding and normalization of binary sparse distributed representations by context-dependent thinning. Neural Computation, 13 (2): 411-452. (Pubitemid 33595005)
68. Rachkovskij, D. A., I. S. Misuno, and, S. V. Slipchenko,. 2012. Randomized projective methods for the construction of binary sparse vector representations. Cybernetics and Systems Analysis, 48 (1): 146-156.
69. Rachkovskij, D. A., S. V. Slipchenko, E. M. Kussul, and, T. N. Baidyk,. 2005a. Properties of numeric codes for the scheme of random subspaces RSC. Cybernetics and Systems Analysis, 4: 509-520. (Pubitemid 41694397)
70. Rachkovskij, D. A., S. V. Slipchenko, I. S. Misuno, E. M. Kussul, and, T. N. Baidyk,. 2005b. Sparse binary distributed encoding of numeric vectors. Journal of Automation and Information Sciences, 11: 47-61.
71. Riesen, K., S. Fankhauser, H. Bunke, and, P. Dickinson,. 2009. Efficient suboptimal graph isomorphism. In Graph-Based Representations in Pattern Recognition, Vol. 5534 of Lecture Notes in Computer Science. Edited by, A. Torsello, F. Escolano, and, L. Brun,. Springer: Berlin, pp. 124-133.
72. Riesen, K., M. Neuhaus, and, H. Bunke,. 2007. Graph embedding in vector spaces by means of prototype selection. In Graph-Based Representations in Pattern Recognition, Vol. 4538 of Lecture Notes in Computer Science. Edited by, F. Escolano, and, M. Vento,. Springer: Berlin, pp. 383-393.
73. Rissland, E. L., 1983. Examples in legal reasoning: Legal hypotheticals. In Proceedings of IJCAI 1983. Morgan Kauffman: San Mateo, CA, pp. 90-93.
74. Robles-KELLY, A., and, E. R. Hancock,. 2007. A Riemannian approach to graph embedding. Pattern Recognition, 40: 1024-1056.
75. Ross, B. H., 1989. Distinguishing types of superficial similarities: Different effects on the access and use of earlier examples. Journal of Experimental Psychology: Learning, Memory, and Cognition, 15 (3): 456-468.
76. Sahlgren, M., A. Holst, and, P. Kanerva., 2008. Permutations as a Means to Encode Order in Word Space. In Proceedings of the 30th Annual Meeting of the Cognitive Science Society (CogSci'08), Washington, DC, pp. 23-26.
77. Schenker, A., H. Bunke, M. Last, and, A. Kandel,. 2005. Graph-theoretic Techniques for Web Content Mining. World Scientific: River Edge, NJ.
78. Schank, R. C., 1982. Dynamic Memory: A Theory of Reminding and Learning in Computers and People, Cambridge University Press: New York.
79. Slipchenko, S. V., 2005a. SLANG: A symbolic language for distributed representation. In Proceedings of the Fourteenth International Conference on Neurocybernetics, Vol. 2, Rostov-on-Don, Russia, pp. 237-239.
80. Slipchenko, S. V., 2005b. Distributed representations in the problems of processing structured numeric and symbolic information. System Technologies, 6 (41): 134-141. (In Russian)
81. Slipchenko, S. V., D. A. Rachkovskij, and, I. S. Misuno,. 2005. Decoding binary distributed representations of numerical vectors. Computer Mathematics, 3: 108-120. (In Russian)
82. Smyth, B., and, M. T. Keane,. 1998. Adaptation-guided retrieval: Questioning the similarity assumption in reasoning. Artificial Intelligence, 102 (2): 249-293. (Pubitemid 128431354)
83. Smyth, B., and, E. Mckenna,. 1999. Footprint based retrieval. In Proceedings of the Third International Conference on Case-based Reasoning. Springer: Berlin, pp. 343-357.
84. Smyth, B., and, E. Mckenna,. 2001. Competence guided incremental footprint-based retrieval. Knowledge-Based Systems, 14 (3-4):155- 161.
85. Sokolsky, O., S. Kannan, and, I. Lee,. 2006. Simulation-based graph similarity. In Tools and Algorithms for the Construction and Analysis of Systems, Vol. 3920 of Lecture Notes in Computer Science. Springer: Berlin/ Heidelberg, pp. 426-440. (Pubitemid 44019386)
86. Sowa, J. F., 2000. Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks Cole: Pacific Grove, CA.
87. Stanfill, C., and, D. Waltz,. 1986. Toward memory-based reasoning. Communications of the ACM, 29 (12): 1213-1228.
88. Sun, Z., and, G. R. Finnie,. 2004. Intelligent Techniques in E-Commerce: A Case Based Reasoning Perspective. Springer: Berlin.
89. Thagard, P., K.J. Holyoak, G. Nelson, and, D. Gochfeld,. 1990. Analog retrieval by constraint satisfaction. Artificial Intelligence, 46 (1-2): 259-310.
90. THNET. 2012. THNET: THinkNet connectionist software. Available at. Accessed February 2012.
91. Thorpe, S., 2003. Localized versus distributed representations. In The Handbook of Brain Theory and Neural Networks. Edited by, M. A. Arbib,. The MIT Press: Cambridge, MA, pp. 643-646.
92. Tinker, P., J. Fox, C. Green, D. Rome, K. Casey, and, C. Furmanski,. 2005. Analogical and case-based reasoning for predicting satellite task schedulability. In Proceedings of ICCBR 2005, Vol. 3620 of Lecture Notes in Computer Science. Springer: Berlin/Heidelberg, pp. 566-578. (Pubitemid 41480054)
93. Watson, I., 1997. Applying Case-Based Reasoning: Techniques for Enterprise Systems. Morgan Kaufmann: San Francisco, CA.
94. Wess, S., K.-D. Althoff, and, G. Derwand,. 1993. Using K-D trees to improve the retrieval step in case-based reasoning. In Proceedings of the First European Workshop on Case-Based Reasoning. Springer: Berlin, pp. 167-181.
95. Wetzel, J., and, K. Forbus,. 2009. Automated critique of sketched mechanisms. In Proceedings of the 21st Innovative Applications of Artificial Intelligence Conference, Pasadena, CA.
96. Wharton, C., K. Holyoak, P. Downing, T. Lange, T. Wickens, and, E. Melz,. 1994. Below the surface: Analogical similarity and retrieval competition in reminding. Cognitive Psychology, 26 (1): 64-101.
97. Wilson, R. C., E. R. Hancock, and, B. Luo,. 2005. Pattern vectors from algebraic graph theory. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27 (7): 1112-1124. (Pubitemid 41046906)
98. XML database. 2012. Available at. Accessed February 7, 2012.