Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Joerg Evermann

dblp:75/6793 · DBLP profile ↗
← Back
20ranked-venue papers
17as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 12 · 10 first-author · 2 since 2021Software engineering, systems software and programming languages · 7 · 6 first-authorArtificial intelligence and machine learning · 3 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Services computing and microservices · 38% Empirical software engineering · 38% Requirements engineering and software design · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Databases, data mining, and information retrieval
2 papers
Data integration and cleaning · 69% Data mining · 31%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Services computing and microservices
business process management
0.212016
Scalable Process Discovery Using Map-Reduce · IEEE Trans. Serv. Comput. 2016
Empirical software engineering › process mining
process discovery
0.212016
Scalable Process Discovery Using Map-Reduce · IEEE Trans. Serv. Comput. 2016
Parallel and multicore computing › data-parallel programming
mapreduce
0.212016
Scalable Process Discovery Using Map-Reduce · IEEE Trans. Serv. Comput. 2016
Data integration and cleaning
schema matching
0.112008
An Exploratory Study of Database Integration Processes · IEEE Trans. Knowl. Data Eng. 2008
Data mining
process mining
0.112016
Scalable Process Discovery Using Map-Reduce · IEEE Trans. Serv. Comput. 2016
Requirements engineering and software design › conceptual modeling
domain modeling
0.112005
Toward Formalizing Domain Modeling Semantics in Language Syntax · IEEE Trans. Software Eng. 2005
Requirements engineering and software design › model-driven engineering › domain-specific modeling
domain-specific modeling language
0.112005
Toward Formalizing Domain Modeling Semantics in Language Syntax · IEEE Trans. Software Eng. 2005
Requirements engineering and software design
model-driven engineering
0.112005
Toward Formalizing Domain Modeling Semantics in Language Syntax · IEEE Trans. Software Eng. 2005

Methods — techniques the papers use, named apart from their topics

