Randomized projective methods for the construction of binary sparse vector representations

Cybernetics and Systems Analysis

Volumn 48, Issue 1, 2012, Pages 146-156

  Rachkovskij, D A ^a   Misuno, I S ^a   Slipchenko, S V ^a  

^a INSTITUTE OF HYDROBIOLOGY   (Ukraine)

Author keywords

Distributed representation; Efficient similarity estimation; Random projection; Sparse binary representation; Vector representation

Indexed keywords

ASSOCIATIVE PROCESSING; BINS; DIGITAL ARITHMETIC; ENCODING (SYMBOLS);

DISTRIBUTED REPRESENTATION; EFFICIENT SIMILARITY ESTIMATIONS; RANDOM PROJECTIONS; SPARSE BINARY REPRESENTATIONS; VECTOR REPRESENTATIONS;

VECTORS;

EID: 85027935922     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-012-9384-0     Document Type: Article

References (25)

1. G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer, Addison-Wesley, Reading, MA (1989).
2. I. S. Misuno, D. A. Rachkovskij, S. V. Slipchenko, and A. M. Sokolov, "Searching for text information with the help of vector representations," Problemy Programmuvannya, No. 4, 50-59 (2005).
3. E. M. Kussul, Associative Neuron-Like Structures [in Russian], Naukova Dumka, Kyiv (1992).
4. D. A. Rachkovskij, "Modeling of thinking as a way of increasing intellectuality of information technologies and systems," System Technologies, No. 4 (57), 154-162 (2008).
5. D. A. Rachkovskij, "Linear classifiers based on binary distributed representations," Intern. J. Inform. Theories & Appl., 14, No. 3, 270-274 (2007).
6. D. A. Rachkovskij, I. S. Misuno, E. G. Revunova, S. V. Slipchenko, and A. M. Sokolov, "Conception and methods of distributed neural net information representation in AI problems," in: 14th Intern. Conf. "Problems of neurocybernetics," Vol. 2, Rostov-on-Don, Russia (2005), pp. 30-33.
7. D. A. Rachkovsky, S. V. Slipchenko, A. A. Frolov, and D. Gusek, "Resolution of binary coding of real-valued vectors by hyperrectangular receptive fields," Cybernetics and Systems Analysis, Vol. 41, No. 5, 635-646 (2005). (Pubitemid 43159453)
8. P. Kanerva, G. Sjodin, J. Kristoferson, R. Karlsson, B. Levin, A. Holst, J. Karlgren, and M. Sahlgren, "Computing with large random patterns," in: Foundations of Real-World Intelligence, CSLI Publications, Stanford, California (2001), pp. 251-311.
9. W. B. Johnson and J. Lindenstrauss, "Extensions of Lipshitz mapping into Hilbert space," Contemporary Mathemat., 26, 189-206 (1984).
10. S. S. Vempala, The Random Projection Method, American Mathemat. Soc., Providence, RI (2004).
11. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," J. of Comput. and System Sci., 66, No. 4, 671-687 (2003).
12. M. Charikar, "Similarity estimation techniques from rounding algorithms," in: ACM Symp. on Theory of Comput., 1, ACM, Montreal, Canada (2002), pp. 380-388. (Pubitemid 35009398)
13. K. Liu, H. Kargupta, and J. Ryan, "Random projection-based multiplicative data perturbation for privacy preserving distributed data mining," IEEE Transact. on Knowledge and Data Engineer., 18, No. 1, 92-106 (2006). (Pubitemid 43145091)
14. P. Li, T. J. Hastie, and K. W. Church, "Very sparse random projections," in: 12th ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, ACM Press, Philadelphia, PA, USA (2006), pp. 287-296. (Pubitemid 44535525)
15. X. G. Michel and P. W. David, "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming," J. of the Associat. for Comput. Machinery, 42, No. 6, 1115-1145 (1995).
16. D. A. Rachkovskij, "Representation and processing of structures with binary sparse distributed codes," IEEE Trans. on Knowledge and Data Engineer. 13, No. 2, 261-276 (2001). (Pubitemid 32444140)
17. D. A. Rachkovskij, "Some approaches to analogical mapping with structure sensitive distributed representations," J. of Experiment. and Theoret. Artificial Intell., 16, No. 3, 125-145 (2004).
18. D. A. Rachkovskij and E. M. Kussul, "Binding and normalization of binary sparse distributed representations by context-dependent thinning," Neural Comput., 13, No. 2, 411-452 (2001). (Pubitemid 33595005)
19. D. A. Rachkovskii, S. V. Slipchenko, E. M. Kussul', and T. N. Baidyk, "A binding procedure for distributed binary data representations," Cybernetics and Systems Analysis, Vol. 41, No. 3, 319-331 (2005). (Pubitemid 41430848)
20. A. A. Frolov, D. Husek, and D. A. Rachkovskii, "Time of searching for similar binary vectors in associative memory," Cybernetics and Systems Analysis, Vol. 42, No. 5, 615-623 (2006). (Pubitemid 46099779)
21. E. S. Venttsel', Probability Theory [in Russian], Nauka, Moscow (1969).
22. E. M. Kussul, T. N. Baidyk, L. M. Kasatkina, and V. V. Lukovich, "Rosenblatt perceptrons for handwritten digit recognition," in: Intern. Joint Conf. on Neural Networks, IEEE, 2, Washington, DC (2001), pp. 1516-1521.
23. E. Kussul, T. Baidyk, D. Wunsch, O. Makeyev, and A. Martin, "Permutation coding technique for image recognition systems," IEEE Transact. on Neural Networks, 17, No. 6, 1566-1579 (2006). (Pubitemid 44824268)
24. I. S. Misuno, D. A. Rachkovskij, and S. V. Slipchenko, "Experimental investigations of handwritten digit classification," System Technologies, No. 4 (39), 110-133 (2005).
25. N. M. Amosov, T. N. Baidyk, A. D. Goltsev, A. M. Kasatkin, L. M. Kasatkina, E. M. Kussul, and D. A. Rachkovskii, Neurocomputers and Intelligent Robots [in Russian], Naukova Dumka, Kyiv (1991).