Abstract
Search engines usually return relevant sorted results based on the keywords. Because of the lack of considering the user's current search interest and intention, this kind of strategy may not meet users' personalized search requirements. In order to retrieve results associated with the user's current search interest, existing researches integrate the user's interest information into the search process and ranking, so as to make the search results fit to the user's current search target more better. Different from the unified model of interest which most current related researches used, we propose a model of combing user's interests for the purpose of ranking in the light of different query types. This paper first classified queries into several types based on the current keywords and the sources of user's interests, such as short-term interest in user clicks, and long-term interest in user's search history, search logs of the search system etc. Then based on the sources of interests, we established a model of combination of interests which based on the artificial neural network and was trained by related approaches and data sets. Depending on different query types, we combined these sources of user's interests that the most best reflecting the user's current search intention to enhance the user's search experience. Comparing with the existing model of single interest, the results of the experiments show that our model can obtain better ranking on the results.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.