Graph Matching Algorithms for Business Process Model Similarity Search-Reference-Cited by-同舟云学术

Graph Matching Algorithms for Business Process Model Similarity Search

Published:2009 Issue: Volume: Page:48-63
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Dijkman Remco,Dumas Marlon,García-Bañuelos Luciano

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03848-8_5

Reference21 articles.

1. Lecture Notes in Computer Science;W.M.P. Aalst van der,2006

2. Lecture Notes in Computer Science;R. Ambauen,2003

3. Buckley, C., Voorhees, E.M.: Evaluating evaluation measure stability. In: Proc. of the ACM SIGIR Conference, pp. 33–40 (2000)

4. Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8), 689–694 (1997)

5. Dijkman, R.M., Dumas, M., van Dongen, B.F., Käärik, R., Mendling, J.: Similarity of business process models: Metrics and evaluation. Working Paper 269, BETA Research School, Eindhoven, The Netherlands (2009)

Cited by 245 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Process mining embeddings: Learning vector representations for Petri nets;Intelligent Systems with Applications;2024-09

2. Semantic-Rich Recommendation System for Medical Emergency Response System;International Journal on Semantic Web and Information Systems;2024-03-26

3. Group-to-group recommendation with neural graph matching;World Wide Web;2024-03

4. Equivalence of Data Petri Nets with Arithmetic;Lecture Notes in Business Information Processing;2024

5. Process Mining Embeddings: Learning Vector Representations for Petri Nets;2024