Clickthrough refinement for improved graph ranking
- Publication Type:
- Conference Proceeding
- Citation:
- Proceedings of the International Joint Conference on Neural Networks, 2017, 2017-May pp. 3288 - 3295
- Issue Date:
- 2017-06-30
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 07966268.pdf | Published version | 225.66 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017 IEEE. Graph ranking is a promising technique for image retrieval, but its effectiveness is limited by the so-called semantic gap. To mitigate this gap, clickthroughs, which are helpful to perceive the visual content of images, are adopted by graph ranking models recently. However, few existing models take both sparseness and noisiness of clickthroughs into account, which are important in refining the clickthrough-based search results. In this paper, we propose a novel solution to clickthrough refinement that consists of two key components. The first one is to prune the noisy clickthroughs by a neighbor voting strategy, and the second one is to enrich the incomplete clickthroughs by a Tri-CF (collaborative filtering) algorithm. Furthermore, we devise four solutions to affinity matrices fusion in order to leverage the clickthroughs and visual features within a unified graph ranking model. Our extensive experiments for clickthrough prediction and image retrieval validate the effectiveness of the proposed techniques in comparison to state-of-the-art approaches.
Please use this identifier to cite or link to this item: