Query-Focused Association Rule Mining for Information Retrieval

Gleb Sizov, Pınar Öztürk
{"title":"Query-Focused Association Rule Mining for Information Retrieval","authors":"Gleb Sizov, Pınar Öztürk","doi":"10.3233/978-1-61499-330-8-245","DOIUrl":null,"url":null,"abstract":"We present a method that applies association rule mining for information retrieval. Our approach is different from traditional information retrieval since retrieval is done based on association rather than similarity, which might be useful for knowledge discovery purposes such as finding an explanation or elaboration for an event in a collection of domain-specific documents. The method proposed in this paper is based on the SmoothApriori algorithm which accommodates similarity in the association rule mining process to mine association rules between sentences or larger text units. We introduce query-focused association rule mining that allows association-based retrieval from larger amount of data than with a traditional association-rule mining approach. Combined with SmoothApriori, query-focused association rule mining provides association-based retrieval for textual data. This new method was evaluated on the task of automatically restoring sentences that were artificially removed from aviation investigation reports and showed significantly better results than any of our similarity-based retrieval baselines.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"2022 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scandinavian Conference on AI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-61499-330-8-245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We present a method that applies association rule mining for information retrieval. Our approach is different from traditional information retrieval since retrieval is done based on association rather than similarity, which might be useful for knowledge discovery purposes such as finding an explanation or elaboration for an event in a collection of domain-specific documents. The method proposed in this paper is based on the SmoothApriori algorithm which accommodates similarity in the association rule mining process to mine association rules between sentences or larger text units. We introduce query-focused association rule mining that allows association-based retrieval from larger amount of data than with a traditional association-rule mining approach. Combined with SmoothApriori, query-focused association rule mining provides association-based retrieval for textual data. This new method was evaluated on the task of automatically restoring sentences that were artificially removed from aviation investigation reports and showed significantly better results than any of our similarity-based retrieval baselines.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向查询的信息检索关联规则挖掘
提出了一种将关联规则挖掘应用于信息检索的方法。我们的方法与传统的信息检索不同,因为检索是基于关联而不是相似性完成的,这对于知识发现的目的可能很有用,例如在特定于领域的文档集合中查找事件的解释或详细说明。本文提出的方法是基于SmoothApriori算法,该算法在关联规则挖掘过程中考虑相似性来挖掘句子或更大文本单元之间的关联规则。我们引入了以查询为中心的关联规则挖掘,与传统的关联规则挖掘方法相比,它允许从更大量的数据中进行基于关联的检索。结合SmoothApriori,以查询为中心的关联规则挖掘为文本数据提供基于关联的检索。该方法在自动恢复人为从航空调查报告中删除的句子的任务上进行了评估,结果明显优于任何基于相似度的检索基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Goal-driven, assistive agents for instructing and guiding user activities On Associative Confounder Bias Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees Revisiting Inner Entanglements in Classical Planning Error AMP Chain Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1