{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:06:53Z","timestamp":1725487613415},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_30","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T13:35:58Z","timestamp":1184592958000},"page":"357-366","source":"Crossref","is-referenced-by-count":0,"title":["Generating High Dimensional Data and Query Sets"],"prefix":"10.1007","author":[{"given":"Sang-Wook","family":"Kim","sequence":"first","affiliation":[]},{"given":"Seok-Ho","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Sang-Cheol","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Junghoon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Miyoung","family":"Shin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. Bohm","year":"2001","unstructured":"Bohm, C., Berchtold, S., Keim, D.: Searching in High-Dimensional Spaces-index Structures for Improving the Performance of Multimedia Databases. ACM Computing Surveys\u00a033, 322\u2013373 (2001)","journal-title":"ACM Computing Surveys"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ogras, U., Ferhatosmanoglu, H.: Dimensionality Reduction Using Magnitude and Shape Approximations. In: Proc. of the 12th\u00a0Int\u2019l. Conf. on Information and Knowledge Management, pp. 99\u2013107 (2003)","DOI":"10.1145\/956863.956883"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1007\/11827405_84","volume-title":"Database and Expert Systems Applications","author":"S. Jeong","year":"2006","unstructured":"Jeong, S., Kim, S.-W., Kim, K., Choi, B.-U.: An effective method for approximating the euclidean distance in high-dimensional space. In: Bressan, S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2006. LNCS, vol.\u00a04080, pp. 863\u2013872. Springer, Heidelberg (2006)"},{"key":"30_CR4","first-page":"314","volume-title":"Proc. Int\u2019l. Conf. on Data Engineering","author":"M. Arya","year":"1994","unstructured":"Arya, M., et al.: QBISM: Extending a DBMS to Support 3D Medical Images. In: Proc. Int\u2019l. Conf. on Data Engineering, pp. 314\u2013325. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/ICDE.1998.655779","volume-title":"Proc. Int\u2019l. Conf. on Data Engineering","author":"S. Berchtold","year":"1998","unstructured":"Berchtold, S., et al.: Fast Nearest Neighbor Search in High-Dimensional Space. In: Proc. Int\u2019l. Conf. on Data Engineering, pp. 209\u2013218. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"30_CR6","unstructured":"Weber, R., Schek, H., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. Int\u2019l. Conf. on Very Large Data Bases, pp. 194\u2013205 (1998)"},{"key":"30_CR7","unstructured":"Berchtold, S., Keim, D., Kriegel, H.: The X-tree: An Index Structure for High-Dimensional Data. In: Proc Int\u2019l. Conf. on Very Large Data Bases, pp. 28\u201339 (1996)"},{"key":"30_CR8","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/234889.234891","volume":"25","author":"J. Zobel","year":"1996","unstructured":"Zobel, J., Moffat, A., Ramamohanarao, K.: Guidelines for Presentation and Comparison of Indexing Techniques. ACM SIGMOD Record\u00a025, 10\u201315 (1996)","journal-title":"ACM SIGMOD Record"},{"key":"30_CR9","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.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Kim, S., Aggarwal, C., Yu, P.: Effective Nearest Neighbor Indexing with the Euclidean Metric. In: Proc. ACM Int\u2019l. Conf. on Information and Knowledge Management, pp. 9\u201316 (2001)","DOI":"10.1145\/502585.502588"},{"key":"30_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal Component Analysis","author":"I. Jolliffe","year":"1986","unstructured":"Jolliffe, I.: Principal Component Analysis. Springer, Heidelberg (1986)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:27:35Z","timestamp":1550435255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}