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

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 ba...

Full description

Saved in:
Bibliographic Details
Published in:2008 International Conference on Computer and Communication Engineering pp. 1357 - 1362
Main Authors: Islam, R., Sarker, B.D.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2008
Subjects:
Application software
Citation analysis
Computer science
Equations
Information analysis
Information retrieval
Social network services
Testing
Voting
Web sites
ISBN:9781424416912, 1424416914
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISBN:9781424416912
1424416914
DOI:10.1109/ICCCE.2008.4580827