mapreduce · 0.8log-based ordering relations · 0.8protocol analysis · 0.1process tracing · 0.1metamodeling · 0.1domain ontology · 0.1
YearPublicationVenuePosition
2023 In Memoriam - Professor Aditya Ghose
Joerg Evermann, Jennifer Horkoff, Jeffrey Parsons, Vítor E. Silva Souza
Data Knowl. Eng.1
2023 Preface
Aditya Ghose, Jennifer Horkoff, Vítor E. Silva Souza, Jeffrey Parsons, Joerg Evermann
Data Knowl. Eng.5
2017 Predicting process behaviour using deep learning
Joerg Evermann, Jana-Rebecca Rehse, Peter Fettke
Decis. Support Syst.1
2016 Process Discovery from Event Stream Data in the Cloud - A Scalable, Distributed Implementation of the Flexible Heuristics Miner on the Amazon Kinesis Cloud Infrastructure
abstract
Cloud computing offers readily available, scalable infrastructure to tackle problems involving high data volume and velocity. Discovering processes from event streams, especially when the business processes execute in a cloud environment, is such a problem. Event stream data is generated rapidly with varying volume and must be processed on-the-fly, making stream processing an important use case for cloud computing. This paper describes a distributed, streaming implementation of the flexible heuristics miner on Amazon Kinesis, a cloud-based event stream infrastructure, showing how mining methods can scale effortlessly to tens of millions of events per minute.
Joerg Evermann, Jana-Rebecca Rehse, Peter Fettke
CloudCom1
2016 Scalable Process Discovery Using Map-Reduce
abstract
Process discovery is an approach to extract process models from event logs. Given the distributed nature of modern information systems, event logs are likely to be distributed across different physical machines. Map-Reduce is a scalable approach for efficient computations on distributed data. In this paper we present Map-Reduce implementations of two well-known process mining algorithms to take advantage of the scalability of the Map-Reduce approach. We present the design of a series of mappers and reducers to compute the log-based ordering relations from distributed event logs. These can then be used to discover a process model. We provide experimental results that show the performance and scalability of our implementations.
Joerg Evermann
IEEE Trans. Serv. Comput.1
2015 An integrated framework for theories of individual attitudes toward technology
Mary Tate, Joerg Evermann, Guy G. Gable
Inf. Manag.2
2014 Guidelines for using UML association classes and their effect on domain understanding in requirements engineering
Palash Bera, Joerg Evermann
Requir. Eng.2
2010 Contextual Factors in Database Integration - A Delphi Study
Joerg Evermann
ER1
2010 Evaluating ontologies: Towards a cognitive measure of quality
Joerg Evermann, Jennifer Fang
Inf. Syst.1
2009 Theories of meaning in schema matching: An exploratory study
Joerg Evermann
Inf. Syst.1
2009 Ontology Based Object-Oriented Domain Modeling: Representing Behavior
abstract
An important step in developing the requirements for an information system is analyzing the application domain. In this step, conceptual models are used for representing an application domain. However, while languages for software design are available and widely used, no generally accepted language exists for conceptual modeling. This work suggests the use of object-oriented software modeling languages also for conceptual modeling. Such use can support a more accurate transition from domain models to software models. As software-modeling languages were not intended for modeling application domains, their constructs lack the required semantics. While previous papers addressed the representation of structural elements of domains using object concepts, this paper addresses behavioral aspects, related to change and interaction. The proposed semantics are based on a mapping between ontological concepts that describe behavior and object-oriented constructs related to dynamics. Based on these mappings, modeling rules are proposed to guide the modeler in creating ontologically well-formed models. The mappings and rules are exemplified using UML and are demonstrated using a case study.
Joerg Evermann, Yair Wand
J. Database Manag.1
2009 A UML and OWL description of Bunge's upper-level ontology model
Joerg Evermann
Softw. Syst. Model.1
2008 Theories of Meaning in Schema Matching: A Review
abstract
Schema matching is the identification of database elements with similar meaning as preparation for subsequent database integration. Over the past 20 years, different schema-matching methods have been proposed and have been shown to be successful to various degrees. However, schema matching is an ongoing research area and the problem is not yet considered to be solved. This article reviews existing schema-matching methods from the perspective of theories of meanings drawn from philosophy and psychology. It positions existing methods, raises questions for future research based on these theories, and shows how these theories can form a firm theoretical basis as well as guide future schema-matching research.
Joerg Evermann
J. Database Manag.1
2008 A cognitive semantics for the association construct
Joerg Evermann
Requir. Eng.1
2008 An Exploratory Study of Database Integration Processes
abstract
One of the central problems of database integration is schema matching, that is, the identification of similar data elements in two or more databases or other data sources. Existing definitions of "similarity" in this context vary greatly. As a result, schema matching has given rise to a large number of heuristics software tools. However, the empirical understanding of this process in humans is very limited so that little guidance can be offered to the further development of heuristics and tools. This paper presents an exploratory process tracing study of the similarity judgement process in humans. The similarity judgements of 12 data integration professionals on a range of integration problems are recorded and analyzed. Implications for future empirical and applied research in this area are discussed.
Joerg Evermann
IEEE Trans. Knowl. Data Eng.1
2006 Ontological Modeling Rules for UML: An Empirical Assessment
abstract
The Unified Modeling Language (UML) is widely accepted as the de-facto standard for object-oriented information systems (IS) design and software modeling. Recent research has proposed to extend the use of UML to conceptual modeling of application domains. Conceptual models serve both as the basis for communication and domain understanding among analysts, and as the starting point for IS software design. Prior research has proposed a set of modeling rules to provide the analyst or modeler with guidelines for using UML for conceptual modeling.This paper provides an empirical assessment of the benefits derived from using these modeling rules. Using an experimental study involving 53 subjects, it examines the effects of different levels of modeling rule application on application domain understanding. The results show statistically significant differences in the level of domain understanding that was derived from the various models.
Joerg Evermann, Yair Wand
J. Comput. Inf. Syst.1
2005 The Association Construct in Conceptual Modelling - An Analysis Using the Bunge Ontological Model
Joerg Evermann
CAiSE1
2005 Ontology based object-oriented domain modelling: fundamental concepts
Joerg Evermann, Yair Wand
Requir. Eng.1
2005 Toward Formalizing Domain Modeling Semantics in Language Syntax
abstract
Information systems are situated in and are representations of some business or organizational domain. Hence, understanding the application domain is critical to the success of information systems development. To support domain understanding, the application domain is represented in conceptual models. The correctness of conceptual models can affect the development outcome and prevent costly rework during later development stages. This paper proposes a method to restrict the syntax of a modeling language to ensure that only possible configurations of a domain can be modeled, thus increasing the likelihood of creating correct domain models. The proposed method, based on domain ontologies, captures relationships among domain elements via constraints on the language metamodel, thus restricting the set of statements about the domain that can be generated with the language. In effect, this method creates domain specific modeling languages from more generic ones. The method is demonstrated using the Unified Modeling Language (UML). Specifically, it is applied to the subset of UML dealing with object behavior and its applicability is demonstrated on a specific modeling example.
Joerg Evermann, Yair Wand
IEEE Trans. Software Eng.1
2001 Towards Ontologically Based Semantics for UML Constructs
Joerg Evermann, Yair Wand
ER1