A ranking algorithm for query expansion based on the term's appearing probability in the single document

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/51821

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51821

题名:	A ranking algorithm for query expansion based on the term's appearing probability in the single document
作者:	Chou,SC;Cheng,CY;Huang,SJ
贡献者:	資訊管理學系
关键词:	INFORMATION-RETRIEVAL;RELEVANCE FEEDBACK;MODELS;LOGS
日期:	2011
上传时间:	2012-03-27 19:07:01 (UTC+8)
出版者:	國立中央大學
摘要:	Purpose - The purpose of this paper is to establish a new approach for solving the expansion term problem. Design/methodology/approach - This study develops an expansion term weighting function derived from the valuable concepts used by previous approaches. These concepts include probability measurement, adjustment according to situations, and summation of weights. Formal tests have been conducted to compare the proposed weighting function with the baseline ranking model and other weighting functions. Findings - The results reveal stable performance by the proposed expansion term weighting function. It proves more effective than the baseline ranking model and outperforms other weighting functions. Research limitations/implications - The paper finds that testing additional data sets and potential applications to real working situations is required before the generalisability and superiority of the proposed expansion term weighting function can be asserted. Originality/value - Stable performance and an acceptable level of effectiveness for the proposed expansion term weighting function indicate the potential for further study and development of this approach. This would add to the current methods studied by the information retrieval community for culling information from documents.
關聯:	ONLINE INFORMATION REVIEW
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	750	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....