A PROPOSED QUERY-SENSITIVE SIMILARITY MEASURE FOR INFORMATION RETRIEVAL

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ZOU ALGHADRI JAHROMI M.; VALIZADEH M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING Year:2006 | Volume:30 | Issue:B2 Page(s): 171-180

Download Full-Text

Persian Verion

View:

1,102

Download:

243

Cites:

Information Journal Paper

Title

A PROPOSED QUERY-SENSITIVE SIMILARITY MEASURE FOR INFORMATION RETRIEVAL

Author(s)

ZOU ALGHADRI JAHROMI M. | VALIZADEH M.R. | Issue Writer Certificate

Keywords

QUERY SENSITIVE SIMILARITY MEASUREQ3

DOCUMENT CLUSTERINGQ3

GENETIC ALGORITHMQ3

Abstract

Document clustering has been widely used in information retrieval systems in order to improve the efficiency and also the effectiveness of ranked output systems using clustering hypothesis. Based on this hypothesis, documents relevant to a query tend to be highly similar in the context defined by the query. In this way, a pair of documents has an overall similarity (ignoring the query) and a specific similarity (similarity of a pair of documents given a query). A Query-Sensitive Similarity Measure (QSSM) is a mechanism to measure the similarity of two documents given a query. In this paper, in the first step, we identify the sources of information that may be used for this purpose. In the second step, we propose a QSSM based on these information sources. Finally, we propose a parametric QSSM that simultaneously makes use of the product and weighted sum to fuse the information from the identified sources. A GENETIC ALGORITHM is used to learn the optimal values of parameters in this measure for a specific collection. The leave-one-out method is used to evaluate the proposed learning scheme. Our motivation for this is to see whether the learning scheme can perform significantly better than the measure proposed in the second step. Using several document collections, the performance of each measure is evaluated and the results are compared with other QSSMs proposed in the past research.

Cites

No record.

References

No record.

Cite

APA: Copy

ZOU ALGHADRI JAHROMI, M., & VALIZADEH, M.R.. (2006). A PROPOSED QUERY-SENSITIVE SIMILARITY MEASURE FOR INFORMATION RETRIEVAL. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, 30(B2), 171-180. SID. https://sid.ir/paper/62392/en

Vancouver: Copy

ZOU ALGHADRI JAHROMI M., VALIZADEH M.R.. A PROPOSED QUERY-SENSITIVE SIMILARITY MEASURE FOR INFORMATION RETRIEVAL. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING[Internet]. 2006;30(B2):171-180. Available from: https://sid.ir/paper/62392/en

IEEE: Copy

M. ZOU ALGHADRI JAHROMI, and M.R. VALIZADEH, “A PROPOSED QUERY-SENSITIVE SIMILARITY MEASURE FOR INFORMATION RETRIEVAL,” IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, vol. 30, no. B2, pp. 171–180, 2006, [Online]. Available: https://sid.ir/paper/62392/en

Related Journal Papers