Abstract
Content-based information retrieval (CBIR) of multimedia data is an active research topic in intelligent information retrieval field. To support CBIR, high-dimensional data indexing and query is a challenging problem due to the inherent high dimension of multimedia data. Clustering-based indexing structures have been proved to be efficient for high-dimensional data indexing. However, most clustering-based indexing structures are static, in which new data cannot be inserted by just modifying the existing clusters or indexing structures. To resolve this problem, a two-level indexing method, called IASDS plus IPAT method, is developed in this paper. At the IASDS level, clusters and the corresponding subspaces can be incrementally updated, while the indexing structures within the clusters can be incrementally updated at the IPAT level. Furthermore, the proposed IASDS plus IPAT method is able to balance indexing efficiency and query accuracy by choosing an appropriate number of children nodes. The experimental results show that the IASDS plus IPAT method is very efficient for updating clusters and indexing structures with newly inserted data, and that its query accuracy is only slightly degraded while its query time is almost the same in comparison with the similar indexing structure built by non-incremental method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, C.C., Procopiuc, C., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proc. of the ACM SIGMOD Conf., Philadelphia, PA, pp. 61–72 (1999)
Aggarwal, C.C., Yu, P.S.: Finding generalized projected clusters in high dimensional spaces. Sigmod Record 29, 70–92 (2000)
Castelli, V., Thomasian, A., Li, C.S.: CSVD: Clustering and singular value decomposition for approximate similarity searches in high dimensional space. IEEE Trans. on Knowledge and Data Engineering 15, 671–685 (2003)
Chakrabarti, K., Mehrotra, S.: The hybrid tree: An index structure for high dimensional feature spaces. In: IEEE Conf. on Data Engineering, Sydney, Australia, pp. 440–447 (1999)
Chandrasekaran, S., Manjunath, B.S., Wang, F.Y., Winkeler, J., Zhang, H.: An eigenspace update algorithm for image analysis. Graphical Models and Image Processing 59, 321–332 (1997)
Li, C., Chang, E., Garcia-Molina, H., Wang, J., Wiederhold, G.: Clindex: Clustering for similarity queries in high-dimensional spaces. IEEE Trans. on Knowledge and Engineering 14, 792–808 (2002)
Faloutsos, C., Lin, K.I.: FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia databases. In: ACM SIGMOD, pp. 163–174 (1995)
Grabmeier, J., Rudolph, A.: Techniques of cluster algorithms in data mining. Data Mining and Knowledge Discovery 6, 303–360 (2002)
Jain, A., Dubes, R.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs (1998)
Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Computing Surveys 31, 264–323 (1999)
Kavcic, A., Yang, B.: Subspace tracking with adaptive threshold rank estimation. VLSI Signal Processing 14, 75–91 (1996)
Li, C., Chang, E., Molina, H.G., Wiederhold, G.: Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans. on Knowledge and Data Engineering 14, 792–808 (2002)
McNames, J.: A fast nearest neighbor algorithm based on a principal axis search tree. IEEE Trans. on Pattern Analysis and Intelligence 23, 964–976 (2001)
Pentland, A., Picard, R.W., Sclaro, S.: Photobook: Content-based manipulation of image databases. Int. Journal of Computer Vision Archive 18, 233–254 (1996)
Strobach, P.: Low rank adaptive filtering. IEEE Trans. Signal Processing 44, 2932–2947 (1996)
Wang, B., Gan, J.Q.: Integration of projected clusters and principal axis trees for high-dimensional data indexing and query. In: IEEE Conf. on Intelligent Data Engineering and Automated Learning, Exeter, UK, pp. 191–196 (2004)
Yeh, C.H., Kuo, C.J.: Iteration-free clustering algorithm for nonstationary image database. IEEE Trans. on Multimedia 5, 223–236 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, B., Gan, J.Q. (2005). An Incremental Updating Method for Clustering-Based High-Dimensional Data Indexing. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_73
Download citation
DOI: https://doi.org/10.1007/11596448_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)