Flexible semantic query expansion for process exploration

Sven Mielke, Martin Pelke, Sebastian Pospiech, R. Mertens
{"title":"Flexible semantic query expansion for process exploration","authors":"Sven Mielke, Martin Pelke, Sebastian Pospiech, R. Mertens","doi":"10.1109/ICOSC.2015.7050847","DOIUrl":null,"url":null,"abstract":"Process exploration tools help to identify business processes that are not executed according to their documentation or lack such documentation at all. These process steps are executed by human beings, therefore process traces can often be found in unstructured documents. In order to reconstruct a process execution, these documents have to be retrieved. Natural language properties such as hyponyms, hypernyms, homonyms and synonyms make searching for a specific element a hard task. Integrating word relations in the search index is the standard solution for tackling this problem. In our process exploration scenario, however, this approach comes to its limits as ontologies defining word relations may vary from process step to process step. The problem is that the approach is rather inflexible. In order to change the relation of the words, the index needs to be rebuilt. This in turn would require running an analysis of the whole document base. Query Expansion, on the other hand, works by adding related words to a query, making it very flexible. In a classic search scenario, it still comes with a number of disadvantages such as retrieving unrelated documents. In our scenario, these disadvantages do not apply, since information from previous steps in the explored process can be used to constrain the result set.","PeriodicalId":126701,"journal":{"name":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOSC.2015.7050847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Process exploration tools help to identify business processes that are not executed according to their documentation or lack such documentation at all. These process steps are executed by human beings, therefore process traces can often be found in unstructured documents. In order to reconstruct a process execution, these documents have to be retrieved. Natural language properties such as hyponyms, hypernyms, homonyms and synonyms make searching for a specific element a hard task. Integrating word relations in the search index is the standard solution for tackling this problem. In our process exploration scenario, however, this approach comes to its limits as ontologies defining word relations may vary from process step to process step. The problem is that the approach is rather inflexible. In order to change the relation of the words, the index needs to be rebuilt. This in turn would require running an analysis of the whole document base. Query Expansion, on the other hand, works by adding related words to a query, making it very flexible. In a classic search scenario, it still comes with a number of disadvantages such as retrieving unrelated documents. In our scenario, these disadvantages do not apply, since information from previous steps in the explored process can be used to constrain the result set.
灵活的语义查询扩展,用于流程探索
流程探索工具有助于识别没有根据文档执行或根本缺乏文档的业务流程。这些流程步骤是由人执行的,因此通常可以在非结构化文档中找到流程跟踪。为了重建流程执行,必须检索这些文档。自然语言属性,如上下词、上词、同音词和同义词,使得搜索特定元素成为一项艰巨的任务。在搜索索引中集成单词关系是解决这个问题的标准解决方案。然而,在我们的流程探索场景中,这种方法有其局限性,因为定义单词关系的本体可能因流程步骤而异。问题是这种方法相当不灵活。为了改变词的关系,需要重建索引。这反过来又需要对整个文档库进行分析。另一方面,查询扩展通过向查询添加相关单词来工作,使其非常灵活。在经典的搜索场景中,它仍然有许多缺点,比如检索不相关的文档。在我们的场景中,这些缺点并不适用,因为可以使用探索过程中前面步骤的信息来约束结果集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信