| تعداد نشریات | 24 |
| تعداد شمارهها | 877 |
| تعداد مقالات | 7,848 |
| تعداد مشاهده مقاله | 14,535,475 |
| تعداد دریافت فایل اصل مقاله | 12,270,752 |
A proposed query-sensitive similarity measure for information retrieval | ||
| Iranian Journal of Science and Technology Transactions of Electrical Engineering | ||
| شناسنامه علمی شماره، دوره 30، شماره 2، فروردین 2006، صفحه 171-180 اصل مقاله (114.75 K) | ||
| شناسه دیجیتال (DOI): 10.22099/ijste.2006.860 | ||
| چکیده | ||
| 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 | ||
| کلیدواژهها | ||
| Query sensitive similarity measure؛ document clustering؛ Genetic Algorithm | ||
|
آمار تعداد مشاهده مقاله: 1,956 تعداد دریافت فایل اصل مقاله: 2,007 |
||