Flexible Semantic Query Expansion for Process Exploration

被引:0
作者
Mielke, Sven [1 ]
Pelke, Martin [1 ]
Pospiech, Sebastian [2 ]
Mertens, Robert [1 ]
机构
[1] Hsch Weserbergland, Hameln, Germany
[2] Cologne Intelligence GmbH, Cologne, Germany
来源
2015 IEEE 9TH INTERNATIONAL CONFERENCE ON SEMANTIC COMPUTING (ICSC) | 2015年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:440 / 443
页数:4
相关论文
共 50 条
[31]   A Hybrid Approach for Optimizing Arabic Semantic Query Expansion [J].
Allahim, Azzah ;
Cherif, Asma ;
Imine, Abdessamad .
2021 IEEE/ACS 18TH INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2021,
[32]   Query expansion based on naive bayes and semantic similarity [J].
Zheng Z. ;
Yu M. ;
Wang N. ;
Zhang X. ;
Ruan C. ;
Li D. .
Li, Dun (ielidun@zzu.edu.cn), 2018, Totem Publishers Ltd (14) :1421-1430
[33]   Enhancing Query Expansion through Folksonomies and Semantic Classes [J].
Biancalana, Claudio ;
Gasparetti, Fabio ;
Micarelli, Alessandro ;
Sansonetti, Giuseppe .
Proceedings of 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and 2012 ASE/IEEE International Conference on Social Computing (SocialCom/PASSAT 2012), 2012, :611-616
[34]   Business information query expansion through semantic network [J].
Gong, Zhiguo ;
Muyeba, Maybin ;
Guo, Jingzhi .
ENTERPRISE INFORMATION SYSTEMS, 2010, 4 (01) :1-22
[35]   Multi Visualization and Dynamic Query for Effective Exploration of Semantic Data [J].
Petrelli, Daniela ;
Mazumdar, Suvodeep ;
Dadzie, Aba-Sah ;
Ciravegna, Fabio .
SEMANTIC WEB - ISWC 2009, PROCEEDINGS, 2009, 5823 :505-+
[36]   Web Service Discovery Using Lexical and Semantic Query Expansion [J].
Ma, Shang-Pin ;
Li, Chia-Hsueh ;
Tsai, Yao-Yu ;
Lan, Ci-Wei .
2013 IEEE 10TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE), 2013, :423-428
[37]   Semantic query expansion based on a question category concept list [J].
Kim, HJ ;
Kang, BY ;
Park, SB ;
Lee, SJ .
DIGITAL LIBRARIES: INTERNATIONAL COLLABORATION AND CROSS-FERTILIZATION, PROCEEDINGS, 2004, 3334 :501-509
[38]   An approach to semantic query expansion system based on Hepatitis ontology [J].
Chen Yunzhi ;
Lu Huijuan ;
Shapiro, Linda ;
Travillian, Ravensara S. ;
Li Lanjuan .
JOURNAL OF BIOLOGICAL RESEARCH-THESSALONIKI, 2016, 23
[39]   Semantic based Query Expansion for Arabic Question Answering Systems [J].
Al-Chalabi, Hani ;
Ray, Santosh ;
Shaalan, Khaled .
2015 FIRST INTERNATIONAL CONFERENCE ON ARABIC COMPUTATIONAL LINGUISTICS (ACLING 2015): ADVANCES IN ARABIC COMPUTATIONAL LINGUISTICS, 2015, :127-132
[40]   A PATENT RETRIEVAL QUERY EXPANSION METHOD BASED ON SEMANTIC DICTIONARY [J].
Xu, Kan ;
Feng, Jiaojiao ;
Wang, Kaiqiao ;
Lin, Hongfei ;
Lin, Yuan .
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2019, 20 (06) :1233-1240