{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T22:51:09Z","timestamp":1756075869148},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,5,16]],"date-time":"2008-05-16T00:00:00Z","timestamp":1210896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s11042-008-0206-3","type":"journal-article","created":{"date-parts":[[2008,5,15]],"date-time":"2008-05-15T15:13:34Z","timestamp":1210864414000},"page":"241-259","source":"Crossref","is-referenced-by-count":8,"title":["Optimal subspace dimensionality for k-nearest-neighbor queries on clustered and dimensionality reduced datasets with SVD"],"prefix":"10.1007","volume":"40","author":[{"given":"Alexander","family":"Thomasian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,16]]},"reference":[{"key":"206_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, Seattle, WA, June 1998, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"issue":"4","key":"206_CR2","first-page":"3","volume":"20","author":"W Barbara","year":"1997","unstructured":"Barbara W, DuMouchel W, Faloutsos C, Haas PJ, Hellerstein JM, Ioannidis Y, Jagadish HV, Johnson T, Ng R, Poosala V, Ross KA, Sevcik KC (1997) The New Jersey data reduction report. Data Eng Bull 20(4):3\u201342, December","journal-title":"Data Eng Bull"},{"key":"206_CR3","unstructured":"Beckmann N, Kriegel H-P, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, Atlantic City, NJ, May 1990, pp 322\u2013331"},{"issue":"1","key":"206_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/PL00021478","volume":"3","author":"LD Bergman","year":"2000","unstructured":"Bergman LD, Castelli V, Li C-S, Smith JR (2000) SPIRE: a digital library for scientific information. Int J Digit Libr 3(1):85\u201399","journal-title":"Int J Digit Libr"},{"issue":"2","key":"206_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/357775.357776","volume":"25","author":"C Bohm","year":"2000","unstructured":"Bohm C (2000) A cost model for query processing in high-dimensional data space. ACM Trans Database Syst 25(2):129\u2013178","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"206_CR6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C Bohm","year":"2001","unstructured":"Bohm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces \u2013 index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3):322\u2013373, September","journal-title":"ACM Comput Surv"},{"key":"206_CR7","first-page":"373","volume-title":"Image databases: search and retrieval of digital imagery","author":"V Castelli","year":"2002","unstructured":"Castelli V (2002) Multidimensional indexing structures for content-based retrieval. In: Castelli V, Bergman LD (eds) Image databases: search and retrieval of digital imagery. Wiley-Interscience, New York, pp 373\u2013434"},{"key":"206_CR8","volume-title":"Image databases: search and retrieval of digital imagery","year":"2002","unstructured":"Castelli V, Bergman LD (eds) (2002) Image databases: search and retrieval of digital imagery. Wiley-Interscience, New York"},{"issue":"3","key":"206_CR9","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1109\/TKDE.2003.1198398","volume":"14","author":"V Castelli","year":"2003","unstructured":"Castelli V, Thomasian A, Li CS (2003) CSVD: clustering and singular value decomposition for approximate similarity search in high dimensional spaces. IEEE Trans Knowl Data Eng 14(3):671\u2013685, June","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"206_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti K, Mehrotra S (1999) The hybrid tree: an index structure for high dimensional feature spaces. In: Proc. 15th IEEE int\u2019l conf. on data eng. - ICDE, Sidney, Australia, March 1999, pp 440\u2013447","DOI":"10.1109\/ICDE.1999.754960"},{"key":"206_CR11","unstructured":"Chakrabarti K, Mehrotra S (2000) Local dimensionality reduction: a new approach to indexing high dimensional space. In: Proc. int\u2019l conf. on very large data bases - VLDB, Cairo, Egypt, August 2000, pp 89\u2013100"},{"key":"206_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1445-5","volume-title":"Searching multimedia databases by content","author":"C Faloutsos","year":"1996","unstructured":"Faloutsos C (1996) Searching multimedia databases by content. Kluwer Academic, Boston, MA"},{"key":"206_CR13","unstructured":"Faloutsos C, Kamel I (1994) Beyond uniformity and independence: analysis of the R-tree using the concept of fractal dimension. In: Proc. ACM symp. on principles of database systems - PODS, Minneapolis, MN, June 1994, pp 4\u201313"},{"issue":"1","key":"206_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F Farnstrom","year":"2000","unstructured":"Farnstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms \u201crevisited\u201d. ACM SIGKDD Explor Newslett 2(1):51\u201357","journal-title":"ACM SIGKDD Explor Newslett"},{"issue":"2","key":"206_CR15","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, Gunther O (1998) Multidimensional access methods. ACM Comput Surv 30(2): 170\u2013231","journal-title":"ACM Comput Surv"},{"key":"206_CR16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comp Sci 38:293\u2013306","journal-title":"Theor Comp Sci"},{"key":"206_CR17","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2006","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques. Morgan-Kaufmann, San Francisco"},{"key":"206_CR18","first-page":"83","volume-title":"Proc. 4th symp. advances in spatial databases, lecture notes in computer science 951","author":"GR Hjaltason","year":"1995","unstructured":"Hjaltason GR, Samet H (1995) Ranking in spatial databases. In: Proc. 4th symp. advances in spatial databases, lecture notes in computer science 951, Springer, Berlin Heidelberg New York, pp 83\u201395"},{"key":"206_CR19","doi-asserted-by":"crossref","unstructured":"Jin H, Ooi BC, Shen H, Yu C (2003) An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In: Proc. 19th IEEE int\u2019l conf. on data engineering - ICDE, Bangalore, India, March 2003, pp 87\u2013100","DOI":"10.1109\/ICDE.2003.1260784"},{"key":"206_CR20","volume-title":"Principal component analysis","author":"IT Jolliffe","year":"2002","unstructured":"Jolliffe IT (2002) Principal component analysis. Springer, Berlin Heidelberg New York"},{"key":"206_CR21","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The SR-tree: an index structure for high dimensional nearest neighbor queries. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, Tucson, AZ, May 1997, pp 369\u2013380","DOI":"10.1145\/253260.253347"},{"issue":"6","key":"206_CR22","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TPAMI.1986.4767859","volume":"8","author":"B Kim","year":"1986","unstructured":"Kim B, Park S (1986) A fast k-nearest-neighbor finding algorithm based on the ordered partition. IEEE Trans Pattern Anal Mach Intell 8(6):761\u2013766","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"206_CR23","unstructured":"Korn F, Jagadish HV, Faloutsos C (1997) Efficiently supporting ad hoc queries in large datasets of time sequences. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, Tucson, AZ, May 1997, pp 289\u2013300"},{"issue":"1","key":"206_CR24","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/69.908983","volume":"13","author":"F Korn","year":"2001","unstructured":"Korn F, Pagel B, Faloutsos C (2001) On the \u201cdimensionality curse\u201d and the \u201cself-similarity blessing\u201d. IEEE Trans Knowl Data Eng 13(1):96\u2013111","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"206_CR25","unstructured":"Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1996) Fast nearest neighbor search in medical image databases. In: Proc. 22nd int\u2019l conf. on very large data bases - VLDB, Mumbai, India, September 1996, pp 215\u2013226"},{"issue":"6","key":"206_CR26","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/69.738356","volume":"10","author":"F Korn","year":"1998","unstructured":"Korn F, Sidiropoulos N, Faloutsos C, Siegel E, Protopapas Z (1998) Fast and effective retrieval of medical tumor shapes: nearest neighbor search in medical image databases. IEEE Trans Knowl Data Eng 10(6):889\u2013904","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"206_CR27","unstructured":"Li Y (2004) Efficient similarity search in high-dimensional data spaces. Ph.D. dissertation, Computer Science Department, New Jersey Institute of Technology - NJIT, Newark, NJ, May"},{"key":"206_CR28","doi-asserted-by":"crossref","unstructured":"McCallum A, Nigam K, Unger LH (2000) Efficient clustering of high-dimensional data sets with applications to reference matching. In: Proc. 6th ACM SIGKDD int\u2019l conf. on knowledge discovery and data mining, Boston, MA, 20\u201323 August 2000, pp 169\u2013178","DOI":"10.1145\/347090.347123"},{"key":"206_CR29","first-page":"173","volume-title":"Proc. SPIE vol. 1908: storage and retrieval for image and video databases","author":"W Niblack","year":"1993","unstructured":"Niblack W, Barber R, Equitz W, Flickner M, Glasman EH, Petkovic D, Yanker P, Faloutsos C, Taubin G (1993) The QBIC project: querying images by content, using color, texture, and shape. In: Niblack W (ed) Proc. SPIE vol. 1908: storage and retrieval for image and video databases, SPIE, Bellingham, pp 173\u2013187"},{"issue":"1","key":"206_CR30","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newslett 6(1):90\u2013105","journal-title":"ACM SIGKDD Explor Newslett"},{"key":"206_CR31","doi-asserted-by":"crossref","unstructured":"Roussopoulos N, Kelley S, Vincent F (1995) Nearest neighbor queries. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, San Jose, CA, June 1995, pp 71\u201379","DOI":"10.1145\/223784.223794"},{"key":"206_CR32","volume-title":"Fundamentals of multidimensional and metric data structure","author":"H Samet","year":"2007","unstructured":"Samet H (2007) Fundamentals of multidimensional and metric data structure. Morgan- Kaufmann, San Francisco"},{"key":"206_CR33","unstructured":"Singh AK, Lang CA (2001) Modeling high-dimensional index structures using sampling. In: Proc. ACM SIGMOD int\u2019l conf. on management of data, Santa Barbara, CA, June 2001, pp 389\u2013400"},{"key":"206_CR34","doi-asserted-by":"crossref","unstructured":"Theodoridis Y, Sellis T (1996) A model for the prediction of R-tree performance. In: Proc. ACM symp. on principles of database systems - PODS, Montreal, Quebec, Canada, June 1996, pp 161\u2013171","DOI":"10.1145\/237661.237705"},{"key":"206_CR35","unstructured":"Thomasian A, Castelli V, Li CS (1998) RCSVD: recursive clustering and singular value decomposition for approximate high-dimensionality indexing. In: Proc. conf. on information and knowledge management - CIKM, Baltimore, MD, November 1998, pp 201\u2013207"},{"key":"206_CR36","unstructured":"Thomasian A, Li Y, Zhang L (2003) Performance comparison of local dimensionality reduction methods. Technical report ISL-2003-01, Integrated Systems Lab, Computer Science Dept., New Jersey Institute of Technology"},{"issue":"6","key":"206_CR37","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.ipl.2005.03.003","volume":"94","author":"A Thomasian","year":"2005","unstructured":"Thomasian A, Li Y, Zhang L (2005) Exact k-NN queries on clustered SVD datasets. Inf Process Lett 94(6):247\u2013252, July","journal-title":"Inf Process Lett"},{"issue":"6","key":"206_CR38","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1093\/comjnl\/bxl035","volume":"49","author":"A Thomasian","year":"2006","unstructured":"Thomasian A, Zhang L (2006) Persistent semi-dynamic ordered partition index. Comput J 49(6):670\u2013684, June","journal-title":"Comput J"},{"key":"206_CR39","doi-asserted-by":"crossref","unstructured":"White DA, Jain R (1996) Similarity indexing: algorithms and performance. In: Storage and retrieval for image and video databases SPIE, vol 2670. SPIE, San Jose, CA, pp 62\u201373","DOI":"10.1117\/12.234810"},{"key":"206_CR40","unstructured":"Yi BK, Faloutsos C (2000) Fast time sequence indexing for arbitrary Lp norms. In: Proc. 26th int\u2019l conf. on very large data bases - VLDB, Cairo, Egypt, September 2000, pp 385\u2013394"},{"key":"206_CR41","unstructured":"Zhang L (2005) High-dimensional indexing methods utilizing clustering and dimensionality reduction. Ph.D. dissertation, Computer Science Department, New Jersey Institute of Technology - NJIT, Newark, NJ, May"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-008-0206-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-008-0206-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-008-0206-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:27:49Z","timestamp":1559359669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-008-0206-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,16]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s11042-008-0206-3","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,16]]}}}