TUHH Open Research
Help
  • Log In
    New user? Click here to register.Have you forgotten your password?
  • English
  • Deutsch
  • Communities & Collections
  • Publications
  • Research Data
  • People
  • Institutions
  • Projects
  • Statistics
  1. Home
  2. TUHH
  3. Publications
  4. EdgeMiner: distributed process mining at the data sources
 
Options

EdgeMiner: distributed process mining at the data sources

Citation Link: https://doi.org/10.15480/882.16441
Publikationstyp
Conference Paper
Date Issued
2025-05-14
Sprache
English
Author(s)
Andersen, Julia  
Rathje, Patrick  
Imenkamp, Christian  
Koschmider, Agnes  
Landsiedel, Olaf  
Networked Cyber-Physical Systems E-17  
TORE-DOI
10.15480/882.16441
TORE-URI
https://hdl.handle.net/11420/60717
Start Page
705
End Page
713
Citation
40th Annual ACM Symposium on Applied Computing, SAC 2025
Contribution to Conference
40th Annual ACM Symposium on Applied Computing, SAC 2025  
Publisher DOI
10.1145/3672608.3707873
Scopus ID
2-s2.0-105006447186
Publisher
ACM
ISBN
979-8-4007-0629-5
Peer Reviewed
true
Is New Version of
10.15480/882.15121
Process mining is moving beyond mining traditional event logs and nowadays includes, for example, data sourced from sensors in the Internet of Things (IoT). The volume and velocity of data generated by such sensors make it increasingly challenging to efficiently process the data by traditional process discovery algorithms, which operate on a centralized event log. This paper presents EdgeMiner, an algorithm for distributed process mining operating directly on sensor nodes on a stream of real-time event data. In contrast to centralized algorithms, EdgeMiner tracks each event and its predecessor and successor events directly on the sensor node where the event is sensed and recorded. As EdgeMiner aggregates direct successions on the individual nodes, the raw data does not need to be stored centrally, thus improving scalability and privacy. We analytically and experimentally show the correctness of EdgeMiner. Our evaluation results show that EdgeMiner determines predecessors for each event efficiently, reducing the communication overhead by up to 96% compared to querying all nodes. Further, we show that the number of queried nodes stabilizes after relatively few events, and batching predecessor queries in groups reduces the average queried nodes per event to less than 2.5%.
Subjects
distributed process mining
event data stream
in-network processing
internet of things
scalability
MLE@TUHH
DDC Class
005.7: Data
006.33: Knowledge-based Systems
Lizenz
https://creativecommons.org/licenses/by/4.0/
Publication version
publishedVersion
Loading...
Thumbnail Image
Name

2025_Andersen_EdgeMiner_DistributedProcessMiningAtTheDataSources.pdf

Size

1.56 MB

Format

Adobe PDF

TUHH
Weiterführende Links
  • Contact
  • Send Feedback
  • Cookie settings
  • Privacy policy
  • Impress
DSpace Software

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science
Design by effective webwork GmbH

  • Deutsche NationalbibliothekDeutsche Nationalbibliothek
  • ORCiD Member OrganizationORCiD Member Organization
  • DataCiteDataCite
  • Re3DataRe3Data
  • OpenDOAROpenDOAR
  • OpenAireOpenAire
  • BASE Bielefeld Academic Search EngineBASE Bielefeld Academic Search Engine
Feedback