{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:36:51Z","timestamp":1760708211550},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T00:00:00Z","timestamp":1278633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10115-010-0322-z","type":"journal-article","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T10:03:00Z","timestamp":1278583380000},"page":"227-248","source":"Crossref","is-referenced-by-count":6,"title":["Distance approximation techniques to reduce the dimensionality for multimedia databases"],"prefix":"10.1007","volume":"28","author":[{"given":"Yongkwon","family":"Kim","sequence":"first","affiliation":[]},{"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[]},{"given":"Seok-Lyong","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Deok-Hwan","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,9]]},"reference":[{"key":"322_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Faloutsos C, Swami AN (1993) Efficient similarity search in sequence databases. In: Proceedings of the International Conference of Foundations of Data Organization and Algorithms, pp 69\u201384","DOI":"10.1007\/3-540-57301-1_5"},{"key":"322_CR2","doi-asserted-by":"crossref","unstructured":"Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 322\u2013331","DOI":"10.1145\/93605.98741"},{"key":"322_CR3","unstructured":"Berchtold S, Keim DA, Kriegel HP (1996) The x-tree : An index structure for high-dimensional data. In: Proceedings of International Conference on Very Large Data Bases, pp 28\u201339"},{"issue":"2","key":"322_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/TMM.2002.1017736","volume":"4","author":"GH Cha","year":"2002","unstructured":"Cha GH, Chung CW (2002) The gc-tree: a high-dimensional index structure for similarity search in image databases. IEEE Trans Multimed 4(2): 235\u2013247","journal-title":"IEEE Trans Multimed"},{"issue":"1","key":"322_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/6046.985556","volume":"4","author":"GH Cha","year":"2002","unstructured":"Cha GH, Zhu X, Petkovic P, Chung CW (2002) An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Trans Multimed 4(1): 76\u201387","journal-title":"IEEE Trans Multimed"},{"key":"322_CR6","unstructured":"Donoho DL (2000) High-dimensional data analysis: the curses and blessings of dimensionality. In: AMS Conference Mathematical Challenges of the 21st Century"},{"issue":"6","key":"322_CR7","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/TKDE.2004.9","volume":"16","author":"O Egecioglu","year":"2004","unstructured":"Egecioglu O, Ferhatosmanoglu H (2004) Dimensionality reduction and similarity computation by inner product approximations. IEEE Trans Knowl Data Eng 16(6): 714\u2013726","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"322_CR8","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 Publishers, Dordrecht"},{"key":"322_CR9","unstructured":"Fei-Fei L, Fergus R, Perona P (2004) Learning generative visual models from few training examples: an incremental bayesian approach tested on 101 object categories. In CVPR 2004, Workshop on Generative-Model Based Vision"},{"key":"322_CR10","doi-asserted-by":"crossref","unstructured":"Filho RFS, Traina AJM, Jr., CT, Faloutsos C (2001) Similarity search without tears: the OMNI family of all-purpose access methods. In: Proceedings of the seventeenth International Conference on Data Engineering, pp 623\u2013630","DOI":"10.1109\/ICDE.2001.914877"},{"issue":"1","key":"322_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:VISI.0000042993.50813.60","volume":"61","author":"JM Geusebroek","year":"2005","unstructured":"Geusebroek JM, Burghouts GJ, Smeulders AWM (2005) The Amsterdam library of object images. Int J Comput Vis 61(1): 103\u2013112","journal-title":"Int J Comput Vis"},{"key":"322_CR12","unstructured":"Griffin G, Holub A, Perona P (2007) Caltech-256 object category dataset, TR-7694, California Institute of Technology"},{"key":"322_CR13","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD international conference on Management of Data, pp 47\u201357","DOI":"10.1145\/971697.602266"},{"key":"322_CR14","doi-asserted-by":"crossref","unstructured":"Huang Z, Sun S, Wang W (2009) Efficient mining of skyline objects in subspaces over data streams, Knowledge and Information Systems, Online published","DOI":"10.1007\/s10115-008-0185-8"},{"issue":"1-2","key":"322_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/cviu.1999.0762","volume":"75","author":"KVR Kanth","year":"1999","unstructured":"Kanth KVR, Agrawal D, Abbadi AE, Singh A (1999) Dimensionality reduction for similarity searching in dynamic databases. Comput Vis Image Underst 75(1-2): 59\u201372","journal-title":"Comput Vis Image Underst"},{"key":"322_CR16","doi-asserted-by":"crossref","unstructured":"Katayama N, Satoh S (1997) The sr-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp 369\u2013380","DOI":"10.1145\/253262.253347"},{"issue":"13","key":"322_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/1520-684X(20001130)31:13<31::AID-SCJ4>3.0.CO;2-7","volume":"31","author":"N Katayama","year":"2000","unstructured":"Katayama N, Satoh S (2000) Application of multidimensional indexing methods to massive processing of multimedia information. Syst Comput Jpn 31(13): 31\u201341","journal-title":"Syst Comput Jpn"},{"key":"322_CR18","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Chakrabarti K, Mehrotra S, Pazzani MJ (2001) Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of the ACM SIGMOD international conference on Management of data, pp 369-380","DOI":"10.1145\/375663.375680"},{"issue":"3","key":"322_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011669","volume":"3","author":"EJ Keogh","year":"2001","unstructured":"Keogh EJ, Chakrabarti K, Pazzani MJ, Mehrotra S (2001) Dimensionality reduction for fast similarity search in large time series databases. Knowl Inform Syst 3(3): 263\u2013286","journal-title":"Knowl Inform Syst"},{"issue":"2","key":"322_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-009-0242-y","volume":"21","author":"S Lin","year":"2009","unstructured":"Lin S, Chen S, Wu W, Chen C (2009) Parameter determination and feature selection for back-propagation network by particle swarm optimization. Knowl Inform Syst 21(2): 249\u2013266","journal-title":"Knowl Inform Syst"},{"issue":"2","key":"322_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"D Lowe","year":"2003","unstructured":"Lowe D (2003) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2): 91\u2013110","journal-title":"Int J Comput Vis"},{"issue":"3","key":"322_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/MMUL.2002.1022862","volume":"9","author":"JM Martinez","year":"2002","unstructured":"Martinez JM (2002) Mpeg-7: overview of mpeg-7 description tools, part 2. IEEE Multimed 9(3): 83\u201393","journal-title":"IEEE Multimed"},{"key":"322_CR23","unstructured":"Sakurai Y, Yoshikawa M, Uemura S, Kojima H (2000) The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of the International Conference on Very Large Data Bases, pp 516\u2013526"},{"issue":"3","key":"322_CR24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10115-008-0180-0","volume":"20","author":"G Song","year":"2009","unstructured":"Song G, Cui B, Zheng B, Xie K, Yang D (2009) Accelerating sequence searching: dimensionality reduction method. Knowl Inform Syst 20(3): 301\u2013322","journal-title":"Knowl Inform Syst"},{"key":"322_CR25","unstructured":"UCI Machine Learning repository (1998) ftp:\/\/ftp.ics.uci.edu\/pub\/machine-learning-databases\/optdigits\/"},{"issue":"6","key":"322_CR26","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/TKDE.2008.30","volume":"20","author":"K Vu","year":"2008","unstructured":"Vu K, Hua K, Cheng H, Lang SD (2008) Bounded approximation: a new criterion for dimensionality reduction approximation in similarity search. IEEE Trans Knowl Data Eng 20(6): 768\u2013783","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"322_CR27","doi-asserted-by":"crossref","unstructured":"Vu K, Hua KA, Cheng H, Lang SD (2006) A non-linear dimensionality-reduction technique for fast similarity search in large databases. In: Proceedings of the ACM SIGMOD international conference on Management of data, pp 527\u2013538","DOI":"10.1145\/1142473.1142532"},{"key":"322_CR28","doi-asserted-by":"crossref","unstructured":"Wang JZ, Boujemaa N, Bimbo AD, Geman D, Hauptmann AG, Tesic J (2006) Diversity in multimedia information retrieval research. In: Proceedings of the ACM international workshop on Multimedia information retrieval, pp 5\u201312","DOI":"10.1145\/1178677.1178681"},{"key":"322_CR29","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings International Conference on Very Large Data Bases, pp 194\u2013205"},{"key":"322_CR30","unstructured":"White DA, Jain R (1996) Similarity indexing with the ss-tree. In: Proceedings of the International Conference on Data Engineering, pp 516\u2013523"},{"key":"322_CR31","unstructured":"Wu YL, Agrawal D, Abbadi AE (2000) A comparison of DFT and DWT based similarity search in time-series databases. In: Proceedings of the ACM CIKM International Conference on Information and Knowledge Management, pp 488\u2013495"},{"key":"322_CR32","unstructured":"Yi BK, Faloutsos C (2000) Fast time sequence indexing for arbitrary lp norms. In: Proceedings of the International Conference on Very Large Data Bases, pp 385\u2013394"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0322-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-010-0322-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-010-0322-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:06:19Z","timestamp":1559253979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-010-0322-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,9]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["322"],"URL":"https:\/\/doi.org\/10.1007\/s10115-010-0322-z","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,9]]}}}