About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
Collaborative Computing: Networking, Applications and Worksharing. 19th EAI International Conference, CollaborateCom 2023, Corfu Island, Greece, October 4-6, 2023, Proceedings, Part II

Research Article

SimBPG: A Comprehensive Similarity Evaluation Metric for Business Process Graphs

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1007/978-3-031-54528-3_24,
        author={Qinkai Jiang and Jiaxing Wang and Bin Cao and Jing Fan},
        title={SimBPG: A Comprehensive Similarity Evaluation Metric for Business Process Graphs},
        proceedings={Collaborative Computing: Networking, Applications and Worksharing. 19th EAI International Conference, CollaborateCom 2023, Corfu Island, Greece, October 4-6, 2023, Proceedings, Part II},
        proceedings_a={COLLABORATECOM PART 2},
        year={2024},
        month={2},
        keywords={business process graphs evaluation metric similarity calculation heterogeneous graphs KM algorithm},
        doi={10.1007/978-3-031-54528-3_24}
    }
    
  • Qinkai Jiang
    Jiaxing Wang
    Bin Cao
    Jing Fan
    Year: 2024
    SimBPG: A Comprehensive Similarity Evaluation Metric for Business Process Graphs
    COLLABORATECOM PART 2
    Springer
    DOI: 10.1007/978-3-031-54528-3_24
Qinkai Jiang1, Jiaxing Wang1, Bin Cao1,*, Jing Fan1
  • 1: Zhejiang University of Technology
*Contact email: bincao@zjut.edu.cn

Abstract

Measuring the similarity between two business process models holds significant importance across various applications. At present, there are many different similarity calculation methods, such as structural similarity based on the graph edit distance(GED), text similarity based on task node description, and behavioral similarity calculation based on path matching. However, existing similarity computation methods cannot produce reliable results since: (1) To apply GED, business process graphs will be simplified to homogeneous graph where the heterogeneity as well as the routing semantics of the business process is removed. (2) To derive comprehensive similarity evaluation, linear weighted sum of different similarity metrics is a common way, but the final result strongly depends on the weighting coefficients that are empirically assigned. In this paper, we fuse multidimensional metrics to compensate for the sole reliance on structural similarity based on GED. To address the limitations of comprehensive evaluation, we propose a novel multidimensional process similarity evaluation method based on the entropy weight method and the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) method. We also design a experimental method to verify the effectiveness of our method, leveraging an open source dataset. The experiment shows that our method can better represent the similarity of business process graphs than other methods.

Keywords
business process graphs evaluation metric similarity calculation heterogeneous graphs KM algorithm
Published
2024-02-23
Appears in
SpringerLink
http://dx.doi.org/10.1007/978-3-031-54528-3_24
Copyright © 2023–2025 ICST
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL