电子学报 ›› 2020, Vol. 48 ›› Issue (3): 568-576.DOI: 10.3969/j.issn.0372-2112.2020.03.021

所属专题: 自然语言处理技术

• 学术论文 • 上一篇    下一篇

基于项权值排序挖掘的跨语言查询扩展

黄名选1,2,3, 蒋曹清3   

  1. 1. 广西跨境电商智能信息处理重点实验室(广西财经学院), 广西南宁 530003;
    2. 广西财经学院广西(东盟)财经研究中心, 广西南宁 530003;
    3. 广西财经学院信息与统计学院, 广西南宁 530003
  • 收稿日期:2019-03-18 修回日期:2019-05-17 出版日期:2020-03-25
    • 作者简介:
    • 黄名选 男,1966年出生于广西乐业县,硕士,现为广西财经学院信息与统计学院教授,主要研究方向为数据挖掘、信息检索、机器学习,主持国家自然科学基金项目2项,主持完成广西自然科学基金项目1项,主持广西教育厅科研项目3项,获2011年广西高校优秀人才资助计划项目1项,参与完成国家自然科学基金项目1项,发表学术论文60余篇,其中,中文核心期刊论文40余篇,被期刊EI收录5篇,ISTP收录1篇,发明专利授权15件.E-mail:mingxh05@163.com;蒋曹清 男,1973年出生于湖南省永州市,博士,现为广西财经学院教授,主要研究方向为形式化方法,程序分析,数据挖掘.E-mail:jcqng@163.com
    • 基金资助:
    • 国家自然科学基金 (No.61762006,No.61662003); 广西应用经济学一流学科 (培育)开放性课题 (No.2018MA07); 广西 (东盟)财经研究中心开放性课题 (No.2018DMCJYB08)

Cross Language Query Expansion Based on Item Weight Sorting Mining

HUANG Ming-xuan1,2,3, JIANG Cao-qing3   

  1. 1. Guangxi Key Laboratory of Cross-border E-commerce Intelligent Information Processing, Guangxi University of Finance and Economics, Nanning, Guangxi 530003, China;
    2. Guangxi (ASEAN) Financial Research Center, Guangxi University of Finance and Economics, Nanning, Guangxi 530003, China;
    3. School of Information and Statistics, Guangxi University of Finance and Economics, Nanning, Guangxi 530003, China
  • Received:2019-03-18 Revised:2019-05-17 Online:2020-03-25 Published:2020-03-25
    • Supported by:
    • National Natural Science Foundation of China (No.61762006, No.61662003); Open  (Cultivation) Project of Guangxi First-class Discipline Applied Economics Construction Project Fund (No.2018MA07); Open Project of Guangxi  (ASEAN) Financial Research Center (No.2018DMCJYB08)

摘要: 为了改善自然语言处理应用中长期存在的主题漂移和词不匹配问题,本文首先提出一种加权项集支持度计算方法和基于项权值排序的剪枝方法,给出面向查询扩展的基于项权值排序的加权关联规则挖掘算法,讨论关联规则混合扩展、后件扩展和前件扩展模型,最后提出基于项权值排序挖掘的跨语言查询扩展算法.该算法采用新的支持度和剪枝策略挖掘加权关联规则,根据扩展模型从规则中提取高质量扩展词实现跨语言查询扩展.实验结果表明,与现有基于加权关联规则挖掘的跨语言扩展算法比较,本文扩展算法能有效遏制查询主题漂移和词不匹配问题,可用于各种语言的信息检索以改善检索性能,扩展模型中后件扩展获得最优检索性能,混合扩展的检索性能不如后件扩展和前件扩展,支持度对后件扩展更有效,置信度更有利于提升前件扩展和混合扩展的检索性能.本文挖掘方法可用于文本挖掘、商务数据挖掘和推荐系统以提高其挖掘性能.

关键词: 自然语言处理, 文本挖掘, 信息检索, 跨语言检索, 查询扩展, 推荐系统

Abstract: To ameliorate the long-standing problems of theme drift and word mismatch in natural language processing applications, this paper first proposes a computing method for weighted itemset support and a pruning method based on item weight sorting (IWS). And then, a weighted association rule mining algorithm for query expansion is presented based on the IWS, and the models such as association rule antecedent and consequent hybrid expansion (RACHE), rule consequent expansion (RCE) along with rule antecedent expansion (RAE) are discussed. Finally, an algorithm of cross-language query expansion (CLQE) is put forward based on the IWS mining. The algorithm utilized the new support and the pruning method to mine the weighted association rules,and extracted high quality expansion terms from the rules according to the expansion models in order to carry out CLQE. A comparison between the proposed expansion algorithm and the existing CLQE algorithms based on weighted association rules mining is made, which shows that the former can effectively restrain the problems of query topic drift and word mismatch, and can be used in information retrieval in various languages to improve retrieval performance. The RCE achieves the optimal retrieval performance in the proposed expansion models, and the retrieval performance of the RACHE is not as good as that of the RAE and the RCE. The support is more effective for the RCE algorithm. The confidence can make the RAE and the RACHE get the best retrieval result. And moreover, the proposed mining method can be used in text mining, business data mining and recommendation system to improve its mining performance.

Key words: natural language processing, text mining, information retrieval, cross language retrieval, query expansion, recommendation system

中图分类号: