Abstract
Nowadays large volumes of data with high dimensionality are being generated in many fields. ClusterTree is a new indexing approach representing clusters generated by any existing clustering approach. It supports effective and efficient image retrieval. Lots of clustering algorithms have been developed, and in most of them some parameters should be determined by hand. The authors propose a new ClusterTree structure, which based on the improved CLIQUE and avoids any parameters defined by user. Using multi-resolution property of wavelet transforms, the proposed approach can cluster at different resolution and remain the relation between these clusters to construct hierarchical index. The results of the application confirm that the ClusterTree is very applicable and efficient.
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.
References
Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An Efficient Data Clustering Method for Very Large Databases. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Canada, pp. 103–114. ACM, New York (1996)
Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, Seattle, pp. 73–84. ACM Press, New York (1998)
Ester, M., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. of the 2nd Int’l Conf. on Knowledge Discovery and Data Mining (KDD’96), Portland, pp. 226–231. AAAI Press, Menlo Park (1996)
Hinneburg, A., Keim, D.: An efficient approach to clustering in large multimedia databases with noise. In: Proc. of the 4th Int’l Conf. on Knowledge Discovery and Data Mining (KDD’98), New York, pp. 58–65. AAAI Press, Menlo Park (1998)
Ma, S., et al.: A fast clustering algorithm based on reference and density. Journal of Software 14(6), 1089–1095 (2003)
Kan, L., Zheng, Z.X., Ru, Z.D.: Clustering by Ordering Density-Based Subspaces and Visualization. Journal of Computer Research and Development 40(10), 1509–1513 (2003)
Wang, W., Yang, J., Muntz, R.R.: STING: A statistical information grid approach to spatial data mining. In: Proc. of the 23rd Int’l Conf. on Very Large Data Bases, Athens, pp. 186–195. Morgan Kaufmann, San Francisco (1997)
Sheikholeslami, G., Chatterjee, S., Zhang, A.D.: WaveCluster: A multi-resolution clustering approach for very large spatial databases. In: Proc. of the 24th Int’l Conf. on Very Large Data Bases, New York, pp. 428–439. Morgan Kaufmann, San Francisco (1998)
Rakesh, A., et al.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. of the 1998 ACM SIGMOD Int’l Conf. on Management of Data, Minneapolis, pp. 94–105. ACM Press, New York (1998)
Kailing, K., Kriegel, H.-P., Kroger, P.: Density-Connected Subspace Clustering for High-Dimensional Data. In: Proc. 4th SIAM Int. Conf. on Data Mining, Lake Buena Vista, FL, pp. 246–257. SIAM, Philadelphia (2004)
Domeniconi, C., et al.: Subspace Clustering of High Dimensional Data. In: SIAM International Conference on Data Mining (SDM), Apr. 2004, SIAM, Philadelphia (2004), http://www.cs.ucr.edu/~dimitris/publications.html
Goil, S., Nagesh, H., Choudhary, A.: MAFIA: Efficient and Scalable Subspace Clustering Clustering for Very Large Data Sets. Technical Report CPDC-TR-9906-010, Northwestern University, Evanston, IL (June 1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Xu, H., Xu, D., Lin, E. (2007). An Applicable Hierarchical Clustering Algorithm for Content-Based Image Retrieval. In: Gagalowicz, A., Philips, W. (eds) Computer Vision/Computer Graphics Collaboration Techniques. MIRAGE 2007. Lecture Notes in Computer Science, vol 4418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71457-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-71457-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71456-9
Online ISBN: 978-3-540-71457-6
eBook Packages: Computer ScienceComputer Science (R0)