A weighted-graph-based approach for diversifying search results Online publication date: Sat, 07-Mar-2015
by Guangzhi Qu, Hui Wu
International Journal of Knowledge and Web Intelligence (IJKWI), Vol. 2, No. 1, 2011
Abstract: Despite the explosive growth of internet usage, satisfying users' experience in web search while understanding the dynamic nature of search engine ranking remains a challenge. The main reason is that user queries and web documents may belong to different categories given a taxonomy of information. In this study, we attempt to detangle the ambiguity in web search by using a systematic approach. A weighted graph model is utilised to represent the complicated documents network from web search results. In this model, document topics are explicitly defined from the weighted document graph with an unsupervised learning method. On weighing each topic, both the size of the topic and the intra-topic document importance distribution are considered. In order to achieve web search results diversity, the reranking method proposed in this work leverages on the relevance of the documents to the query and related topics. Evaluation results on synthetic data and realistic web pages show the efficacy of a proposed system.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge and Web Intelligence (IJKWI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook