Filtern
Erscheinungsjahr
Dokumenttyp
- Dissertation (16)
- Wissenschaftlicher Artikel (3)
Sprache
- Englisch (19) (entfernen)
Schlagworte
- Algorithmus (3)
- Abfrageverarbeitung (2)
- OBDD (2)
- OBDDs (2)
- (general) boustrophedon (returning) finite automata (1)
- (general) jumping finite automata (1)
- (regular : regular) array grammars (1)
- (regulär: regulär) Array-Grammati (1)
- Algorithmische Lerntheorie (1)
- Amortisierte Laufzeitanalyse (1)
- Amortized run time analysis (1)
- Analyse (1)
- Automata Theory (1)
- Automatentheorie (1)
- BMAP (1)
- Case-Based Reasoning (1)
- Client-server-Konzept (1)
- Cluster (1)
- Datenspeicherung (1)
- Datenstruktur (1)
- Directed Graphs (1)
- Disambiguierung von Personennamen (1)
- Distributed Systems (1)
- Dokumentverarbeitung (1)
- Elektronische Bibliothek (1)
- Erweiterung (1)
- Eulerian trails (1)
- Exact Algorithms (1)
- Exakte Algorithmen (1)
- Exponental time algorithms (1)
- Exponentialzeit Algorithmen (1)
- Fallbasiertes Schließen (1)
- Fitness (1)
- Formal Verification (1)
- Formal languages (1)
- Gerichteter Graph (1)
- Gesundheit (1)
- Graph Minors (1)
- Graph Rewriting (1)
- Graph Visualization (1)
- Graphen mit Eulerschen Pfaden (1)
- Graphvisualisierung (1)
- Hyperlink-Proposals (1)
- Information Visualization (1)
- Informationsvisualisierung (1)
- Integrated Circuits (1)
- Internetdienst (1)
- Kom (1)
- Kombinatorische Optimierung (1)
- Komplexe Netzwerke (1)
- Komplexe Systeme (1)
- Komplexität (1)
- Konformitätsprüfung (1)
- Logischer Entwurf (1)
- Markov Jump Process (1)
- Markov-Prozess (1)
- Mathematische Lerntheorie (1)
- Measure & Conquer (1)
- Metadaten (1)
- Middleware (1)
- Minor <Graphentheorie> (1)
- Mobile Networks (1)
- Mobile Telekommunikation (1)
- Modellierung (1)
- NP-hartes Problem (1)
- Netzwerk (1)
- Nichtlineare Dynamik (1)
- Näherungsverfahren (1)
- Operations Research (1)
- Ordered Binary Decision Diagrams (1)
- Parameterisierte Algorithmen (1)
- Parameterized Algorithms (1)
- Parametrisierte Approximation (1)
- Peer-to-Peer-Netz (1)
- Periodic Queues (1)
- Personenname (1)
- Process-Oriented Case-Based Reasoning (1)
- Prozessanalyse (1)
- Prozessor (1)
- Pufferspeicher (1)
- Queues (1)
- Reduktionssystem (1)
- Regular Expressions (1)
- Regulärer Ausdruck (1)
- Request-Prediction (1)
- Robustheit (1)
- Selbstorganisation (1)
- Selbstüberwachung (1)
- Siamese Graph Neural Networks (1)
- Software Visualization (1)
- Softwarevisualisierung (1)
- Speicherdirektzugriff (1)
- Standard ML (1)
- Statistical Mechanics of complex networks (1)
- Statistische Mechanik komplexer Netze (1)
- Synchronisierung (1)
- Syntaktische Analyse (1)
- Telekommunikationsnetz (1)
- Theoretische Informatik (1)
- Transitionssystem (1)
- Verifikation (1)
- Verteiltes System (1)
- Visualisierung (1)
- Visualization (1)
- Warteschlangentheorie (1)
- Web-Applications (1)
- XML (1)
- XOR Parity (1)
- Zufallsgraph (1)
- algorithm analysis (1)
- cache behavior (1)
- clustering (1)
- complex networks (1)
- complex systems (1)
- complexity (1)
- conformance checking (1)
- controlled queueing system (1)
- digital library (1)
- endliche Boustrophedon-Automaten (1)
- event log preprocessing (1)
- event reconstruction (1)
- experimental design (1)
- fitness tracker (1)
- formal verification (1)
- grammatical inference (1)
- graph embedding (1)
- historical metadata (1)
- invisible deviating events (1)
- jumping endliche Automaten (1)
- memory distance (1)
- mobile Telekommunikation (1)
- numerical analysis (1)
- optimal control (1)
- parameterised approximation (1)
- partitioning (1)
- person name disambiguation (1)
- physical activity (1)
- process mining (1)
- questionnaires (1)
- recurring events (1)
- reordering (1)
- similarity-based retrieval (1)
- threshold (1)
- time complexity (1)
- zurückkehrende(RFA) (1)
Institut
- Informatik (19) (entfernen)
Reconstructing invisible deviating events: A conformance checking approach for recurring events
(2022)
Conformance checking enables organizations to determine whether their executed processes are compliant with the intended process. However, if the processes contain recurring activities, state-of-the-art approaches unfortunately have difficulties calculating the conformance. The occurrence of complex temporal rules can further increase the complexity of the problem. Identifying this limitation, this paper presents a novel approach towards dealing with recurring activities in conformance checking. The core idea of the approach is to reconstruct the missing events in the event log using defined rules while incorporating specified temporal event characteristics. This approach then enables the use of native conformance checking algorithms. The paper illustrates the algorithmic approach and defines the required temporal event characteristics. Furthermore, the approach is applied and evaluated in a case study on an event log for melanoma surveillance.