1. 哈尔滨工业大学深圳研究生院,广东,深圳,518055
2. 计算机体系结构国家重点实验室, 中科院计算所,北京,100190
3. 哈尔滨工业大学深圳研究生院,广东,深圳,518055
4. 计算机体系结构国家重点实验室 中科院计算所,北京,100190
纸质出版:2015
移动端阅览
丁宇新, 燕泽权, 冯威, 等. 基于有监督主题模型的排序学习算法[J]. 电子学报, 2015,43(2):333-337.
DING Yu-xin, YAN Ze-quan, FENG Wei, et al. Rank Learning Based on Supervised Topic Model[J]. Acta Electronica Sinica, 2015, 43(2): 333-337.
丁宇新, 燕泽权, 冯威, 等. 基于有监督主题模型的排序学习算法[J]. 电子学报, 2015,43(2):333-337. DOI: 10.3969/j.issn.0372-2112.2015.02.019.
DING Yu-xin, YAN Ze-quan, FENG Wei, et al. Rank Learning Based on Supervised Topic Model[J]. Acta Electronica Sinica, 2015, 43(2): 333-337. DOI: 10.3969/j.issn.0372-2112.2015.02.019.
文档表示是排序学习的关键
目前的排序学习算法多采用词袋法表示文档与查询
该方法假设词袋中的词相互独立
忽略了词之间的关系.为了表示文档中词之间的依赖关系
本研究利用文档与查询的主题特征构建排序学习模型
我们将排序函数定义为文档与查询之间的主题关系
提出了基于有监督主题模型的排序学习算法自动学习排序函数.为了评价模型的排序精度
我们在三个标准数据集(OHSUMED
MQ2007
MQ2008)上进行了实验.实验表明基于主题的排序学习算法能够发现文档与查询之间内在的语义关联
并改善排序模型的排序精度.
One of the key issues in learning to rank is document representation.In most of the learning to rank algorithms documents and queries are represented as a bag of words
and words are assumed to occur independently.This kind of document representation ignores relationships between different words.To capture the important relationships between words
we try to learn a ranking model using the topic features of documents and queries.We define the ranking function as the topic relations between a document and a query.A novel rank learning algorithm based on supervised topic model is proposed to learn the ranking function.To evaluate the ranking accuracy of the proposed ranking algorithm
experiments are made on three benchmark datasets for information retrieval
OHSUMED
MQ2007
and MQ2008.The experimental results show that the proposed model can find the semantic relation between a document and a query
and can improve the ranking accuracy.
0
浏览量
2
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621