Image recommendation on content-based bipartite graph

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, online social curation networks attract lots of users due to its convenience to retrieve, collect, sort and share multimedia content with each other. And high quality recommendation on social curation networks becomes urgent in current complex information environment. In this paper, we proposed a content-based bipartite graph algorithm for social curation network recommendation. Bipartite graph employs relationships between users and items to infer user-item association for recommendation. Beyond the traditional bipartite graph, we introduce the content of items into bipartite graph to extend the recommendation scope and improve its recommendation diversity simultaneously. Furthermore, content similarity is employed for recommendation reranking to improve visual quality of recommended images. Experimental results demonstrate that the proposed method enhance the recommendation ability of bipartite graph effectively in diversity and visual quality.

Cite

CITATION STYLE

APA

Wu, L., Zhang, L., Jian, M., Zhang, D., & Liu, H. (2018). Image recommendation on content-based bipartite graph. In Communications in Computer and Information Science (Vol. 819, pp. 339–348). Springer Verlag. https://doi.org/10.1007/978-981-10-8530-7_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free