Domain Knowledge-Enhanced Process Mining for Anomaly Detection in Commercial Bank Business Processes
Abstract
1. Introduction
- We propose and empirically validate the E-Heuristic Miner algorithm, a novel method integrating banking domain knowledge into process mining, which significantly enhances the precision of anomaly detection in commercial banking processes.
- We illustrate the practical utility and efficacy of the proposed method by conducting a thorough empirical analysis using real-world event logs from a commercial bank. This analysis provides a clear, data-driven path for process optimization.
- We expand the theoretical and practical boundaries of process management research by exploring the application of LLMs in semantic process understanding and process analysis.
2. Literature Review
2.1. The Concepts and Techniques of Process Mining
2.2. Applications of Process Mining in Financial Services Operations
2.3. Anomaly Detection Methods in Business Processes
2.4. Summary of Research Gap and Practical Motivation
3. Methodology
Process Anomaly Algorithm: E-Heuristic Miner
- 1.
- Extract domain knowledge from a bank’s standard operating procedure and build a follow-up relationship matrix. Based on the explicit sequential relationship between each activity in the bank’s SOP, we can develop a follow-up relationship matrix. It contains two levels of information: process activity and activity sequence relationship information. Each element in the matrix represents the direct follow-up relationship between two activity nodes. For example, the corresponding element value in the matrix is 1 if activity A directly follows activity B and 0 if there is no direct follow-up relationship. Specifically, the formula is as follows:
- 2.
- Calculate the dependency index between activities to construct a dependency/frequency table (D/F table) to count the frequency of dependency relationships between activities in event logs. The calculation method for dependency is as follows:Let L be an event log over ζ, i.e., . Let a, b ∈ ζ: if there is a trace and such that and and . Here, is the number of times occurs in L:indicates the dependency value between a and b. The traditional formula for dependency is as follows:The value of is always between −1 and 1. If it is close to 1, there is a strong positive dependency between a and b, where a is the cause of b. If it is close to −1, there is a strong negative dependency, where b is the cause of a. If a is the same as b, it means there is a loop and a strong reflexive relationship.The importance of each path is re-evaluated in light of the domain knowledge recorded in the follow-up relationship matrix and the actual dependency of each path. The dependency calculation formula will retain and assign greater weights to the paths that deviate from the standard path and have low frequencies. The retention of the normal paths will be determined by the calculated dependency value and the established threshold. This innovation simplifies the process model to the greatest extent possible while also preserving the deviation path. The innovative dependency calculation is as follows:is the value in the follow-up relationship matrix. In addition, represents the color of activities and paths in the process. If there is a deviation from the activity or path, it will be colored.
- 3.
- Convert the D/F table into a D/F graph and generate DFGs from the D/F graph. Note that this study utilized the PM4PY API tool to analyze business processes instead of relying on tools like Disco or ProM [57].
4. Empirical Study and Results
4.1. Data Source and Business Analysis
4.2. Process Anomaly Detection Based on E-Heuristic Miner
4.2.1. The Effectiveness of E-Heuristic Miner
- Fitness requires that the discovered model allows for the behavior seen in the event log. Formally, the fitness for a trace, , given a WF-net, , is computed as follows:
- Precision assesses whether the discovered model allows for behavior completely unrelated to what has been observed in the event log. Let represent the set of events in the event log, L. For any event , let denote the set of activities enabled by the process model, , following the context of event . In other words, if we look at the state of the model just before event e occurs, is the set of all possible next activities that model N allows from that state. denotes the set of activities enabled in log after the context of event . Since an event e in the log has a particular prefix, represents the activities that were actually observed next in the log whenever that same state was reached. Precision is calculated asIf precision is high, the discovered model does not allow for much more behavior than observed. Hence, . If precision is low, the discovered model allows for much more behavior than observed. Hence, .
- Generalization measures the discovered model’s ability to generalize the example behavior seen in the event log. Generalization is calculated asHere, “nodes” represent the set of nodes (activities) in the process model, , and is the total number of nodes. For each node, denotes the number of times that node was executed in the event log, .
- Simplicity addresses the structural complexity of the process model. Simplicity is calculated as
4.2.2. Comparison of Deviation Detection Methods
- (1)
- Cases where the special deviation path of “On-site review failed and order withdrawn → Branch is preparing” exists.
- (2)
- Cases where the execution time of the activity exceeds 20 days. (Note: the average duration for completing the account-opening process in the case bank is 10 days.)
- (3)
- Cases where the number of activities exceeds 24. (Note: the average number of executed activities for the case bank’s account-opening business is 12.)
4.3. LLM-Driven Process Anomaly Analysis and Process Optimization Analysis
4.4. Discussion
5. Conclusions
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
Abbreviations
BPM | Business Process Management |
SOPs | Standard Operating Procedures |
LLMs | Large-language Models |
CBRC | China Banking and Insurance Regulatory Commission |
FSM | Finite State Machines |
DAG | Directed Acyclic Graphs |
WF-nets | Workflow nets |
C-nets | Causal nets |
DFG | Directly-Follows Graph |
BPMN | Business Process Modeling Notation |
MSE | Mean Squared Error |
Appendix A. Pseudocode of Algorithm A1
Algorithm A1. The E-Heuristic Miner Algorithm |
Input: - The event log L ⊆ ζ* of target business process in the bank - The SOP Manual S of target bank - Dependency Threshold θ Output: - Annotated Process Model with Deviation Paths (DFG) |
//Step 1: Construct Follow-Up Relationship Matrix from SOP function BuildFollowUpMatrix(S): ζ ← Extract unique activities from S Initialize n × n matrix ρ, where n = |ζ| for each explicit sequence (A → B) in S do if SOP defines “A directly followed by B” then [A][B] ← 1 else [A][B] ← 0 end if end for |
//Step 2: Calculate Enhanced Dependency Index function ComputeDependency(L, ): Initialize D/F_Table as n × n matrix in L do for i = 1 to n-1 do + 1 end for end for for each activity pair (a, b) ∈ ζ × ζ do //Traditional dependency measure + 1) //Enhanced weighting with domain knowledge if [a][b] == 0 then weight ← 1 + log (1 + ) else weight ← 1 end if D/F_Table [a][b] ← dependency × weight end for return D/F_Table |
//Step 3: Generate Annotated DFG function GenerateDFG(D/F_Table, ): Initialize directed graph G = (ζ, E) for each (a, b) where D/F_Table[a][b] > threshold do Add edge a → b to E [a][b] == 0 then Set color(b) = red //Mark deviation nodes end if end for return G |
← BuildFollowUpMatrix(S) D/F_Table ← ComputeDependency(L, ) DFG ← GenerateDFG(D/F_Table, ) |
References
- Gomber, P.; Kauffman, R.J.; Parker, C.; Weber, B.W. On the Fintech Revolution: Interpreting the Forces of Innovation, Disruption, and Transformation in Financial Services. J. Manag. Inf. Syst. 2017, 35, 220–265. [Google Scholar] [CrossRef]
- Hatzakis, E.; Nair, S.K.; Pinedo, M. Operations in Financial Services—An Overview. Prod. Oper. Manag. 2010, 19, 633–664. [Google Scholar] [CrossRef]
- Cheng, X.; Du, A.M.; Yan, C.; Goodell, J.W. Internal business process governance and external regulation: How does AI technology empower financial performance? Int. Rev. Financ. Anal. 2025, 99, 103927. [Google Scholar] [CrossRef]
- Kim, Y.; Xu, Y. Operational Risk Management: Optimal Inspection Policy. Manag. Sci. 2024, 70, 18. [Google Scholar] [CrossRef]
- Adams, N.; Augusto, A.; Davern, M.J.; La Rosa, M. Five guidelines to improve context-aware process selection: An Australian banking perspective. Bus. Process Manag. J. 2023, 31, 878–903. [Google Scholar] [CrossRef]
- Oberle, L.J. How to build responsive service processes in German banks: The role of process documentation and the myth of automation. Bus. Process. Manag. J. 2023, 29, 578–596. [Google Scholar] [CrossRef]
- Xu, Y.; Pinedo, M.; Xue, M. Operational Risk in Financial Services: A Review and New Research Opportunities. Prod. Oper. Manag. 2016, 26, 426–445. [Google Scholar] [CrossRef]
- Bin-Qing, X.; Xin-Dan, L.I.; Yu-Qian, X.U.; Yuan-Qiao, C. Process, compliance and operational risk management. J. Manag. Sci. China 2017, 20, 117–123. [Google Scholar]
- De Weerdt, J.; Schupp, A.; Vanderloock, A.; Baesens, B. Process Mining for the multi-faceted analysis of business processes—A case study in a financial services organization. Comput. Ind. 2013, 64, 57–67. [Google Scholar] [CrossRef]
- Taskesenlioglu, S.; Ozkan, N.F.; Erdogan, T.G. Identifying Possible Improvements of Software Development Life Cycle (SDLC) Process of a Bank by Using Process Mining. Int. J. Softw. Eng. Knowl. Eng. 2022, 32, 525–552. [Google Scholar] [CrossRef]
- van der Aalst, W.M.P. Process Mining: Data Science in Action; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
- Grisold, T.; Mendling, J.; Otto, M.; Brocke, J.V. Adoption, use and management of process mining in practice. Bus. Process. Manag. J. 2020, 27, 369–387. [Google Scholar] [CrossRef]
- Novak, C.; Pfahlsberger, L.; Bala, S.; Revoredo, K.; Mendling, J. Enhancing decision-making of IT demand management with process mining. Bus. Process. Manag. J. 2023, 29, 230–259. [Google Scholar] [CrossRef]
- Rott, J.; Böhm, M.; Krcmar, H. Laying the ground for future cross-organizational process mining research and application: A literature review. Bus. Process. Manag. J. 2024, 30, 144–206. [Google Scholar] [CrossRef]
- Zerbino, P.; Stefanini, A.; Aloini, D. Process Science in Action: A Literature Review on Process Mining in Business Management. Technol. Forecast. Soc. Change 2021, 172, 121021. [Google Scholar] [CrossRef]
- dos Santos Garcia, C.; Meincheim, A.; Junior, E.R.; Dallagassa, M.R.; Sato, D.M.; Carvalho, D.R.; Santos, E.A.; Scalabrin, E.E. Process mining techniques and applications-A systematic mapping study. Expert Syst. Appl. 2019, 133, 260–295. [Google Scholar] [CrossRef]
- Gomes, A.F.C.; de Lacerda, A.C.W.G.; da Silva Fialho, J.R. Comparative Analysis of Process Mining Algorithms in Process Discover. In Advances in Intelligent Systems and Computing; Springer: Berlin/Heidelberg, Germany, 2021. [Google Scholar]
- Tiwari, A.; Turner, C.J.; Majeed, B. A review of business process mining: State-of-the-art and future trends. Bus. Process Manag. J. 2008, 14, 5–22. [Google Scholar] [CrossRef]
- Rojos, F.; Lucchini, F.; González, J.; Espinoza, D.; Lee, J.; Fernández, J.P.S.; Arias, M. Process Mining: Research in Banking Operations; Eindhoven University of Technology: Eindhoven, The Netherlands, 2017. [Google Scholar]
- Carmona, R.; Cofré, R.; Naranjo, C.; Vásquez, O.; Lee, J.; Fernández, J.P.S.; Arias, M. Analysis of Loan Application Process Using Process Mining; Eindhoven University of Technology: Eindhoven, The Netherlands, 2017. [Google Scholar]
- Bautista, A.D.; Wangikar, L.; Akbar, S.M.K. Process Mining-Driven Optimization of a Consumer Loan Approvals Process. In Proceedings of the International Conference on Business Process Management, Tallinn, Estonia, 3–6 September 2012. [Google Scholar]
- van der Aalst, W.M.P. A practitioner’s guide to process mining: Limitations of the directly-follows graph. Procedia Comput. Sci. 2019, 164, 321–328. [Google Scholar] [CrossRef]
- Huser, V. Process Mining: Discovery, Conformance and Enhancement of Business Processes. J. Biomed. Inform. 2012, 45, 1018–1019. [Google Scholar] [CrossRef]
- van der Aalst, W.M.P.; Weijters, A.J.M.M. Process mining: A research agenda. Comput. Ind. 2004, 53, 231–244. [Google Scholar] [CrossRef]
- Cook, J.E.; Wolf, A.L. Automating Process Discovery through Event-Data Analysis. In Proceedings of the 17th International Conference on Software Engineering, Seattle, WA, USA, 23–30 April 1995; p. 73. [Google Scholar]
- Agrawal, R.; Gunopulos, D.; Leymann, F. Mining Process Models from Workflow Logs. In Proceedings of the International Conference on Extending Database Technology, Valencia, Spain, 23–27 March 1998. [Google Scholar]
- van der Aalst, W.M.P.; Weijters, A.J.M.M.; Măruşter, L. Workflow mining: Discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 2004, 16, 1128–1142. [Google Scholar] [CrossRef]
- Weijters, A.J.M.M.; van der Aalst, W.M.P. Rediscovering workflow models from event-based data using little thumb. Integr. Comput. Aided Eng. 2003, 10, 151–162. [Google Scholar] [CrossRef]
- De Medeiros, A.A.; Weijters, A.J.; Van Der Aalst, W.M. Using Genetic Algorithms to Mine Process Models: Representation, Operators and Results; Eindhoven University of Technology: Eindhoven, The Netherlands, 2004. [Google Scholar]
- Weijters, A.J.; van Der Aalst, W.M.; De Medeiros, A.A. Process Mining with the Heuristics Miner Algorithm; Eindhoven University of Technology: Eindhoven, The Netherlands, 2006. [Google Scholar]
- Van Der Aalst, W.; Buijs, J.; Van Dongen, B. Towards Improving the Representational Bias of Process Mining. In Proceedings of the International Symposium on Data-Driven Process Discovery and Analysis, Campione d’Italia, Italy, 29 June–1 July 2011. [Google Scholar]
- Günther, C.W.; van der Aalst, W.M.P. Fuzzy Mining-Adaptive Process Simplification Based on Multi-perspective Metrics. In Proceedings of the International Conference on Business Process Management, Brisbane, Australia, 24–28 September 2007. [Google Scholar]
- Buijs, J.C.; Van Dongen, B.F.; van Der Aalst, W.M. On the Role of Fitness, Precision, Generalization and Simplicity in Process Discovery. In Proceedings of the CoopIS, DOA-SVI, and ODBASE 2012—OTM Conferences, Rome, Italy, 10–14 September 2012. [Google Scholar]
- Leemans, S.J.J.; Fahland, D.; van der Aalst, W.M.P. Discovering Block-Structured Process Models from Event Logs-A Constructive Approach. In Proceedings of the International Conference on Applications and Theory of Petri Nets and Concurrency, Berlin, Germany, 24 June 2013. [Google Scholar]
- vanden Broucke, S.K.; De Weerdt, J. Fodina: A robust and flexible heuristic process discovery technique. Decis. Support Syst. 2017, 100, 109–118. [Google Scholar] [CrossRef]
- Augusto, A.; Conforti, R.; Dumas, M.; La Rosa, M.; Polyvyanyy, A. Split miner: Automated discovery of accurate and simple business process models from event logs. Knowl. Inf. Syst. 2018, 59, 251–284. [Google Scholar] [CrossRef]
- Buijs, J.C.; van Dongen, B.F.; van der Aalst, W.M. Quality Dimensions in Process Discovery: The Importance of Fitness, Precision, Generalization and Simplicity. Int. J. Coop. Inf. Syst. 2014, 23, 1440001. [Google Scholar] [CrossRef]
- Berti, A.; Schuster, D.; van der Aalst, W.M.P. Abstractions, Scenarios, and Prompt Definitions for Process Mining with LLMs: A Case Study. arXiv 2023, arXiv:2307.02194. [Google Scholar]
- Kampik, T.; Warmuth, C.; Rebmann, A.; Agam, R.; Egger, L.N.; Gerber, A.; Hoffart, J.; Kolk, J.; Herzig, P.; Decker, G.; et al. Large Process Models: A Vision for Business Process Management in the Age of Generative AI. KI-Künstliche Intell. 2023. [Google Scholar] [CrossRef]
- Ashoori, M.; Tarokh, M.J. Applying the Process Mining Project Methodology for Insurance Risks Reduction. Int. J. Res. 2014, 3, 57–69. [Google Scholar]
- Conforti, R.; De Leoni, M.; La Rosa, M.; Van Der Aalst, W.M.; Ter Hofstede, A.H. A recommendation system for predicting risks across multiple business process instances. Decis. Support Syst. 2015, 69, 1–19. [Google Scholar] [CrossRef]
- Carvallo, A.; Henning, C.H.; Razmilić, D.; López, R.R.; Lee, J.; Fernández, J.P.S.; Arias, M. Applying Process Mining for Loan Approvals in a Banking Institution; Eindhoven University of Technology: Eindhoven, The Netherlands, 2017. [Google Scholar]
- Rodrigues, A.; Almeida, C.; Saraiva, D.; Moreira, F.; Spyrides, G.; Varela, G.; Krieger, G.; Peres, I.; Dantas, L.; Lana, M.; et al. Stairway to Value: Mining a Loan Application Process. 2017. Available online: https://ais.win.tue.nl/bpi/2017/bpi2017_winner_academic.pdf (accessed on 25 June 2025).
- Maaradji, A.; Dumas, M.; Rosa, M.L.; Ostovar, A. Detecting Sudden and Gradual Drifts in Business Processes from Execution Traces. IEEE Trans. Knowl. Data Eng. 2017, 29, 2140–2154. [Google Scholar] [CrossRef]
- Moreira, C.; Haven, E.; Sozzo, S.; Wichert, A.M. Process mining with real world financial loan applications: Improving inference on incomplete event logs. PLoS ONE 2018, 13, e0207806. [Google Scholar] [CrossRef]
- Yazici, I.; Engin, O. For Loan Processing a Fuzzy Process Mining. J. Adv. Res. Nat. Appl. Sci. 2023, 9, 511–530. [Google Scholar]
- Bahaweres, R.B.; Zakiyyah, H. Enhancing Loan Application Business Process Model with Multi-perspective Process Mining. In Proceedings of the 11th International Conference on Cyber and IT Service Management (CITSM) 2023, Makassar, Indonesia, 10–11 November 2023; pp. 1–6. [Google Scholar]
- Mongkolrob, S.; Intarasema, S.; Premchaiswadi, W. From Data to Decisions: Enhancing Loan Applications with Process Mining Techniques. In Proceedings of the 22nd International Conference on ICT and Knowledge Engineering (ICT&KE), Bangkok, Thailand, 20–22 November 2024; IEEE: New York, NY, USA, 2024; pp. 1–8. [Google Scholar]
- Dunzer, S.; Stierle, M.; Matzner, M.; Baier, S. Conformance checking: A state-of-the-art literature review. arXiv 2019, arXiv:2007.10903. [Google Scholar]
- Van der Aalst, W.; Adriansyah, A.; Van Dongen, B. Replaying history on process models for conformance checking and performance analysis. Wiley Interdiscip. Rev.: Data Min. Knowl. Discov. 2012, 2, 182–192. [Google Scholar] [CrossRef]
- Zhang, Z.; Hildebrant, R.; Asgarinejad, F.; Venkatasubramanian, N.; Ren, S. Improving Process Discovery Results by Filtering Out Outliers from Event Logs with Hidden Markov Models. In Proceedings of the IEEE 23rd Conference on Business Informatics (CBI), Online Conference, 1–3 September 2021; pp. 171–180. [Google Scholar]
- Böhmer, K.; Rinderle-Ma, S. Mining association rules for anomaly detection in dynamic process runtime behavior and explaining the root cause to users. Inf. Syst. 2020, 90, 101438. [Google Scholar] [CrossRef]
- Bezerra, F.; Wainer, J. A Dynamic Threshold Algorithm for Anomaly Detection in Logs of Process Aware Systems. J. Inf. Data Manag. 2012, 3, 316–331. [Google Scholar]
- Folino, F.; Greco, G.; Guzzo, A.; Pontieri, L. Mining usage scenarios in business processes: Outlier-aware discovery and run-time prediction. Data Knowl. Eng. 2011, 70, 1005–1029. [Google Scholar] [CrossRef]
- Wang, J.; Tang, Y.; He, S.; Zhao, C.; Sharma, P.K.; Alfarraj, O.; Tolba, A. LogEvent2vec: LogEvent-to-Vector Based Anomaly Detection for Large-Scale Logs in Internet of Things. Sensors 2020, 20, 2451. [Google Scholar] [CrossRef] [PubMed]
- Wang, J.; Zhao, C.; He, S.; Gu, Y.; Alfarraj, O.; Abugabah, A. LogUAD: Log Unsupervised Anomaly Detection Based on Word2Vec. Comput. Syst. Sci. Eng. 2022, 41, 1207–1222. [Google Scholar] [CrossRef]
- Berti, A.; van Zelst, S.; Schuster, D. PM4Py: A process mining library for Python. Softw. Impacts 2023, 17, 100556. [Google Scholar] [CrossRef]
- Munoz-Gama, J.; Carmona, J. Enhancing precision in Process Conformance: Stability, confidence and severity. In Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining (CIDM), Paris, France, 11–15 April 2011; pp. 184–191. [Google Scholar]
- Wang, K.; Liu, X. An Anomaly Detection Method of Industrial Data Based on Stacking Integration. J. Artif. Intell. 2021, 3, 9. [Google Scholar] [CrossRef]
- Wang, J.; Zhou, Z.; Li, Z.; Du, S. A Novel Fault Detection Scheme Based on Mutual k-Nearest Neighbor Method: Application on the Industrial Processes with Outliers. Processes 2022, 10, 497. [Google Scholar] [CrossRef]
- Zhou, J.; Ye, Z.; Zhang, S.; Geng, Z.; Han, N.; Yang, T. Investigating response behavior through TF-IDF and Word2vec text analysis: A case study of PISA 2012 problem-solving process data. Heliyon 2024, 10, e35945. [Google Scholar] [CrossRef] [PubMed]
- Gomolka, Z.; Żesławska, E.; Olbrot, L. Using Hybrid LSTM Neural Networks to Detect Anomalies in the Fiber Tube Manufacturing Process. Appl. Sci. 2025, 15, 1383. [Google Scholar] [CrossRef]
Algorithm | Graph Representation | Proposer |
---|---|---|
RNN, KTAIL, and Markov Miners | FSM, Markov chain | [25] |
Agrawal Miner | DAG | [26] |
Alpha Miner | WF-net | [27] |
Heuristic Miner 1.0 | WF-net | [28] |
Genetic Miner 1.0 | C-net | [29] |
Heuristic Miner 2.0 | C-net | [30] |
Genetic Miner 2.0 | Process Tree | [31] |
Fuzzy Miner | DFG | [32] |
ETM | Process Tree | [33] |
Inductive Miner | Process Tree | [34] |
Fodina Miner | C-net | [35] |
Split Miner | BPMN | [36] |
Reference | Scenarios | Purpose | Research Modules | Perspectives | Algorithms |
---|---|---|---|---|---|
[9] | Insurance claim process | Business process optimization | Process discovery; process enhancement | Control flow; organization; case | Heuristic Miner |
[40] | Insurance claim process | Risk monitoring and risk identification | Process discovery; process enhancement | Control flow; case | Heuristic Miner |
[41] | Bank loan process | Process risk assessment; process risk identification | Process discovery; process enhancement | Control flow; case | Not mentioned |
[20] | Bank loan process | Business process optimization; process prediction | Process discovery; process enhancement | Control flow; organization; case | Inductive Miner |
[42] | Bank loan process | Business process analysis; process analysis framework | Process discovery; process enhancement | Control flow; time; case | Heuristic Miner Inductive Miner Fuzzy Miner |
[43] | Bank loan process | Business process analysis and optimization; process variants analysis; process performance evaluation | Process discovery; process enhancement | Control flow; case | Not mentioned |
[44] | Bank loan process | Concept drift; business process analysis | Process discovery | Control flow | Not mentioned |
[45] | Bank loan process | Business process optimization; process prediction | Process discovery | Control flow | Not mentioned |
[46] | Bank loan process | Business process analysis | Process discovery; process enhancement | Control flow; case | Fuzzy Miner |
[47] | Bank loan process | Business process modeling analysis | Process discovery; conformance checking; process enhancement | Control flow; time; organization; case | Inductive Miner |
[48] | Bank loan process | Business process analysis Process improvement based on Generative AI | Process discovery; process enhancement | Control flow; time; case | Fuzzy Miner |
Case ID | Activity | Date Time |
---|---|---|
B1xxxxxxxx448632 | Pre-application has been submitted for review | 2022-01-02 19:24:01 |
Under pre-review at the bank’s preliminary review post | 2022-01-04 08:55:23 | |
Pre-review has been completed and pending processing by the branch. | 2022-01-04 08:59:24 | |
The branch is preparing. | 2022-01-10 09:24:31 | |
…… | …… | |
B1xxxxxxxx454247 | Pre-application has been submitted for review | 2022-01-03 19:41:48 |
Open electronic channel pre-filled form | 2022-01-03 19:41:48 | |
Under pre-review at the bank’s preliminary review post | 2022-01-04 09:04:14 | |
…… | …… | |
…… | …… | …… |
Activity | Activity Number | Frequency | Proportion |
---|---|---|---|
Scanned for review the next day | HE01 | 62,199 | 20.00% |
Under pre-review at the bank’s preliminary review post | H2 | 34,785 | 11.18% |
Pre-application has been submitted for review | H1 | 33,911 | 10.90% |
Pre-review has been completed and pending processing by the branch. | H5 | 23,359 | 7.51% |
The branch is preparing. | H8 | 23,087 | 7.42% |
Counter business activated and accepted | H9 | 22,600 | 7.27% |
Completed and waiting for evaluation | H14 | 22,552 | 7.25% |
Account opening completed | H12 | 22,552 | 7.25% |
Items handed over, and the customer left the counter | H13 | 22,552 | 7.25% |
Next-day review has been completed | HE03 | 21,277 | 6.84% |
Pre-review waiting for customer to modify/supplement information | H3 | 8925 | 2.87% |
Open electronic channel pre-filled form | H90 | 6994 | 2.25% |
Next-day review returned and modified | HE02 | 2845 | 0.92% |
Pre-review rejected | H4 | 1627 | 0.52% |
Customer has withdrawn the order | H99 | 1221 | 0.39% |
Customer has evaluated | H24 | 355 | 0.11% |
On-site review failed and order withdrawn | H11 | 184 | 0.06% |
Customer has appointed | H97 | 28 | 0.01% |
Customer has obtained appointment number | H98 | 1 | 0.00% |
Activity | Average Completion Time (Activity) | Variance of Execution Completion Time (Activity) | Average Completion Time (Case) | Variance of Completion Time (Case) |
---|---|---|---|---|
Customer has evaluated | 7.57 days | 16.29 days | 5.57 days | 8.22 days |
On-site review failed and order withdrawn | 4.58 days | 10.25 days | ||
Counter business activated and accepted | 2.45 days | 4.86 days | ||
Next-day review has been completed | 1.47 days | 1.12 days | ||
Next-day review returned and modified | 1.44 days | 2.31 days | ||
Completed and waiting for evaluation | 23.69 h | 6.21 days | ||
Branch is preparing | 23.57 h | 2.63 days | ||
Scanned for review the next day | 14.03 h | 1.34 days | ||
Customer has withdrawn the order | 10.2 h | 3.11 days | ||
Under pre-review at the bank’s preliminary review post | 3.33 h | 21.05 h | ||
Pre-application has been submitted for review | 2.86 h | 20.44 h | ||
Customer has appointed | 1.26 h | 2.21 h | ||
Pre-review has been completed and pending processing by the branch | 8.86 min | 41.98 min | ||
Account opening completed | 8.50 min | 1.45 h | ||
Pre-review rejected | 6.42 min | 11.51 min | ||
Pre-review waiting for customer to modify/supplement information | 2.76 min | 41.41 min | ||
Items handed over, and the customer left the counter | 1.46 min | 1.12 h | ||
Open electronic channel pre-filled form | 1.4 min | 42 min | ||
Customer has obtained appointment number | - | - |
Indicators | Alpha Miner | Alpha + Miner | E-Heuristic Miner | Inductive Miner |
---|---|---|---|---|
Success/Failure | Failure | Failure | Success | Success |
Fitness | - | - | 0.911 | 1.0 |
Precision | - | - | 0.989 | 0.131 |
Generalization | - | - | 0.845 | 0.940 |
Simplicity | - | - | 0.495 | 0.522 |
Deviation Ratio of Activities | Deviation Ratio of Paths | Deviation Ratio of Cases |
---|---|---|
21.05% | 9.00% | 59.67% |
Algorithm | Number of Cases in Process Anomalies |
---|---|
E-Heuristic Miner | 15,266 |
One-Class SVM | 1280 |
PCA | 1280 |
KNN | 873 |
LSTM | 822 |
Word2Vec | 4406 |
Algorithm | The Number and Accuracy of (1) Identified | The Number and Accuracy of (2) and (3) Identified |
---|---|---|
E-Heuristic Miner | 11 (100%) | 782 (100%) |
One-Class SVM | 2 (18.18%) | 708 (90.54%) |
PCA | 0 (0.00%) | 686 (87.72%) |
KNN | 0 (0.00%) | 95 (12.15%) |
LSTM | 0 (0.00%) | 54 (6.91%) |
Word2Vec | 0 (0.00%) | 17 (2.17%) |
Input Text |
---|
Pre-application has been submitted for review -> Under pre-review at the bank’s preliminary review post -> Pre-review has been completed and pending processing by the branch -> Branch is preparing -> Counter business activated and accepted -> Account opening completed -> Items handed over and the customer left the counter -> Completed and waiting for evaluation -> Scanned for review the next day -> Scanned for review the next day -> Scanned for review the next day (frequency = 3334 performance = 420,942.921) Pre-application has been submitted for review -> Under pre-review at the bank’s preliminary review post -> Pre-review has been completed and pending processing by the branch -> Branch is preparing -> Counter business activated and accepted -> Account opening completed -> Items handed over and the customer left the counter -> Completed and waiting for evaluation -> Scanned for review the next day -> Scanned for review the next day -> Scanned for review the next day (frequency = 3172 performance = 454,041.715) Pre-application has been submitted for review -> Under pre-review at the bank’s preliminary review post -> Pre-review has been completed and pending processing by the branch -> Branch is preparing -> Counter business activated and accepted -> Account opening completed -> Items handed over and the customer left the counter -> Completed and waiting for evaluation -> Scanned for review the next day -> Scanned for review the next day -> Scanned for review the next day (frequency = 1567 performance = 425,102.106) …… What are the root causes of issues in the process? Please provide only process and data specific considerations. |
Input Text |
---|
If I have a Petri net: places: [ p_10, p_11, p_12, p_14, p_15, p_16, p_17, p_19, p_20, p_23, p_24, p_26, p_27, p_28, p_29, p_3, p_30, p_31, p_32, p_33, p_34, p_35, p_37, p_38, p_39, p_4, p_40, p_41, p_42, p_43, p_45, p_46, p_47, p_48, p_49, p_5, p_51, p_52, p_53, p_54, p_55, p_7, p_8, p_9, sink, source] transitions: [ (0281b5d2-8984-475f-9fef-38bf648715db, “Customer has appointed”), (0803a375-70b2-4982-a1c7-2b69d3416a7f, “Branch is preparing”), ……)] arcs: [ (0281b5d2-8984-475f-9fef-38bf648715db, “Customer has appointed”) -> p_35, (0803a375-70b2-4982-a1c7-2b69d3416a7f, “Branch is preparing”)->……] initial marking: [“source:1”] final marking: [“sink:1”] Can you provide suggestions to improve the process model based on your domain knowledge? |
Bottlenecks | Analysis | Suggestions |
---|---|---|
“Scanned and waiting for next day review” is repeated | “Scanned and waiting for next day review” occurs 2–4 times, which indicates that there may be review delays or redundant steps, which impede the prompt completion of business process. | OCR + real-time review can reduce repeated scanning |
“Pre-review pending customer modification/supplementary information” is stuck in a loop | “pre-review pending customer modification/supplementary information” occurs in multiple cycles and loops. | AI can help identify missing information and bring up all issues at once. It can also help customers modify or submit online. |
The position of “Completed and waiting for evaluation” is not unified | In some cases, “Completed and waiting for evaluation” occurs before or after “Scanned and waiting for next day review”. This means that there is a logical ambiguity or parallel problem between the evaluation process and the next-day review. | Unifies the evaluation order and provides an online evaluation channel |
High customer order cancellation rate | For example, after “Pre-review pending customer modification/supplementary information”, the frequency of customer order cancellation is 166. After “Pre-review has been completed and pending processing by the branch”, the frequency of customer order cancellation is 191. After multiple loops of “Pre-review pending customer modification/supplementary information” -> “Pre-application has been submitted for review”, the customer cancels the order. | (1) Identifies and reduces non-business value nodes such as “customer order cancellation”, “Pre-review rejected”, and “On-site review failed and order withdrawn”. These states may represent abnormal termination. If they constitute an excessively high proportion in the process, it may indicate that the customer experience is poor or that the bank’s pre-review criteria are ambiguous or too strict. (2) Introduces automated review mechanisms to reduce inefficient manual review. |
Frequent pre-review rejection | Pre-review rejections have occurred many times, indicating that the customer’s specific requirements may not be fully informed during the initial review or solutions may not be provided in a timely manner. | Provides information about risks in advance and recommends alternatives. |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Li, Y.; Ni, Z.; Xiao, B. Domain Knowledge-Enhanced Process Mining for Anomaly Detection in Commercial Bank Business Processes. Systems 2025, 13, 545. https://doi.org/10.3390/systems13070545
Li Y, Ni Z, Xiao B. Domain Knowledge-Enhanced Process Mining for Anomaly Detection in Commercial Bank Business Processes. Systems. 2025; 13(7):545. https://doi.org/10.3390/systems13070545
Chicago/Turabian StyleLi, Yanying, Zaiwen Ni, and Binqing Xiao. 2025. "Domain Knowledge-Enhanced Process Mining for Anomaly Detection in Commercial Bank Business Processes" Systems 13, no. 7: 545. https://doi.org/10.3390/systems13070545
APA StyleLi, Y., Ni, Z., & Xiao, B. (2025). Domain Knowledge-Enhanced Process Mining for Anomaly Detection in Commercial Bank Business Processes. Systems, 13(7), 545. https://doi.org/10.3390/systems13070545