DPM-Bench: Benchmark for Distributed Process Mining Algorithms on Cyber-Physical Systems

• URL: http://arxiv.org/abs/2502.09975v2
• Date: Thu, 20 Feb 2025 15:47:09 GMT
• Title: DPM-Bench: Benchmark for Distributed Process Mining Algorithms on Cyber-Physical Systems
• Authors: Hendrik Reiter, Patrick Rathje, Olaf Landsiedel, Wilhelm Hasselbring,
• Abstract summary: This paper introduces the DPM-Bench benchmark for comparing Distributed Process Mining algorithms. The results enable information system engineers to assess whether the existing infrastructure is sufficient to perform distributed process mining.
• Score: 0.6640968473398456
• License:
• Abstract: Process Mining is established in research and industry systems to analyze and optimize processes based on event data from information systems. Within this work, we accomodate process mining techniques to Cyber-Physical Systems. To capture the distributed and heterogeneous characteristics of data, computational resources, and network communication in CPS, the todays process mining algorithms and techniques must be augmented. Specifically, there is a need for new Distributed Process Mining algorithms that enable computations to be performed directly on edge resources, eliminating the need for moving all data to central cloud systems. This paper introduces the DPM-Bench benchmark for comparing such Distributed Process Mining algorithms. DPM-Bench is used to compare algorithms deployed in different computational topologies. The results enable information system engineers to assess whether the existing infrastructure is sufficient to perform distributed process mining, or to identify required improvements in algorithms and hardware. We present and discuss an experimental evaluation with DPM-Bench.

Related papers

• Computation Rate Maximization for Wireless Powered Edge Computing With Multi-User Cooperation [10.268239987867453]
  This study considers a wireless-powered mobile edge computing system that includes a hybrid access point equipped with a computing unit and multiple Internet of Things (IoT) devices. We propose a novel muti-user cooperation scheme to improve computation performance, where collaborative clusters are dynamically formed. Specifically, we aims to maximize the weighted sum computation rate (WSCR) of all the IoT devices in the network.
  arXiv  Detail & Related papers  (2024-01-22T05:22:19Z)
• Using Machine Learning To Identify Software Weaknesses From Software Requirement Specifications [49.1574468325115]
  This research focuses on finding an efficient machine learning algorithm to identify software weaknesses from requirement specifications. Keywords extracted using latent semantic analysis help map the CWE categories to PROMISE_exp. Naive Bayes, support vector machine (SVM), decision trees, neural network, and convolutional neural network (CNN) algorithms were tested.
  arXiv  Detail & Related papers  (2023-08-10T13:19:10Z)
• A Survey From Distributed Machine Learning to Distributed Deep Learning [0.356008609689971]
  Distributed machine learning has been proposed, which involves distributing the data and algorithm across several machines. We divide these algorithms in classification and clustering (traditional machine learning), deep learning and deep reinforcement learning groups. Based on the investigation of the mentioned algorithms, we highlighted the limitations that should be addressed in future research.
  arXiv  Detail & Related papers  (2023-07-11T13:06:42Z)
• Self Optimisation and Automatic Code Generation by Evolutionary Algorithms in PLC based Controlling Processes [0.0]
  A novel approach based on evolutionary algorithms is proposed to self optimise the system logic of complex processes. The presented approach is evaluated on an industrial liquid station process subject to a multi-objective problem.
  arXiv  Detail & Related papers  (2023-04-12T06:36:54Z)
• TaSPM: Targeted Sequential Pattern Mining [53.234101208024335]
  We propose a generic framework namely TaSPM, based on the fast CM-SPAM algorithm. We also propose several pruning strategies to reduce meaningless operations in mining processes. Experiments show that the novel targeted mining algorithm TaSPM can achieve faster running time and less memory consumption.
  arXiv  Detail & Related papers  (2022-02-26T17:49:47Z)
• Asynchronous Parallel Incremental Block-Coordinate Descent for Decentralized Machine Learning [55.198301429316125]
  Machine learning (ML) is a key technique for big-data-driven modelling and analysis of massive Internet of Things (IoT) based intelligent and ubiquitous computing. For fast-increasing applications and data amounts, distributed learning is a promising emerging paradigm since it is often impractical or inefficient to share/aggregate data. This paper studies the problem of training an ML model over decentralized systems, where data are distributed over many user devices.
  arXiv  Detail & Related papers  (2022-02-07T15:04:15Z)
• Providing Meaningful Data Summarizations Using Examplar-based Clustering in Industry 4.0 [67.80123919697971]
  We show, that our GPU implementation provides speedups of up to 72x using single-precision and up to 452x using half-precision compared to conventional CPU algorithms. We apply our algorithm to real-world data from injection molding manufacturing processes and discuss how found summaries help with steering this specific process to cut costs and reduce the manufacturing of bad parts.
  arXiv  Detail & Related papers  (2021-05-25T15:55:14Z)
• Coded Stochastic ADMM for Decentralized Consensus Optimization with Edge Computing [113.52575069030192]
  Big data, including applications with high security requirements, are often collected and stored on multiple heterogeneous devices, such as mobile devices, drones and vehicles. Due to the limitations of communication costs and security requirements, it is of paramount importance to extract information in a decentralized manner instead of aggregating data to a fusion center. We consider the problem of learning model parameters in a multi-agent system with data locally processed via distributed edge nodes. A class of mini-batch alternating direction method of multipliers (ADMM) algorithms is explored to develop the distributed learning model.
  arXiv  Detail & Related papers  (2020-10-02T10:41:59Z)
• Process Discovery for Structured Program Synthesis [70.29027202357385]
  A core task in process mining is process discovery which aims to learn an accurate process model from event log data. In this paper, we propose to use (block-) structured programs directly as target process models. We develop a novel bottom-up agglomerative approach to the discovery of such structured program process models.
  arXiv  Detail & Related papers  (2020-08-13T10:33:10Z)
• Ranking and benchmarking framework for sampling algorithms on synthetic data streams [0.0]
  In big data, AI, and streaming processing, we work with large amounts of data from multiple sources. Due to memory and network limitations, we process data streams on distributed systems to alleviate computational and network loads. We provide algorithms that react to concept drifts and compare those against the state-of-the-art algorithms using our framework.
  arXiv  Detail & Related papers  (2020-06-17T14:25:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.