{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:58:03Z","timestamp":1777550283123,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T00:00:00Z","timestamp":1129766400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2007,1,29]]},"DOI":"10.1007\/s00778-005-0167-3","type":"journal-article","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T03:43:12Z","timestamp":1140493392000},"page":"219-234","source":"Crossref","is-referenced-by-count":28,"title":["An adaptive and dynamic dimensionality reduction method for high-dimensional indexing"],"prefix":"10.1007","volume":"16","author":[{"given":"Heng Tao","family":"Shen","sequence":"first","affiliation":[]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,20]]},"reference":[{"key":"167_CR1","doi-asserted-by":"crossref","unstructured":"Yu, C.: High-dimensional indexing. Ph.D. thesis, Department of Computer Science, National University of Singapore (2001)","DOI":"10.1007\/3-540-45770-4"},{"key":"167_CR2","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbors meaningful? In: ICDT, pp. 217\u2013235 (1999)","DOI":"10.1007\/3-540-49257-7_15"},{"key":"167_CR3","doi-asserted-by":"crossref","unstructured":"Ooi, B.C., Tan, K.L., Yu, C., Bressan, S.: Indexing the edges: a simple and yet efficient approach to high-dimensional indexing. In: PODS, pp. 166\u2013174 (2000)","DOI":"10.1145\/335168.335219"},{"key":"167_CR4","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: VLDB, pp. 89\u2013100 (2000)"},{"key":"167_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal Component Analysis","author":"I.T. Jolliffe","year":"1986","unstructured":"Jolliffe, I.T.: Principal Component Analysis. Springer-Verlag, Berlin Heidelberg New York (1986)"},{"key":"167_CR6","unstructured":"Yu, C., Ooi, B.C., Tan, K.L., Jagadish, H.V.: Indexing the distance: an efficient method to KNN processing. In: VLDB, pp. 166\u2013174 (2001)"},{"key":"167_CR7","doi-asserted-by":"crossref","unstructured":"Jin, H., Ooi, B.C., Shen, H.T., Yu, C., Zhou, A.: An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In: ICDE, pp. 87\u201398 (2003)","DOI":"10.1109\/ICDE.2003.1260784"},{"issue":"3","key":"167_CR8","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C. B\u00f6hm","year":"2001","unstructured":"B\u00f6hm, C., Berchtold, S., Keim, D.: Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33(3), 322\u2013373 (2001)","journal-title":"ACM Comput. Surv."},{"key":"167_CR9","unstructured":"Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity search methods in high dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)"},{"key":"167_CR10","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.-P.: The pyramid-technique: towards breaking the curse of dimensionality. In: SIGMOD, pp. 142\u2013153 (1998)","DOI":"10.1145\/276304.276318"},{"key":"167_CR11","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: SIGMOD, pp. 61\u201372 (1999)","DOI":"10.1145\/304182.304188"},{"key":"167_CR12","unstructured":"Hinneburg, A., Keim, D.A.: An optimal grid-clustering: towards breaking the curse of diminsionality in high dimensional clustering. In: VLDB, pp. 506\u2013517 (1999)"},{"key":"167_CR13","doi-asserted-by":"crossref","unstructured":"Vitter, J.S., Wang, M.: Approximate computation of multidimensional aggregates of sparse data using wavelets. In: SIGMOD, pp. 193\u2013204 (1999)","DOI":"10.1145\/304182.304199"},{"key":"167_CR14","doi-asserted-by":"crossref","unstructured":"Lee, J.H., Kim, D.H., Chung, C.W.: Multi-dimensional selectivity estimation using compressed histogram information. In: SIGMOD, pp. 205\u2013214 (1999)","DOI":"10.1145\/304182.304200"},{"key":"167_CR15","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional spaces. In: ICDT, pp. 420\u2013434 (2001)","DOI":"10.1007\/3-540-44503-X_27"},{"key":"167_CR16","unstructured":"Duda, R.: Pattern recognition for HCI. http:\/\/www.engr.sjsu.edu\/~knapp\/"},{"key":"167_CR17","doi-asserted-by":"crossref","unstructured":"Sung, K.K., Poggio, T.: Example-based learning for view-based human face detection. In: PAMI 20(1), 39\u201351 (1998)","DOI":"10.1109\/34.655648"},{"issue":"4","key":"167_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s007990050026","volume":"1","author":"J.Z. Wang","year":"1998","unstructured":"Wang, J.Z., Wiederhold, G., Firschein, O., Wei, S.X.: Content-based image indexing and searching using daubechies wavelets. In. J. Digital Lib. 1(4), 311\u2013328 (1998)","journal-title":"In. J. Digital Lib."},{"key":"167_CR19","unstructured":"http:\/\/www.virtualdub.org"},{"key":"167_CR20","doi-asserted-by":"crossref","unstructured":"Wu, Y.-L., Agrawal, D., Abbadi, A.E.: A comparison of DFT and DWT based similarity search in time-series databases. In: CIKM, pp. 488\u2013495 (2000)","DOI":"10.1145\/354756.354857"},{"key":"167_CR21","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Mehrotra, S.: The hybrid tree: an index structure for high dimensional feature spaces. In: ICDE, pp. 322\u2013331 (1999)","DOI":"10.1109\/ICDE.1999.754960"},{"key":"167_CR22","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: an index structure for high-dimensional spaces using relative approximation. In: VLDB, pp. 516\u2013526 (2000)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0167-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-005-0167-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-005-0167-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:04:59Z","timestamp":1559142299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-005-0167-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,20]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1,29]]}},"alternative-id":["167"],"URL":"https:\/\/doi.org\/10.1007\/s00778-005-0167-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,20]]}}}