{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:38:24Z","timestamp":1648921104026},"reference-count":25,"publisher":"International Academy Publishing (IAP)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.7.12.2832-2839","type":"journal-article","created":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T21:06:02Z","timestamp":1356728762000},"source":"Crossref","is-referenced-by-count":2,"title":["Vector-Distance and Neighborhood Development for High Dimensional Data"],"prefix":"10.17706","volume":"7","author":[{"given":"Ping","family":"Ling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangsheng","family":"Rong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyang","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2012,12,1]]},"reference":[{"key":"ref1","first-page":"177","volume-title":"The Curse of Dimension and a Universal Method for Numerical Integration","author":"Novak","year":"1998","unstructured":"[1] E Novak, K Ritter, \"The Curse of Dimension and a Universal Method for Numerical Integration,\" Multivariate Approximation and Splines, pp. 177-187, 1998."},{"key":"ref2","first-page":"482","volume-title":"Houle Hans-Peter Kriegel Peer Kr\u00f6ger Erich Schubert and Arthur Zimek","volume":"6187","author":"Michael","year":"2010","unstructured":"[2] Michael E. Houle, Hans-Peter Kriegel, Peer Kr\u00f6ger, Erich Schubert and Arthur Zimek, \"Can Shared-Neighbor Distances Defeat the Curse of Dimensionality?\" Lecture Notes in Computer Science, Volume 6187, pp. 482-500, 2010."},{"key":"ref3","first-page":"1","volume-title":"Zi Huang Heng Tao Shen and Xiaofang Zhou","volume":"6588","author":"Liu","year":"2011","unstructured":"[3] Jiajun Liu, Zi Huang, Heng Tao Shen and Xiaofang Zhou, \"Efficient Histogram-Based Similarity Search in Ultra-High Dimensional Space,\" Lecture Notes in Computer Science, Volume 6588, pp. 1-15, 2011."},{"key":"ref4","first-page":"518","article-title":"Similarity Search in High Dimensions via Hashing","volume-title":"Proceeding of International Conference on Very Large Data Bases","author":"Gionis","year":"1999","unstructured":"[4] A. Gionis, P. Indyk, and R. Motwani, \"Similarity Search in High Dimensions via Hashing,\" Proceeding of International Conference on Very Large Data Bases, pp. 518\u2013529, 1999."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.1000236"},{"key":"ref6","first-page":"107","article-title":"Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness","volume-title":"Proceeding of 18th Annual IEEE Conference on Computational Complexity","author":"Chakrabarti","year":"2003","unstructured":"[7] A. Chakrabarti, S.Khot, S. Xiaodong, \"Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness,\" Proceeding of 18th Annual IEEE Conference on Computational Complexity, pp. 107-117, 2003."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.6.4.812-817"},{"key":"ref8","first-page":"459","article-title":"Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions","volume-title":"Proceeding of 47th Annual IEEE Symposium on Foundations of Computer Science","author":"Andoni","year":"2006","unstructured":"[9] A. Andoni, P. Indyk, \"Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions,\" Proceeding of 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 459-468, 2006."},{"key":"ref9","first-page":"604","article-title":"Approximate Nearest Neighbors: towards Removing the Curse of Dimensionality","volume-title":"Proceeding of Symposium on Theory of Computing","author":"Indyk","year":"1998","unstructured":"[10] P. Indyk and R. Motwani, \"Approximate Nearest Neighbors: towards Removing the Curse of Dimensionality,\" Proceeding of Symposium on Theory of Computing, pp. 604-613, 1998."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/34.506411"},{"key":"ref11","first-page":"458","article-title":"An Adaptive Metric Machine for Pattern Classification","volume":"13","author":"Domeniconi","year":"2001","unstructured":"[13] C. Domeniconi, J. Peng, D. Gunopulos, \"An Adaptive Metric Machine for Pattern Classification,\" Advances in Neural Information Processing Systems, Vol. 13. pp. 458-464, 2001.","journal-title":"Adv Neural Inf Process Syst","ISSN":"http:\/\/id.crossref.org\/issn\/1049-5258","issn-type":"print"},{"key":"ref12","first-page":"1823","article-title":"Application","volume":"85","author":"Unni","year":"2004","unstructured":"[15] K.N.N. Unni, R. de Bettignies, S.-D. Seignon and J.-M. Nunzi, \"Application Physics Letter,\" Vol. 85, pp. 1823. 2004.","journal-title":"Phys Lett","ISSN":"http:\/\/id.crossref.org\/issn\/0031-9163","issn-type":"print"},{"key":"ref13","first-page":"311","article-title":"Statistical classification of raw textile defects","volume-title":"Proceedings of the 17th International Conference on Pattern Recognition","volume":"4","author":"Murino","year":"2004","unstructured":"[16] V.Murino, M. Bicego, I.A. Rossi, \"Statistical classification of raw textile defects,\" Proceedings of the 17th International Conference on Pattern Recognition, Vol. 4, pp. 311-314, 2004."},{"issue":"Issue 3","key":"ref14","first-page":"35","article-title":"LIBSVM: A library for support vector machines","volume":"2","author":"Chang","year":"2011","unstructured":"[17] C.C. Chang, C.J. Lin, \"LIBSVM: A library for support vector machines,\" ACM Transactions on Intelligent Systems and Technology, Volume 2 Issue 3, pp. 35-63, 2011.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"ref15","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","volume-title":"Proceeding of 24th International Conference on Very Large Data Bases","author":"Weber","year":"1998","unstructured":"[19] R. Weber, H. Schek, and S. Blott, \"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces,\" Proceeding of 24th International Conference on Very Large Data Bases, pp. 194\u2013205. 1998."},{"key":"ref16","first-page":"517","volume-title":"Chaofeng Sha Xiaoling Wang Bin Yang Aoying Zhou","volume":"6897","author":"Yuan","year":"2011","unstructured":"[20] Peisen Yuan, Chaofeng Sha, Xiaoling Wang, Bin Yang, Aoying Zhou, \"Efficient Approximate Similarity Search Using Random Projection Learning\", Lecture Notes in Computer Science, Volume 6897, pp. 517-529, 2011."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.6.11.2310-2320"},{"issue":"No 7","key":"ref18","first-page":"1265","article-title":"An Efficient Discriminant Analysis Algorithm for Document Classification","volume":"6","author":"Wang","year":"2011","unstructured":"[22] Z.Q. Wang, X. Sun, \"An Efficient Discriminant Analysis Algorithm for Document Classification,\" Journal of Computer, Vol 6, No 7, pp. 1265-1272, 2011.","journal-title":"Journal of Computer"},{"key":"ref19","first-page":"32","article-title":"Matching Query Processing in High-dimensional space","volume-title":"Proceeding of the 20th ACM International Conference on Information and Knowledge Management","author":"Ma","year":"2011","unstructured":"[23] Chunyang Ma, Yongluan Zhou, Lidan Shou, Dan Dai, Gang Chen, \"Matching Query Processing in High-dimensional space,\" Proceeding of the 20th ACM International Conference on Information and Knowledge Management, pp. 32-40, 2011."},{"key":"ref20","volume-title":"Kernel Methods in Natural Language Processing","author":"Renders","year":"2004","unstructured":"[24] J. Renders, \"Kernel Methods in Natural Language Processing,\" Learning Methods for Text Understanding and Mining Conference Tutorial, 2004."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.5.9.1297-1304"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[6] M. Datar, N Immorlica, P Indyk, \"Locality-sensitive hashing scheme based on p-stable distributions,\" Proceeding of 20th annual symposium on Computational geometry, p-. 253\u2013262, 2004.","DOI":"10.4304\/jcp.5.9.1297-1304"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[11] http:\/\/www.uncc.edu\/knowledgediscovery","DOI":"10.4304\/jcp.5.9.1297-1304"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[14] http:\/\/www.cs.cmu.edu\/afs\/cs\/project\/theo-11\/www\/naive-bayes.html","DOI":"10.4304\/jcp.5.9.1297-1304"},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[18] J. C. Platt, N. Cristianini, J. Shawe-Taylor, \"Large margin DAG's for Multiclass classification,\" Advances in neural information processing systems. MIT press, Cambridge, MA, 12: 547-553, 2000.","DOI":"10.4304\/jcp.5.9.1297-1304"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T04:58:16Z","timestamp":1498021096000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/8880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,1]]},"references-count":25,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2012,12,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.7.12.2832-2839","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12,1]]}}}