By Topic

An effective term weighting method using random walk model for information retrieval

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Islam, R. ; Comput. Sci. & Eng. Discipline, Khulna Univ., Khulna ; Sarker, B.D. ; Islam, R.

Document representation is one of the most fundamental issues in information retrieval application. In this aspect, to rank a document term weighting system has crucial importance. The graph-based ranking algorithms represent documents as a graph. The weight of a vertex in the graph is calculated based on the global information of that vertex. The similarity of the subject of a document to a query can be calculated by various ways and a particular calculation provides ranking to the document. This paper introduces an effective random-walk term weighting method to rank a document by considering position of terms (vertex) within the document and information gain of terms corresponds to the whole set of documents. The experiments on standard test collections show that our approach improves the recall and precision.

Published in:

Computer and Communication Engineering, 2008. ICCCE 2008. International Conference on

Date of Conference:

13-15 May 2008