Algorithm of Repeated Results Re-ranking based on Polysemy
- https://doi.org/10.2991/iccset-14.2015.100How to use a DOI?
- polysemy, re-rank, search, concept lattice
In order to make search results better fit users’ current search interest, this paper proposes an algorithm of repeated results re-ranking using a model of polysemy. The algorithm considers the characteristics of the keywords to improve the rank of repeated results. Based on the analysis of polysemy of the keywords, we propose a polysemous model of concept lattice, then we combine with the user interest model to change the rank of repeated results in a search session. The method of this paper considers the impact of polysemy of keywords which may improve the ranking. The experimental results show that the process based on the polysemy of the keyword can reduce the length of the search session, especially when the keywords have multiple meanings.
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Pengwei Guo AU - Bin Zhang AU - Da-ming Sun PY - 2015/01 DA - 2015/01 TI - Algorithm of Repeated Results Re-ranking based on Polysemy BT - Proceedings of the 2014 International Conference on Computer Science and Electronic Technology PB - Atlantis Press SP - 448 EP - 455 SN - 2352-538X UR - https://doi.org/10.2991/iccset-14.2015.100 DO - https://doi.org/10.2991/iccset-14.2015.100 ID - Guo2015/01 ER -