软件学报
軟件學報
연건학보
JOURNAL OF SOFTWARE
2009年
7期
1854-1865
,共12页
信息检索%伪相关反馈%查询扩展%关联规则%矩阵加权
信息檢索%偽相關反饋%查詢擴展%關聯規則%矩陣加權
신식검색%위상관반궤%사순확전%관련규칙%구진가권
information retrieval%pseudo relevance feedback%query expansion%association rule%matrix-weighted
提出一种面向查询扩展的矩阵加权关联规则挖掘算法,给出与其相关的定理及其证明过程.该算法采用4种剪枝策略,挖掘效率得到极大提高.实验结果表明,其挖掘时间比原来的平均时间减少87.84%.针对现有查询扩展的缺陷,将矩阵加权关联规则挖掘技术应用于查询扩展,提出新的查询扩展模型和更合理的扩展词权重计算方法.在此基础上提出一种伪相关反馈查询扩展算法--基于矩阵加权关联规则挖掘的伪相关反馈查询扩展算法,该算法能够自动地从前列n篇初检文档中挖掘与原查询相关的矩阵加权关联规则,构建规则库,从中提取与原查询相关的扩展词,实现查询扩展.实验结果表明,该算法的检索性能确实得到了很好的改善.与现有查询扩展算法相比,在相同的查全率水平级下,其平均查准率有了明显的提高.
提齣一種麵嚮查詢擴展的矩陣加權關聯規則挖掘算法,給齣與其相關的定理及其證明過程.該算法採用4種剪枝策略,挖掘效率得到極大提高.實驗結果錶明,其挖掘時間比原來的平均時間減少87.84%.針對現有查詢擴展的缺陷,將矩陣加權關聯規則挖掘技術應用于查詢擴展,提齣新的查詢擴展模型和更閤理的擴展詞權重計算方法.在此基礎上提齣一種偽相關反饋查詢擴展算法--基于矩陣加權關聯規則挖掘的偽相關反饋查詢擴展算法,該算法能夠自動地從前列n篇初檢文檔中挖掘與原查詢相關的矩陣加權關聯規則,構建規則庫,從中提取與原查詢相關的擴展詞,實現查詢擴展.實驗結果錶明,該算法的檢索性能確實得到瞭很好的改善.與現有查詢擴展算法相比,在相同的查全率水平級下,其平均查準率有瞭明顯的提高.
제출일충면향사순확전적구진가권관련규칙알굴산법,급출여기상관적정리급기증명과정.해산법채용4충전지책략,알굴효솔득도겁대제고.실험결과표명,기알굴시간비원래적평균시간감소87.84%.침대현유사순확전적결함,장구진가권관련규칙알굴기술응용우사순확전,제출신적사순확전모형화경합리적확전사권중계산방법.재차기출상제출일충위상관반궤사순확전산법--기우구진가권관련규칙알굴적위상관반궤사순확전산법,해산법능구자동지종전렬n편초검문당중알굴여원사순상관적구진가권관련규칙,구건규칙고,종중제취여원사순상관적확전사,실현사순확전.실험결과표명,해산법적검색성능학실득도료흔호적개선.여현유사순확전산법상비,재상동적사전솔수평급하,기평균사준솔유료명현적제고.
An algorithm of matrix-weighted association rule mining for query expansion is presented based on the quadruple pruning, and a related theorem and its proof are given. This method can tremendously enhance the mining efficiency. Experimental results demonstrate that its mining time is averagely reduced by 87.84%, compared to that of the original one. And a query expansion algorithm of pseudo relevance feedback is proposed based on matrix-weighted association rule mining, which combines the association rules mining technique with the query expansion. The algorithm can automatically mine those matrix-weighted association rules related to the original query in the top-ranked retrieved documents to construct an association rules-based database, and extract expansion terms related to the original query from the database for query expansion. At the same time, a new computing method for weights of expansion terms is given. It makes the weighted value of an expansion term more reasonable. Experimental results show that this method is better than traditional ones in average precision.