Publisher
Springer International Publishing
Reference21 articles.
1. Achlioptas, D.: Database-friendly random projections. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2001, pp. 274–281. ACM, New York (2001)
2. Lecture Notes in Computer Science;K Beyer,1998
3. Damljanovic, D., Petrak, J., Lupu, M., Cunningham, H., Carlsson, M., Engstrom, G., Andersson, B.: Random indexing for finding similar nodes within large RDF graphs. In: Proceedings of the 8th International Conference on the Semantic Web, ESWC 2011, pp. 156–171. Springer, Heidelberg (2012).
http://dx.doi.org/10.1007/978-3-642-25953-1_13
4. Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60–65 (2003)
5. De Vries, C.M., De Vine, L., Geva, S.: Random indexing k-tree (2010). CoRR
abs/1001.0833
,
http://arxiv.org/abs/1001.0833
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exploring Random Indexing for Profile Learning;Future and Emergent Trends in Language Technology;2016
2. Random Indexing Explained with High Probability;Text, Speech, and Dialogue;2015