Filters








631 Hits in 4.3 sec

Scalable Alignment of Process Models and Event Logs: An Approach Based on Automata and S-Components [article]

Daniel Reißner, Abel Armas-Cervantes, Raffaele Conforti, Marlon Dumas, Dirk Fahland, Marcello La Rosa
2020 arXiv   pre-print
Existing conformance checking techniques that fulfil this property exhibit limited scalability when confronted to large and complex models and logs.  ...  The synchronized product is used to extract minimal-length alignments between each trace of the log and the closest corresponding trace of the model.  ...  One widely used family of process mining techniques is conformance checking [2] .  ... 
arXiv:1910.09767v2 fatcat:7fgtor2ydrgzfp2s4f35f7ykp4

Efficient Conformance Checking using Approximate Alignment Computation with Tandem Repeats [article]

Daniel Reißner, Abel Armas-Cervantes, Marcello La Rosa
2022 arXiv   pre-print
Conformance checking encompasses a body of process mining techniques which aim to find and describe the differences between a process model capturing the expected process behavior and a corresponding event  ...  Alignments are an established technique to compute the distance between a trace in the event log and the closest execution trace of a corresponding process model.  ...  Related Work This section reviews techniques for computing alignments used in conformance checking, and techniques for string compression.  ... 
arXiv:2004.01781v2 fatcat:rdxjmb3oxvdltnx3zc76c4hdcu

Process Mining in the Large: A Tutorial [chapter]

