Web Image Clustering with Reduced Keywords and Weighted Bipartite Spectral Graph Partitioning

@inproceedings{Koh2006WebIC,
  title={Web Image Clustering with Reduced Keywords and Weighted Bipartite Spectral Graph Partitioning},
  author={Su Ming Koh and L. Chia},
  booktitle={PCM},
  year={2006}
}
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… 

Image clustering through community detection on hybrid image similarity graphs

A community detection (i.e. graph-based clustering) approach that makes use of both visual and tagging features of images in order to efficiently extract groups of related images within large image collections.

Tagged Documents Co-Clustering

A hierarchical agglomerative co-clustering algorithm is proposed to group together the most related tags into clusters, and some stopping criterion for selectecting an optimal partitioning is proposed.

Study of Cloud Services Recommendation Model Based on Chord Ring

Experimental results show that the cloud services recommendation model based on chord ring can effectively improve the recommendation accuracy and recommend efficiency.

References

SHOWING 1-10 OF 13 REFERENCES

Hierarchical clustering of WWW image search results using visual, textual and link information

A hierarchical clustering method using visual, textual and link analysis to cluster the search results into different semantic clusters of image search results is proposed.

Co-clustering documents and words using bipartite spectral graph partitioning

A new spectral co-clustering algorithm is used that uses the second left and right singular vectors of an appropriately scaled word-document matrix to yield good bipartitionings and it can be shown that the singular vectors solve a real relaxation to the NP-complete graph bipartitionsing problem.

Web image clustering by consistent utilization of visual features and surrounding texts

A novel method named consistent bipartite graph co-partitioning is proposed, which can cluster Web images based on the consistent fusion of the information contained in both low-level features and surrounding texts and can be efficiently solved by semi-definite programming (SDP).

Content-based image retrieval by clustering

A novel image retrieval scheme, CLUster-based rEtrieval of images by unsupervised learning (CLUE), which tackles the semantic gap problem based on a hypothesis: semantically similar images tend to be clustered in some feature space.

Iteratively clustering web images based on link and attribute reinforcements

A reinforcement clustering framework that reinforces images and texts' attributes via inter-type links and inversely uses these attributes to update these links to promise the discovery of the semantic structure of images, which is the basis of image clustering.

Frequent term-based text clustering

Two algorithms for frequent term-based text clustering are presented, FTC which creates flat clusterings and HFTC for hierarchical clustering, which obtain clusterings of comparable quality significantly more efficiently than state-of-the- artText clustering algorithms.

Unsupervised multistage image classification using hierarchical clustering with a bayesian similarity measure

The region-merging approach based on spatial contextual information was shown to provide more accurate classification of images with smooth spatial patterns to increase computational efficiency while maintaining spatial connectivity in merging.

Image clustering system on WWW using Web texts

This paper proposes an image clustering system that labels images by words related to a search keyword, and shows how relationships are measured by Web pages in WWW.

Using latent semantic analysis to improve access to textual information

Initial tests find this completely automatic method widely applicable and a promising way to improve users' access to many kinds of textual materials, or to objects and services for which textual descriptions are available.

Text document clustering based on frequent word sequences

In this paper, a new text clustering algorithm, named Clustering based on Frequent Word Sequences (CFWS) is proposed, and it has been shown that CFWS has much better performance.