MKL-tree: An index structure for high-dimensional vector spaces

Multimedia Systems

Volumn 12, Issue 6, 2007, Pages 533-550

  Franco, Annalisa ^a   Lumini, Alessandra ^a   Maio, Dario ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Dimensionality reduction; High dimensional data; Index structures; Similarity search

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; FEATURE EXTRACTION; INDEXING (OF INFORMATION); MATHEMATICAL TRANSFORMATIONS; VECTORS;

DATA INDEXING; HIGH DIMENSIONAL DATA; INDEX STRUCTURES; VECTOR SPACES;

TREES (MATHEMATICS);

EID: 34247597961     PISSN: 09424962     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00530-006-0070-9     Document Type: Article

References (42)

1. 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-72 (1999)
2. 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-105 (1998)
3. Bellmann, R.: Adaptive Control Process: A Guided Tour. Princeton University Press (1961.)
4. 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-588 (2000)
5. 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-39 (1996)
6. 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)
7. Böhm, C., Kriegel, H.P.: Efficient bulk loading of large high-dimensional indexes. In: Proceedings International Conference on Data Warehousing and Knowledge Discovery, pp. 251-260 (1999)
8. Cappelli, R., Maio, D., Maltoni, D.: Multi-space KL for pattern recognition and classification. IEEE Trans. Pattern Anal. Machine Intell. 23(9), 977-996 (2001)
9. 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-160 (1999)
10. Castelli, V., Thomasian, A., Li, C.S.: CSVD: clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowl Data Eng. 15, 671-685 (2003)
11. Cha, G.H., Chung, C.W.: The GC-tree: A high-dimensional index structure for similarity search in image databases. IEEE Trans. Multimed. 4(2), 235-247 (2002)
12. Cha, G.H., Zhu, X., Petkovic, D., Chung C.W.: An efficient indexing method for nearest neighbor searches in high-dimensional image databases. IEEE Trans. Multimed. 4(1), 76-87 (2002)
13. 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-100 (2000)
14. 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-447 (1999)
15. Cui, 13., 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-490 (2003)
16. 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-209 (2000)
17. Figueiredo, M., Jain, A.K.: Unsupervised learning of finite mixture models. IEEE Trans. Pattern Anal. Machine Intell. 24(3), 381-396 (2002)
18. Franco, A., Lumini, A., Maio, D.: Eigenspace merging for model updating. In: Proceedings of the International Conference on Pattern Recognition, 2, 156-159 (2002)
19. Fukunaga K.: Statistical Pattern Recognition. Academic, San Diego (1990)
20. Gaede, V., Günther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), (1998)
21. Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, CA (1993)
22. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 47-57 (1984)
23. Jolliffe, I.T.: Principal component analysis. Springer, Berlin Heidelberg New York (1986)
24. 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-509
25. Kanth, K.V., Agrawal, D., Singh, A.: Dimensionality reduction for similarity searching in dynamic databases. In: Proceedings ACM SIGMOD International Conference on Management of Data, pp. 166-176 (1998)
26. 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-380 (1997)
27. Kelly, P.M.: An algorithm for merging hyperellipsoidal clusters. Technical Report LA-UR-94-306, Los Alamos National Laboratory, Los Alamos, NM (1994)
28. Kumar, A.: G-Tree: A new data structure for organizing multidimensional data. IEEE Trans. Knowl Data Eng. 6, 341-347 (1994)
29. LDR: http://www.ics.uci.edu/~kaushik/research/ldr.html
30. Li, C., Molina, H.G., Wiederhold, G.: Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. Knowl Data Eng. 14, 792-808 (2002)
31. Lin, K., Jagadish, H., Faloutsos, C.: The TV-tree: an index structure for high-dimensional data. VLDB J 3(4), 517-542 (1994)
32. 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. 28.1-297, Berkeley University of California Press (1967)
33. Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The grid file: an adaptable symmetric multikey file structure. ACM Trans. Database Syst. 9(1), 38-71 (1984)
34. 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-413 (1997)
35. 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-526 (2000)
36. Salomon, D.: Data Compression: The Complete Reference. Springer, Berlin Heidelberg New York (1997)
37. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison Wesley, New York (1990)
38. 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-415 (1997)
39. 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-205 (1998)
40. White, D. A., Jain, R.: Similarity indexing with the SS-tree. In: Proceedings of the International Conference on Data Engineering, pp. 516-523 (1996)
41. Yu, D., Zhang, A.: ClusterTree: integration of clustering representation and nearest-neighbor search for large data sets with high dimensions. IEEE Trans Knowl. Data Eng. 15, 1316-1337 (2003)
42. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: a new data clustering algorithm and its applications. Data Min. Knowl. Discov. 1(2), (1997)