Wil M.P. van der Aalst
2014 Lecture Notes in Business Information Processing  
This tutorial paper introduces basic process mining techniques that can be used for process discovery and conformance checking. Moreover, some very general decomposition results are discussed.  ...  These allow for the decomposition and distribution of process discovery and conformance checking problems, thus enabling process mining in the large.  ...  Consider for example conformance checking approaches that use state-space analysis (e.g., in [79] the shortest path enabling a transition is computed) or optimization over all possible alignments (e.g  ... 
doi:10.1007/978-3-319-05461-2_2 fatcat:b3up25ve5rc6tadyp5vkwghbwy

Towards Scalable Dataframe Systems [article]

Devin Petersohn, Stephen Macke, Doris Xin, William Ma, Doris Lee, Xiangxi Mo, Joseph E. Gonzalez, Joseph M. Hellerstein, Anthony D. Joseph, Aditya Parameswaran
2020 arXiv   pre-print
In this paper we lay out a vision and roadmap for scalable dataframe systems.  ...  To demonstrate the potential in this area, we report on our experience building MODIN, a scaled-up implementation of the most widely-used and complex dataframe API today, Python's pandas.  ...  This operator is useful for aligning two dataframes for comparison purposes.  ... 
arXiv:2001.00888v4 fatcat:ewwmj6dzubaijjjc4mwqfvarrq

Online Discovery of Cooperative Structures in Business Processes [chapter]

S. J. van Zelst, B. F. van Dongen, W. M. P. van der Aalst
2016 Lecture Notes in Computer Science  
We use online streams of events as an input rather than event logs, which are typically used in an off-line setting.  ...  We present the Online Cooperative Network (OCN) framework, which defines online cooperative resource network discovery in a generic way.  ...  Conformance checking aims at assessing whether a process model conforms w.r.t. behavior recorded in an event log.  ... 
doi:10.1007/978-3-319-48472-3_12 fatcat:chqsj2c4hfapdidprgkw5z4vqe

Model-based testing of global properties on large-scale distributed systems

Gerson Sunyé, Eduardo Cunha de Almeida, Yves Le Traon, Benoit Baudry, Jean-Marc Jézéquel
2014 Information and Software Technology  
Context: Large-scale distributed systems are becoming commonplace with the large popularity of peerto-peer and cloud computing.  ...  Method: We conduce real-scale experimental validation to evaluate the ability of our approach to check global properties.  ...  For our experiments, we use an incremental test methodology [6] that copes with both volatility and scalability aspects of largescale distributed systems.  ... 
doi:10.1016/j.infsof.2014.02.002 fatcat:u7izxwsd3vhzvcylzwt7tgyu7y

Example-based Synthesis of Static Analysis Rules [article]

Pranav Garg, Srinivasan Sengamedu SHS
2022 arXiv   pre-print
We present a new synthesis algorithm RhoSynth that is based on Integer Linear Programming-based graph alignment for identifying code elements of interest to the rule.  ...  We also address rule refinement in which the rules are incrementally improved with additional user-provided examples. We validate RhoSynth by synthesizing more than 30 Java code quality rules.  ...  Maximal Graph Alignment using ILP Graph alignment amongst the violating examples or conforming examples is one of the key steps in synthesizing the rule precondition or postcondition respectively.  ... 
arXiv:2204.08643v1 fatcat:uxrgb4davreurkptihcxoiifei

Flexible authentication of XML documents

P. Devanbu, M. Gertz, A. Kwong, C. Martel, G. Nuckolls, S. G. Stubblebine
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
This approach enhances both the security and scalability of publishing information in XML format over the internet.  ...  Build a Merkle tree out of the DOMHASHes and compute the root hash. 5. Use the hash path provided, beginning with the entry digest, to the root table digest, and check that the root digest matches.  ...  Another example is servicing requests submitted under the Electronic Freedom of Information Act Amendments (E-FOIA), which requires the US Government agencies to provide an online index, and search for  ... 
doi:10.1145/502001.502003 fatcat:tvkt4hvrtnglnamury6iaqrjxe

Flexible authentication of XML documents

Premkumar Devanbu, Michael Gertz, April Kwong, Charles Martel, Glen Nuckolls, Stuart G. Stubblebine, Sabrina De Capitani di Vimercati
2004 Journal of Computer Security  
This approach enhances both the security and scalability of publishing information in XML format over the internet.  ...  Build a Merkle tree out of the DOMHASHes and compute the root hash. 5. Use the hash path provided, beginning with the entry digest, to the root table digest, and check that the root digest matches.  ...  Another example is servicing requests submitted under the Electronic Freedom of Information Act Amendments (E-FOIA), which requires the US Government agencies to provide an online index, and search for  ... 
doi:10.3233/jcs-2004-12602 fatcat:wv7vgcxiqzcufeepriu6winpki

Efficient ATL Incremental Transformations

Théo Le Calvar, Frédéric Jouault, Fabien Chhel, Mickael Clavreul
2019 Journal of Object Technology  
Active operations have been shown to offer performant OCL-based model transformation incrementality with useful properties like fine-grained change propagation, and the preservation of collection ordering  ...  Using languages like Xtend alleviates some but not all issues.  ...  the prefix.  ... 
doi:10.5381/jot.2019.18.3.a2 fatcat:tdqruryiwjgm3opdmpmvj6o4am

End-to-End Entity Resolution for Big Data: A Survey [article]

Vassilis Christophides, Vasilis Efthymiou, Themis Palpanas, George Papadakis, Kostas Stefanidis
2020 arXiv   pre-print
., database, semantic Web and machine learning, in order to cope with the loose structuredness, extreme diversity, high speed and large scale of entity descriptions used by real-world applications.  ...  The composite similarity function is trained incrementally, using an efficient, online variation of the voted perceptron algorithm [67] .  ...  online as queries.  ... 
arXiv:1905.06397v3 fatcat:rs2qoolz2jcppklriew5pjfefq

Adaptive Service Binding with Lightweight Semantic Web Services [chapter]

Carlos Pedrinaci, Dave Lambert, Maria Maleshkova, Dong Liu, John Domingue, Reto Krummenacher
2011 Service Engineering  
Semantic Web Services, that is services that have been enriched with semantic annotations have often been used for providing adaptive service selection by deferring the binding of services until runtime  ...  their scalability.  ...  However, creating these descriptions represents a significant knowledge acquisition bottleneck, and reasoning over them carries a considerable computational overhead that has limited the scalability of  ... 
doi:10.1007/978-3-7091-0415-6_9 fatcat:3iuc7y4lw5dohgfamycrr2fmvq

Data management in Systems biology II - Outlook towards the semantic web [article]

Gerhard Mayer
2009 arXiv   pre-print
The benefit of using ontologies, defined by the respective data standards, is shown.  ...  It is presented how ontologies can be used for the semantic enrichment of data and how this can contribute to the vision of the semantic web to become true.  ...  incremental proposals SPARUL and SPARQL+.  ... 
arXiv:0912.2822v1 fatcat:2sl6qr3f2ve57g55gzxd3v4tpy

A Survey on Concept Drift in Process Mining

Denise Maria Vecino Sato, Sheila Cristiana De Freitas, Jean Paul Barddal, Edson Emilio Scalabrin
2022 ACM Computing Surveys  
We conducted a systematic literature review on the intersection of these areas, and thus, we review concept drift in PM and bring forward a taxonomy of existing techniques for drift detection and online  ...  For conformance checking, the algorithm applies the fitness based on alignments, using the cost for move on log only.  ...  A set of online process discovery and online conformance checking techniques have been evaluated considering the defined goals.  ... 
doi:10.1145/3472752 fatcat:zay6purz35bsfejb3zdpn3yb4m

Gravsearch: Transforming SPARQL to query humanities data

Tobias Schweizer, Benjamin Geer, Antonis Bikakis, Beatrice Markhoff, Alessandro Mosca, Stephane Jean, Eero Hyvönen
2020 Semantic Web Journal  
For example, the Bernoulli-Euler Online project (see Section 3) needed to present a manuscript page aligned with different layers of transcription, ranging from diplomatic transcriptions to translations  ...  Use case from the Bernoulli-Euler Online project One project that is using Gravsearch is Bernoulli-Euler Online (BEOL), 21 a digital edition project focusing on 17th-and 18th-century primary sources in  ...  Ontology schemas PREFIX knora-api: <http://api.knora.org/ontology/knora-api/v2#> PREFIX knora-api-simple: <http://api.knora.org/ontology/knora-api/simple/v2#> PREFIX beol: <http://api.dasch.swiss/ontology  ... 
doi:10.3233/sw-200386 fatcat:hooqro2axfdgnmwx7u2va7r5pi
« Previous Showing results 1 — 15 out of 631 results