Abstract
There has been recent work done in the area of search result organization for image retrieval. The main aim is to cluster the search results into semantically meaningful groups. A number of works benefited from the use of the bipartite spectral graph partitioning method [3][4]. However, the previous works mentioned use a set of keywords for each corresponding image. This will cause the bipartite spectral graph to have a high number of vertices and thus high in complexity. There is also a lack of understanding of the weights used in this method. In this paper we propose a two level reduced keywords approach for the bipartite spectral graph to reduce the complexity of bipartite spectral graph. We also propose weights for the bipartite spectral graph by using hierarchical term frequency-inverse document frequency (tf-idf). Experimental data show that this weighted bipartite spectral graph performs better than the bipartite spectral graph with a unity weight. We further exploit the tf-idf weights in merging the clusters.
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
Cai, D., He, X., Li, Z., Ma, W.-Y., Wen, J.-R.: Hierarchical Clustering of WWW Image Search Results Using Visual. In: Textual and Link Information. MM 2004, October 10-16, ACM, New York (2004)
Wang, X.-J., Ma, W.-Y., Zhang, L., Li, X.: Iteratively Clustering Web Images Based on Link and Attribute Reinforcements. In: MM 2005, November 6-11, ACM, New York (2005)
Gao, B., Liu, T.-Y., Zheng, X., Cheng, Q.-S., Ma, W.-Y.: Web Image Clustering by Consistent Utilization of Visual Features and Surrounding Texts. In: MM 2005, November 6-11, ACM, New York (2005)
Dhillon, I.S.: Co-clustering documents and words using Bipartite Spectral Graph Partitioning. In: KDD 2001, ACM, New York (2001)
Sunayama, W., Nagata, A., Yachida, M.: Image Clustering System on WWW using Web Texts. In: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems, IEEE, Los Alamitos (2004)
Porter, M.F.: An Algorithm for Suffix Stripping. Program 1980.
Beil, F., Ester, M., Xu, X.: Frequent Term-Bsaed Text Clustering. In: SIGKDD 2002, ACM, New York (2002)
Lee, S., Crawford, M.M.: Unsupervised Multistage Image Classification Using Hierarchical Clustering with a Bayesian Similarity Measure. In: IEEE Transactions on Image Processing, IEEE, Los Alamitos (2005)
Chen, Y., Wang, J.Z., Krovetz, R.: Content Based Image Retrieval by Clustering. In: MIR 2003, ACM, New York (2003)
Dumais, S.T., Furnas, G.W., Landauer, T.K., Deerwester, S.: Using Latent Semantic Analysis to improve information retrieval. In: CHI 1988, ACM, New York (1988)
Xu, J.-S., Wang, L.: TCBLHT: A New Method of Hierarchical Text Clustering. In: International Conference on Machine Learning and Cybernetics 2005, IEEE, Los Alamitos (2005)
Li, Y., Chung, S.M.: Text Document Clustering Based on Frequent Word Sequence. In: CIKM 2005, ACM, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koh, S.M., Chia, LT. (2006). Web Image Clustering with Reduced Keywords and Weighted Bipartite Spectral Graph Partitioning. In: Zhuang, Y., Yang, SQ., Rui, Y., He, Q. (eds) Advances in Multimedia Information Processing - PCM 2006. PCM 2006. Lecture Notes in Computer Science, vol 4261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922162_100
Download citation
DOI: https://doi.org/10.1007/11922162_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48766-1
Online ISBN: 978-3-540-48769-2
eBook Packages: Computer ScienceComputer Science (R0)