{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:50:51Z","timestamp":1742993451511,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319195803"},{"type":"electronic","value":"9783319195810"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19581-0_43","type":"book-chapter","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T02:30:20Z","timestamp":1433385020000},"page":"437-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Random Indexing Revisited"],"prefix":"10.1007","author":[{"given":"Behrang","family":"QasemiZadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,4]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013281. ACM, New York (2001)","DOI":"10.1145\/375551.375608"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013171. Springer, Heidelberg (2012). http:\/\/dx.doi.org\/10.1007\/978-3-642-25953-1_13","DOI":"10.1007\/978-3-642-25953-1_13"},{"issue":"1","key":"43_CR4","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60\u201365 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"43_CR5","unstructured":"De Vries, C.M., De Vine, L., Geva, S.: Random indexing k-tree (2010). CoRR abs\/1001.0833, http:\/\/arxiv.org\/abs\/1001.0833"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"De Vries, C.M., Geva, S.: Pairwise similarity of TopSig document signatures. In: Proceedings of the Seventeenth Australasian Document Computing Symposium, ADCS 2012, pp. 128\u2013134. ACM, New York (2012)","DOI":"10.1145\/2407085.2407103"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Deerwester, S.C., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by latent semantic analysis. J. Am. Soc. Inf. Sci. 41(6), 391\u2013407 (1990). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.49.7546","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Geva, S., De Vries, C.M.: TOPSIG: topology preserving document signatures. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, CIKM 2011, pp. 333\u2013338. ACM, New York (2011)","DOI":"10.1145\/2063576.2063629"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Johnson, W., Lindenstrauss, J.: Extensions of lipschitz mappings into a Hilbert space. In: Conference in Modern Analysis and Probability (New Haven, Connecticut, 1982), Contemporary Mathematics, vol. 26, pp. 189\u2013206. American Mathematical Society (1984). http:\/\/www.ams.org\/books\/conm\/026\/","DOI":"10.1090\/conm\/026\/737400"},{"key":"43_CR10","unstructured":"Kanerva, P., Kristoferson, J., Holst, A.: Random indexing of text samples for latent semantic analysis. In: Proceedings of the 22nd Annual Conference of the Cognitive Science Society, pp. 103\u2013106. Erlbaum (2000). http:\/\/www.rni.org\/kanerva\/cogsci2k-poster.txt"},{"key":"43_CR11","unstructured":"Lapesa, G., Evert, S.: Evaluating neighbor rank and distance measures as predictors of semantic priming. In: Proceedings of the Fourth Annual Workshop on Cognitive Modeling and Computational Linguistics (CMCL), pp. 66\u201374. Association for Computational Linguistics, Sofia, Bulgaria, August 2013. http:\/\/www.aclweb.org\/anthology\/W13-2608"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Li, P., Hastie, T.J., Church, K.W.: Very sparse random projections. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pp. 287\u2013296. ACM, New York (2006)","DOI":"10.1145\/1150402.1150436"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-08389-6_17","volume-title":"Graph-Based Representation and Reasoning","author":"M Lupu","year":"2014","unstructured":"Lupu, M.: On the usability of random indexing in patent retrieval. In: Hernandez, N., J\u00e4schke, R., Croitoru, M. (eds.) ICCS 2014. LNCS, vol. 8577, pp. 202\u2013216. Springer, Heidelberg (2014)"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Polajnar, T., Clark, S.: Improving distributional semantic vectors through context selection and normalisation. In: Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2014). ACL, Gothenburg, Sweden (2014). http:\/\/www.cl.cam.ac.uk\/%7Esc609\/pubs\/eacl14tam.pdf","DOI":"10.3115\/v1\/E14-1025"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"QasemiZadeh, B.: Random indexing explained with high probability (2015)","DOI":"10.1007\/978-3-319-24033-6_47"},{"key":"43_CR16","unstructured":"Sahlgren, M.: An introduction to random indexing. In: Methods and Applications of Semantic Indexing Workshop at the 7th International Conference on Terminology and Knowledge Engineering, TKE 2005 (2005). http:\/\/soda.swedish-ict.se\/221\/1\/RI_intro.pdf"},{"issue":"11","key":"43_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/361219.361220","volume":"18","author":"G Salton","year":"1975","unstructured":"Salton, G., Wong, A., Yang, C.S.: A vector space model for automatic indexing. Commun. ACM 18(11), 613\u2013620 (1975)","journal-title":"Commun. ACM"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Turney, P.D., Pantel, P.: From frequency to meaning: vector space models of semantics. J. Artif. Int. Res. 37(1), 141\u2013188 (2010). http:\/\/dl.acm.org\/citation.cfm?id=1861751.1861756","DOI":"10.1613\/jair.2934"},{"key":"43_CR19","unstructured":"Zadeh, B.Q., Handschuh, S.: Evaluation of technology term recognition with random indexing. In: Calzolari, N., Choukri, K., Declerck, T., Loftsson, H., Maegaard, B., Mariani, J., Moreno, A., Odijk, J., Piperidis, S. (eds.) Proceedings of the Ninth International Conference on Language Resources and Evaluation (LREC 2014). European Language Resources Association (ELRA), Reykjavik, Iceland, May 2014. http:\/\/www.lrec-conf.org\/proceedings\/lrec2014\/pdf\/920_Paper.pdf, aCL Anthology Identifier: L14\u20131703"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Zadeh, B.Q., Handschuh, S.: Random Manhattan indexing. In: 25th International Workshop on Database and Expert Systems Applications, DEXA 2014, pp. 203\u2013208. IEEE (2014). http:\/\/dx.doi.org\/10.1109\/DEXA.2014.51","DOI":"10.1109\/DEXA.2014.51"},{"key":"43_CR21","unstructured":"Zadeh, B.Q., Handschuh, S.: Random Manhattan integer indexing: incremental L1 normed vector space construction. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1713\u20131723. Association for Computational Linguistics (2014). http:\/\/aclweb.org\/anthology\/D14-1178"}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19581-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:32:32Z","timestamp":1675859552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19581-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319195803","9783319195810"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19581-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}