On bidirectional transitions between localist and distributed representations : The case of common substrings search using Vector Symbolic Architecture

作者: Denis Kleyko , Evgeny Osipov

DOI: 10.1016/J.PROCS.2014.11.091

关键词:

摘要: The contribution of this article is twofold. First, it presents an encoding approach for seamless bidirectional transitions between localist and distributed representation domains. Second, the appr ...

参考文章(16)
Pentti Kanerva, Sparse Distributed Memory ,(1988)
Richard M. Karp, Michael O. Rabin, Efficient randomized pattern-matching algorithms Ibm Journal of Research and Development. ,vol. 31, pp. 249- 260 ,(1987) , 10.1147/RD.312.0249
Donald E Knuth, James H Morris, Jr, Vaughan R Pratt, Fast Pattern Matching in Strings SIAM Journal on Computing. ,vol. 6, pp. 323- 350 ,(1977) , 10.1137/0206024
Diederik Aerts, Marek Czachor, Bart De Moor, Geometric analogue of holographic reduced representation Journal of Mathematical Psychology. ,vol. 53, pp. 389- 398 ,(2009) , 10.1016/J.JMP.2009.02.005
Imran S. Haque, Vijay S. Pande, W. Patrick Walters, Anatomy of high-performance 2D similarity calculations. Journal of Chemical Information and Modeling. ,vol. 51, pp. 2345- 2351 ,(2011) , 10.1021/CI200235E
A. M. Sokolov, Vector representations for efficient comparison and search for similar strings Cybernetics and Systems Analysis. ,vol. 43, pp. 484- 498 ,(2007) , 10.1007/S10559-007-0075-1
E. Ukkonen, On-line construction of suffix trees Algorithmica. ,vol. 14, pp. 249- 260 ,(1995) , 10.1007/BF01206331
B.M. Popovic, Generalized chirp-like polyphase sequences with optimum correlation properties IEEE Transactions on Information Theory. ,vol. 38, pp. 1406- 1409 ,(1992) , 10.1109/18.144727