{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T23:10:00Z","timestamp":1736637000983,"version":"3.32.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,11,9]],"date-time":"2006-11-09T00:00:00Z","timestamp":1163030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,11,9]],"date-time":"2006-11-09T00:00:00Z","timestamp":1163030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimedia Systems"],"published-print":{"date-parts":[[2007,5]]},"DOI":"10.1007\/s00530-006-0070-9","type":"journal-article","created":{"date-parts":[[2006,11,8]],"date-time":"2006-11-08T14:07:50Z","timestamp":1162994870000},"page":"533-550","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["MKL-tree: an index structure for high-dimensional vector spaces"],"prefix":"10.1007","volume":"12","author":[{"given":"Annalisa","family":"Franco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Lumini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Maio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,11,9]]},"reference":[{"key":"70_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Procopiuc, C., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of ACM SIGMOD Conference on Management of Data, pp. 61\u201372 (1999)","DOI":"10.1145\/304181.304188"},{"key":"70_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of ACM SIGMOD Conference on Management of Data, pp. 94\u2013105 (1998)","DOI":"10.1145\/276305.276314"},{"key":"70_CR3","doi-asserted-by":"crossref","unstructured":"Bellmann, R.: Adaptive Control Process: A Guided Tour. Princeton University Press (1961)","DOI":"10.1515\/9781400874668"},{"key":"70_CR4","doi-asserted-by":"crossref","unstructured":"Berchtold, S., Boehm, C., Jagadish, H.V., Kriegel, H.P., Sander, J.: Independent quantization: an index compression technique for high-dimensional data spaces. In: Proceedings of the IEEE Data Engineering, pp. 577\u2013588 (2000)","DOI":"10.1109\/ICDE.2000.839456"},{"key":"70_CR5","unstructured":"Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-tree: an index structure for high-dimensional data. In: Proceedings of International Conference on Very Large Data Base, pp. 28\u201339 (1996)"},{"key":"70_CR6","doi-asserted-by":"crossref","unstructured":"Bhm, C., Berchtold, S., Keim, D.A.: Searching in high dimensional spaces: index structures for improving the performance of multimedia databases. ACM Compu. Surv. (2001)","DOI":"10.1145\/502807.502809"},{"key":"70_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Kriegel, H.P.: Efficient bulk loading of large high-dimensional indexes. In: Proceedings International Conference on Data Warehousing and Knowledge Discovery, pp. 251\u2013260 (1999)","DOI":"10.1007\/3-540-48298-9_27"},{"issue":"9","key":"70_CR8","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1109\/34.955111","volume":"23","author":"R. Cappelli","year":"2001","unstructured":"Cappelli R., Maio D., Maltoni D. (2001) Multi-space KL for pattern recognition and classification. IEEE Trans. Pattern Anal. Machine Intell. 23(9):977\u2013996","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"70_CR9","doi-asserted-by":"crossref","unstructured":"Cappelli, R., Maio, D., Maltoni, D.: Similarity search using multi-space KL. In: Proceedings of International Workshop on Database and Expert Systems Applications, pp.155\u2013160 (1999)","DOI":"10.1109\/DEXA.1999.795159"},{"key":"70_CR10","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TKDE.2003.1198398","volume":"15","author":"V. Castelli","year":"2003","unstructured":"Castelli V., Thomasian A., Li C.S. (2003) CSVD: clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowl Data Eng. 15, 671\u2013685","journal-title":"IEEE Trans. Knowl Data Eng."},{"issue":"2","key":"70_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1109\/TMM.2002.1017736","volume":"4","author":"G.H. Cha","year":"2002","unstructured":"Cha G.H., Chung C.W. (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":"70_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/6046.985556","volume":"4","author":"G.H. Cha","year":"2002","unstructured":"Cha G.H., Zhu X., Petkovic D., Chung C.W. (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":"70_CR13","unstructured":"Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: Proceedings of the International Conference on Very Large Data Base, pp. 89\u2013100 (2000)"},{"key":"70_CR14","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Mehrotra, S.: The hybrid-tree: an index structure for high-dimensional feature spaces. In: Proceedings of the IEEE International Conference on Data Engineering, pp. 440\u2013447 (1999)","DOI":"10.1109\/ICDE.1999.754960"},{"key":"70_CR15","doi-asserted-by":"crossref","unstructured":"Cui, B., Ooi, B.C., Su, J.W., Tan, K.L.: Contorting high dimensional data for efficient main memory processing. In: Proceedings of the ACM SIGMOD International Conference On Management of Data, pp. 479\u2013490 (2003)","DOI":"10.1145\/872757.872815"},{"key":"70_CR16","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El Abbadi, A.: Vector approximation based indexing for non-uniform high dimensional data sets. In: Proceedings of the ACM International Conference on Information and Knowledge Management, pp. 202\u2013209 (2000)","DOI":"10.1145\/354756.354820"},{"issue":"3","key":"70_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/34.990138","volume":"24","author":"M. Figueiredo","year":"2002","unstructured":"Figueiredo M., Jain A.K. (2002) Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Machine Intell. 24(3):381\u2013396","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"70_CR18","doi-asserted-by":"crossref","unstructured":"Franco, A., Lumini, A., Maio, D.: Eigenspace merging for model updating. In: Proceedings of the International Conference on Pattern Recognition, 2, 156\u2013159 (2002)","DOI":"10.1109\/ICPR.2002.1048261"},{"key":"70_CR19","volume-title":"Statistical Pattern Recognition","author":"K. Fukunaga","year":"1990","unstructured":"Fukunaga K. (1990) Statistical Pattern Recognition. Academic, San Diego"},{"key":"70_CR20","doi-asserted-by":"crossref","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), (1998)","DOI":"10.1145\/280277.280279"},{"key":"70_CR21","volume-title":"Transaction Processing: Concepts and Techniques","author":"J. Gray","year":"1993","unstructured":"Gray J., Reuter A. (1993) Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, CA"},{"key":"70_CR22","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"70_CR23","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. (1986) Principal component analysis. Springer, Berlin Heidelberg New York"},{"key":"70_CR24","unstructured":"Kamel, I., Faloutsos, C.: Hilbert R-tree: an improved R-tree using fractals. In: Proceedings of International Conference on Very Large Data Base, pp. 500\u2013509"},{"key":"70_CR25","doi-asserted-by":"crossref","unstructured":"Kanth, K.V., Agrawal, D., Singh, A.: Dimensionality for similarity searching in dynamic databases. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 166\u2013176 (1998)","DOI":"10.1145\/276305.276320"},{"key":"70_CR26","doi-asserted-by":"crossref","unstructured":"Katayama, N., Satoh, S.: The SR-tree: an index structure for high dimensional nearest neighbor queries. In: Proceedings of SIGMOD International Conference on Management of Data, pp. 369\u2013380 (1997)","DOI":"10.1145\/253262.253347"},{"key":"70_CR27","unstructured":"Kelly, P.M.: An algorithm for merging hyperellipsoidal clusters. Technical Report LA-UR-94-306, Los Alamos National Laboratory, Los Alamos, NM (1994)"},{"key":"70_CR28","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1109\/69.277778","volume":"6","author":"A. Kumar","year":"1994","unstructured":"Kumar A. (1994) G-Tree: A new data structure for organizing multidimensional data. IEEE Trans. Knowl Data Eng. 6, 341\u2013347","journal-title":"IEEE Trans. Knowl Data Eng."},{"key":"70_CR29","unstructured":"LDR: http:\/\/www.ics.uci.edu\/~kaushik\/research\/ldr.html"},{"key":"70_CR30","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1109\/TKDE.2002.1019208","volume":"14","author":"C. Li","year":"2002","unstructured":"Li C., Molina H.G., Wiederhold G. (2002) Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowl Data Eng. 14, 792\u2013808","journal-title":"IEEE Trans. Knowl Data Eng."},{"issue":"4","key":"70_CR31","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01231606","volume":"3","author":"K. Lin","year":"1994","unstructured":"Lin K., Jagadish H., Faloutsos C. (1994) The TV-tree: an index structure for high-dimensional data. VLDB J 3(4):517\u2013542","journal-title":"VLDB J"},{"key":"70_CR32","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Berkeley Symposium on Mathematical statistics and probability, vol. 1, pp. 281\u2013297, Berkeley University of California Press (1967)"},{"issue":"1","key":"70_CR33","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt J., Hinterberger H., Sevcik K.C. (1984) The grid file: an adaptable symmetric multikey file structure. ACM Trans. Database Syst. 9(1):38\u201371","journal-title":"ACM Trans. Database Syst."},{"key":"70_CR34","doi-asserted-by":"crossref","unstructured":"Ortega, M., Rui, Y., Chakrabarti, K., Mehrotra, S., Huang, T.S.: Supporting similarity queries in MARS. In: Proceedings of the ACM Confernece on Multimed. 403\u2013413 (1997)","DOI":"10.1145\/266180.266394"},{"key":"70_CR35","unstructured":"Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of the International Conference on Very Large Data Base, pp. 516\u2013526 (2000)"},{"key":"70_CR36","volume-title":"Data Compression: The Complete Reference","author":"D. Salomon","year":"1997","unstructured":"Salomon D. (1997) Data Compression: The Complete Reference. Springer, Berlin Heidelberg New York"},{"key":"70_CR37","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"Samet H. (1990) The Design and Analysis of Spatial Data Structures. Addison Wesley, New York"},{"key":"70_CR38","unstructured":"Van den Bercken, J., Seeger, B., Widmayer, P.: A generic approach to bulk loading multidimensional index structures. In: Proceedings of the International Conference on Very Large Data Base, Athens, pp. 406\u2013415 (1997)"},{"key":"70_CR39","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for Similarity-search methods in high-dimensional spaces. In: Proceedings of the International Conference on Very Large Data Base, pp. 194\u2013205 (1998)"},{"key":"70_CR40","doi-asserted-by":"crossref","unstructured":"White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the International Conference on Data Engineering, pp. 516\u2013523 (1996)","DOI":"10.1109\/ICDE.1996.492202"},{"key":"70_CR41","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1109\/TKDE.2003.1232281","volume":"15","author":"D. Yu","year":"2003","unstructured":"Yu D., Zhang A. (2003) ClusterTree: integration of clustering representation and nearest-neighbor search for large data sets with high dimensions. IEEE Trans Knowl. Data Eng. 15:1316\u20131337","journal-title":"IEEE Trans Knowl. Data Eng."},{"key":"70_CR42","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Discov. 1(2), (1997)","DOI":"10.1145\/235968.233324"}],"container-title":["Multimedia Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00530-006-0070-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00530-006-0070-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00530-006-0070-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00530-006-0070-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T22:30:44Z","timestamp":1736634644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00530-006-0070-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11,9]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["70"],"URL":"https:\/\/doi.org\/10.1007\/s00530-006-0070-9","relation":{},"ISSN":["0942-4962","1432-1882"],"issn-type":[{"type":"print","value":"0942-4962"},{"type":"electronic","value":"1432-1882"}],"subject":[],"published":{"date-parts":[[2006,11,9]]},"assertion":[{"value":"9 November 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}