Data & Knowledge Engineering最新文献

Goal modelling in aeronautics: Practical applications for aircraft and manufacturing designs 航空目标建模：飞机和制造设计的实际应用

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-11-05 DOI: 10.1016/j.datak.2024.102375

Anouck Chan , Anthony Fernandes Pires , Thomas Polacsek , Stéphanie Roussel , François Bouissière , Claude Cuiller , Pierre-Eric Dereux

{"title":"Goal modelling in aeronautics: Practical applications for aircraft and manufacturing designs","authors":"Anouck Chan , Anthony Fernandes Pires , Thomas Polacsek , Stéphanie Roussel , François Bouissière , Claude Cuiller , Pierre-Eric Dereux","doi":"10.1016/j.datak.2024.102375","DOIUrl":"10.1016/j.datak.2024.102375","url":null,"abstract":"<div><div>Traditional aircraft development follows a sequential approach: the aircraft is designed first, followed by the industrial system. This approach limits the industrial system’s performance due to constraints imposed by the pre-defined aircraft design. Collaborative approaches, however, advocate for simultaneous design of different products to create new opportunities. Within a project focused on co-designing aircraft and their industrial systems, we put goal modelling into practice to gain a comprehensive understanding of the objectives driving each system’s design and their interdependencies. The intention was to develop an approach for actively involving domain experts, even those lacking prior knowledge of Goal-Oriented Requirements Engineering (GORE).</div><div>This paper provides a detailed account of the iterative process employed to develop and refine our approach. For each iteration, we describe the organisation of modelling sessions with experts, the resulting models, and the collected feedback. We also report on the overall approach’s reception from both industry experts and academic participants. Furthermore, we highlight recommendations and research challenges that emerged from the encountered difficulties during the iterative process, suggesting avenues for further investigation and improvement.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"155 ","pages":"Article 102375"},"PeriodicalIF":2.7,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142661002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Ethical reasoning methods for ICT: What they are and when to use them 信息和传播技术的伦理推理方法：它们是什么以及何时使用

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-11-04 DOI: 10.1016/j.datak.2024.102373

Sergio España , Chris van der Maaten , Jens Gulden , Óscar Pastor

{"title":"Ethical reasoning methods for ICT: What they are and when to use them","authors":"Sergio España , Chris van der Maaten , Jens Gulden , Óscar Pastor","doi":"10.1016/j.datak.2024.102373","DOIUrl":"10.1016/j.datak.2024.102373","url":null,"abstract":"<div><div>Information and communication technology (ICT) brings about numerous advantages across various domains of our lives. However, alongside these benefits, there is a growing awareness of its potential negative ethical, social, and environmental impacts. Consequently, stakeholders ranging from conceptual modellers to policy makers often find themselves grappling with ethical considerations stemming from ICT engineering and usage. This paper presents a review of 10 ethical reasoning methods suitable for the ICT domain. We have employed a method engineering technique to author metamodels for the methods, which were subsequently subjected to validation by experts proficient in the respective methods. Following a situational method engineering approach, we have also characterised each ethical reasoning method and validated the characterisation with the experts. This has allowed us to develop a tool that helps select the method that is most suitable for a given ethical reasoning situation. Furthermore, we deliberate on the practical application of ethical reasoning methods within conceptual modelling contexts. We are confident that we have laid the groundwork for further research into ethical reasoning of ICT, with a specific emphasis on its role during conceptual modelling.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"155 ","pages":"Article 102373"},"PeriodicalIF":2.7,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142661004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SSQTKG: A Subgraph-based Semantic Query Approach for Temporal Knowledge Graph SSQTKG：基于子图的时态知识图谱语义查询方法

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-11-02 DOI: 10.1016/j.datak.2024.102372

Lin Zhu, Xinyi Duan, Luyi Bai

{"title":"SSQTKG: A Subgraph-based Semantic Query Approach for Temporal Knowledge Graph","authors":"Lin Zhu, Xinyi Duan, Luyi Bai","doi":"10.1016/j.datak.2024.102372","DOIUrl":"10.1016/j.datak.2024.102372","url":null,"abstract":"<div><div>Real-world knowledge graphs are growing in size with the explosion of data and rapid expansion of knowledge. There are some studies on knowledge graph query, but temporal knowledge graph (TKG) query is still a relatively unexplored field. A temporal knowledge graph is a knowledge graph that contains temporal information and contains knowledge that is likely to change over time. It introduces a temporal dimension that can characterize the changes and evolution of entities and relationships at different points in time. However, in the existing temporal knowledge graph query, the entity labels are one-sided, which cannot accurately reflect the semantic relationships of temporal knowledge graphs, resulting in incomplete query results. For the processing of temporal information in temporal knowledge graphs, we propose a temporal frame filtering approach and measure the acceptability of temporal frames by the new definition <em>sim</em><sub><em>time</em></sub> based on the proposed three temporal frames and nine rules. For measuring the semantic relationship of predicates between entities, we vectorize the semantic similarity between predicates, i.e., edges, using the knowledge embedding model, and propose the new definition <em>sim</em><sub><em>pre</em></sub> to measure the semantic similarity of predicates. Based on these, we propose a new semantic temporal knowledge graph query method <span><math><msub><mrow><mi>SSQ</mi></mrow><mrow><mi>TKG</mi></mrow></msub></math></span>, and perform pruning operations to optimize the query efficiency of the algorithm based on connectivity. Extensive experiments show that <span><math><msub><mrow><mi>SSQ</mi></mrow><mrow><mi>TKG</mi></mrow></msub></math></span> can return more accurate and complete results that meet the query conditions in the semantic query and can improve the performance of the querying on the temporal knowledge graph.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"155 ","pages":"Article 102372"},"PeriodicalIF":2.7,"publicationDate":"2024-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142661003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

VarClaMM: A reference meta-model to understand DNA variant classification VarClaMM：了解 DNA 变异分类的参考元模型

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-11-01 DOI: 10.1016/j.datak.2024.102370

Mireia Costa , Alberto García S. , Ana León , Anna Bernasconi , Oscar Pastor

{"title":"VarClaMM: A reference meta-model to understand DNA variant classification","authors":"Mireia Costa , Alberto García S. , Ana León , Anna Bernasconi , Oscar Pastor","doi":"10.1016/j.datak.2024.102370","DOIUrl":"10.1016/j.datak.2024.102370","url":null,"abstract":"<div><div>Determining the significance of a DNA variant in patients’ health status – a complex process known as <em>variant classification</em> – is highly critical for precision medicine applications. However, there is still debate on how to combine and weigh diverse available evidence to achieve proper and consistent conclusions. Indeed, currently, there are more than 200 different variant classification guidelines available to the scientific community, aiming to establish a framework for standardizing the classification process. Yet, these guidelines are qualitative and vague by nature, hindering their practical application and potential automation. Consequently, more precise definitions are needed.</div><div>In this work, we discuss our efforts to create VarClaMM, a UML meta-model that aims to provide a clear specification of the key concepts involved in variant classification, serving as a common framework for the process. Through this accurate characterization of the domain, we were able to find contradictions or inconsistencies that might have an effect on the classification results. VarClaMM’s conceptualization efforts will lay the ground for the operationalization of variant classification, enabling any potential automation to be based on precise definitions.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102370"},"PeriodicalIF":2.7,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NoSQL document data migration strategy in the context of schema evolution 模式演进背景下的 NoSQL 文档数据迁移策略

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-11-01 DOI: 10.1016/j.datak.2024.102369

Solomiia Fedushko , Roman Malyi , Yuriy Syerov , Pavlo Serdyuk

引用次数: 0

Change pattern relationships in event logs 事件日志中的更改模式关系

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-10-15 DOI: 10.1016/j.datak.2024.102368

Jonas Cremerius, Hendrik Patzlaff, Mathias Weske

{"title":"Change pattern relationships in event logs","authors":"Jonas Cremerius, Hendrik Patzlaff, Mathias Weske","doi":"10.1016/j.datak.2024.102368","DOIUrl":"10.1016/j.datak.2024.102368","url":null,"abstract":"<div><div>Process mining utilises process execution data to discover and analyse business processes. Event logs represent process executions, providing information about the activities executed. In addition to generic event attributes like activity name and timestamp, events might contain domain-specific attributes, such as a blood sugar measurement in a healthcare environment. Many of these values change during a typical process quite frequently. We refer to those as dynamic event attributes. Change patterns can be derived from dynamic event attributes, describing if the attribute values change from one activity to another. So far, change patterns can only be identified in an isolated manner, neglecting the chance of finding co-occuring change patterns. This paper provides an approach to identifying relationships between change patterns by utilising correlation methods from statistics. We applied the proposed technique on two event logs derived from the MIMIC-IV real-world dataset on hospitalisations in the US and evaluated the results with a medical expert. It turns out that relationships between change patterns can be detected within the same directly or eventually follows relation and even beyond that. Further, we identify unexpected relationships that are occurring only at certain parts of the process. Thus, the process perspective reveals novel insights on how dynamic event attributes change together during process execution. The approach is implemented in Python using the PM4Py framework.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102368"},"PeriodicalIF":2.7,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Strategic redesign of business processes in the digital age: A framework 数字时代业务流程的战略再设计：一个框架

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-10-05 DOI: 10.1016/j.datak.2024.102367

Fredrik Milani, Kateryna Kubrak, Juuli Nava

{"title":"Strategic redesign of business processes in the digital age: A framework","authors":"Fredrik Milani, Kateryna Kubrak, Juuli Nava","doi":"10.1016/j.datak.2024.102367","DOIUrl":"10.1016/j.datak.2024.102367","url":null,"abstract":"<div><div>Organizations constantly seek ways to improve their business processes by using digital technologies as enablers. However, simply substituting an existing technology with a new one has limited value compared to using the capabilities of digital technologies to redesign business processes. Therefore, process analysts try to understand how the capabilities of digital technologies can enable the redesign of business processes. In this paper, we conduct a systematic literature review and examine 40 case studies where digital technologies were used to redesign business processes. We identified that, within the context of business process improvement, capabilities of digitalization, communication, analytics, digital representation, and connectivity can enable business process redesign. Furthermore, we note that these capabilities enable applying nine redesign heuristics. Based on our review, we map how each capability can facilitate the implementation of specific redesign heuristics. Finally, we illustrate how such a capability-driven approach can be applied to Metaverse as an example of a digital technology. Our mapping and classification framework can aid analysts in identifying candidate redesigns that capitalize on the capabilities of digital technologies.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102367"},"PeriodicalIF":2.7,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Timed alignments with mixed moves 混合动作的定时排列

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-09-28 DOI: 10.1016/j.datak.2024.102366

Neha Rino , Thomas Chatain

{"title":"Timed alignments with mixed moves","authors":"Neha Rino , Thomas Chatain","doi":"10.1016/j.datak.2024.102366","DOIUrl":"10.1016/j.datak.2024.102366","url":null,"abstract":"<div><div>We study conformance checking for timed models, that is, process models that consider both the sequence of events that occur, as well as the timestamps at which each event is recorded. Time-aware process mining is a growing subfield of research, and as tools that seek to discover timing-related properties in processes develop, so does the need for conformance-checking techniques that can tackle time constraints and provide insightful quality measures for time-aware process models. One of the most useful conformance artefacts is the alignment, that is, finding the minimal changes necessary to correct a new observation to conform to a process model. In this paper, we extend the notion of timed distance from a previous work where an edit on an event’s timestamp came in two types, depending on whether or not it would propagate to its successors. Here, these different types of edits have a weighted cost each, and the ratio of their costs is denoted by <span><math><mi>α</mi></math></span>. We then solve the purely timed alignment problem in this setting for a large class of these weighted distances (corresponding to <span><math><mrow><mi>α</mi><mo>∈</mo><mrow><mo>{</mo><mn>1</mn><mo>}</mo></mrow><mo>∪</mo><mrow><mo>[</mo><mn>2</mn><mo>,</mo><mi>∞</mi><mo>)</mo></mrow></mrow></math></span>). For these distances, we provide linear time algorithms for both distance computation and alignment on models with sequential causal processes.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102366"},"PeriodicalIF":2.7,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

State-transition-aware anomaly detection under concept drifts 概念漂移下的状态转换感知异常检测

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-09-28 DOI: 10.1016/j.datak.2024.102365

Bin Li, Shubham Gupta, Emmanuel Müller

{"title":"State-transition-aware anomaly detection under concept drifts","authors":"Bin Li, Shubham Gupta, Emmanuel Müller","doi":"10.1016/j.datak.2024.102365","DOIUrl":"10.1016/j.datak.2024.102365","url":null,"abstract":"<div><div>Detecting temporal abnormal patterns over streaming data is challenging due to volatile data properties and the lack of real-time labels. The abnormal patterns are usually hidden in the temporal context, which cannot be detected by evaluating single points. Furthermore, the normal state evolves over time due to concept drifts. A single model does not fit all data over time. Autoencoders have recently been applied for unsupervised anomaly detection. However, they are trained on a single normal state and usually become invalid after distributional drifts in the data stream. This paper uses an Autoencoder-based approach STAD for anomaly detection under concept drifts. In particular, we propose a state-transition-aware model to map different data distributions in each period of the data stream into states, thereby addressing the model adaptation problem in an interpretable way. In addition, we analyzed statistical tests to detect the drift by examining the sensitivity and powers. Furthermore, we present considerable ways to estimate the probability density function for comparing the distributional similarity for state transitions. Our experiments evaluate the proposed method on synthetic and real-world datasets. While delivering comparable anomaly detection performance as the state-of-the-art approaches, STAD works more efficiently and provides extra interpretability. We also provide insightful analysis of optimal hyperparameters for efficient model training and adaptation.</div></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102365"},"PeriodicalIF":2.7,"publicationDate":"2024-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142422060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reasoning on responsibilities for optimal process alignment computation 最佳流程对齐计算的责任推理

IF 2.7 3区计算机科学

Data & Knowledge Engineering Pub Date : 2024-09-19 DOI: 10.1016/j.datak.2024.102353

Matteo Baldoni, Cristina Baroglio, Elisa Marengo, Roberto Micalizio

{"title":"Reasoning on responsibilities for optimal process alignment computation","authors":"Matteo Baldoni, Cristina Baroglio, Elisa Marengo, Roberto Micalizio","doi":"10.1016/j.datak.2024.102353","DOIUrl":"10.1016/j.datak.2024.102353","url":null,"abstract":"<div><p>Process alignment aims at establishing a matching between a process model run and a log trace. To improve such a matching, process alignment techniques often exploit contextual conditions to enable computations that are more informed than the simple edit distance between model runs and log traces. The paper introduces a novel approach to process alignment which relies on contextual information expressed as <em>responsibilities</em>. The notion of responsibility is fundamental in business and organization models, but it is often overlooked. We show the computation of optimal alignments can take advantage of responsibilities. We leverage on them in two ways. First, responsibilities may sometimes justify deviations. In these cases, we consider them as correct behaviors rather than errors. Second, responsibilities can either be met or neglected in the execution of a trace. Thus, we prefer alignments where neglected responsibilities are minimized.</p><p>The paper proposes a formal framework for responsibilities in a process model, including the definition of cost functions for computing optimal alignments. We also propose a branch-and-bound algorithm for optimal alignment computation and exemplify its usage by way of two event logs from real executions.</p></div>","PeriodicalId":55184,"journal":{"name":"Data & Knowledge Engineering","volume":"154 ","pages":"Article 102353"},"PeriodicalIF":2.7,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0169023X24000776/pdfft?md5=df35ebc627d0abaf942b9666c2d2c159&pid=1-s2.0-S0169023X24000776-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271815","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0