{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:08:30Z","timestamp":1748664510607,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240688"},{"type":"electronic","value":"9783319240695"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24069-5_35","type":"book-chapter","created":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T05:51:11Z","timestamp":1441777871000},"page":"371-379","source":"Crossref","is-referenced-by-count":0,"title":["Text Relevance Analysis Method over Large-Scale High-Dimensional Text Data Processing"],"prefix":"10.1007","author":[{"given":"Ling","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Tie Hua","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Keun Ho","family":"Ryu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,24]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth annual ACM Symposium on Theory of Computing, pp. 604\u2013613. ACM Press, Dallas (1998)","DOI":"10.1145\/276698.276876"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Dean, J., Ghemawat, S.: MapReduce: Simplified Data Processing on Large Clusters. M. Communications, 107\u2013113 (2008). ACM Press","DOI":"10.1145\/1327452.1327492"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Dean, J., Ghemawat, S.: MapReduce: A Flexible Data Processing Tool. M. Communications, 72\u201377 (2010). ACM Press","DOI":"10.1145\/1629175.1629198"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Thusoo, A., Sarma, J.S., Jain, N., Shao, Z., Chakka, P., Zhang, N., Anthony, S., Liu, H., Murthy, R.: Hive \u2013 a petabyte scale data warehouse using hadoop. In: Proceedings of the 26th International Conference on Data Engineering, pp. 996\u20131005. IEEE Press, Long Beach (2010)","DOI":"10.1109\/ICDE.2010.5447738"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic Hashing. J. Approximate Reasoning, 969\u2013978 (2009). Elsevier Press","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Liu, W., Wang, J., Ji, R., Jiang, Y.G., Chang, S.F.: Supervised hashing with kernels. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, pp. 2074\u20132081. IEEE Press, Providence (2012)","DOI":"10.1109\/CVPR.2012.6247912"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for scalable image retrieval. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, pp. 3424\u20133431. IEEE Press, San Francisco (2010)","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: Spherical hashing. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition, pp. 2957\u20132964. IEEE Press, Providence (2012)","DOI":"10.1109\/CVPR.2012.6248024"},{"key":"35_CR9","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional space. In: Proceedings of the 24th International Conference on Very Large Data Bases, pp. 194\u2013205. Morgan Kaufmann Press, New York (1998)"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Heisterkamp, D.R., Peng, J.: Kernel vector approximation files for relevance feedback retrieval in large image databases. J. Multimedia Tools and Applications, pp. 175\u2013189. Kluwer Academic Press (2005)","DOI":"10.1007\/s11042-005-0454-4"},{"key":"35_CR11","unstructured":"The Apache Software Foundation. Hadoop. http:\/\/hadoop.apache.org\/"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Shim, K.: MapReduce algorithms for big data analysis. J. PVLDB, pp. 2016\u20132017 (2012). VLDB Endowment Press","DOI":"10.14778\/2367502.2367563"},{"key":"35_CR13","unstructured":"The Apache Software Foundation. Mahout. http:\/\/mahout.apache.org\/"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Deng, D., Li, G., Hao, S., Wang, J., Feng, J.: Massjoin: a mapreduce-based algorithm for string similarity joins. In: Proceedings of International Conference on Data Engineering, pp. 340\u2013351. IEEE Press, Chicago (2013)","DOI":"10.1109\/ICDE.2014.6816663"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Wang, Y., Metwally, A., Parthasarathy, S.: Scalable all-pairs similarity search in metric spaces. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 829\u2013837. ACM Press, Chicago (2013)","DOI":"10.1145\/2487575.2487625"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Lu, W., Shen, Y., Chen, S., Ooi, B.C.: Efficient Processing of k Nearest Neighbor Joins Using MapReduce. J. PVLDB, pp. 1016\u20131027 (2012). VLDB Endowment","DOI":"10.14778\/2336664.2336674"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, C., Li, F., Jestes, J.: Efficient parallel kNN joins for large data in MapReduce. In: Proceedings of the 15th International Conference on Extending Database Technology, pp. 38\u201349. ACM Press, Berlin (2012)","DOI":"10.1145\/2247596.2247602"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Kllapi, H., Harb, B., Yu, C.: Near neighbor join. In: Proceedings of International Conference on Data Engineering, pp. 1120\u20131131. IEEE Press, Chicago (2014)","DOI":"10.1109\/ICDE.2014.6816728"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Metwally, A., Faloutsos, C.: V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity Joins of Multisets and Vectors. J. PVLDB, pp. 704\u2013715 (2012). VLDB Endowment","DOI":"10.14778\/2212351.2212353"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Okcan, A., and Riedewald, M.: Processing Theta-Joins Using MapReduce. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 949\u2013960. ACM Press, Athens (2011)","DOI":"10.1145\/1989323.1989423"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Kim, Y., Shim, K.: Parallel top-k similarity join algorithms using MapReduce. In: Proceedings of International Conference on Data Engineering, pp. 510\u2013521. IEEE Press, Washington (2012)","DOI":"10.1109\/ICDE.2012.87"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, pp. 495\u2013506. ACM Press, Indianapolis (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Lin, J.: Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce. In: Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 155\u2013162. ACM Press, Boston (2009)","DOI":"10.1145\/1571941.1571970"},{"key":"35_CR24","unstructured":"Lewis, D.D.: Reuters-21578 Text Categorization Test Collection. http:\/\/www.daviddlewis.com\/resources\/testcollections\/reuters21578\/"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24069-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T14:18:17Z","timestamp":1748614697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24069-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240688","9783319240695"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24069-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}