Anton Antonov, Humam Kourani, Alessandro Berti
et al.
Process mining provides powerful insights into organizational workflows, but extracting these insights typically requires expertise in specialized query languages and data science tools. Large Language Models (LLMs) offer the potential to democratize process mining by enabling business users to interact with process data through natural language. However, using LLMs as direct analytical engines over raw event logs introduces fundamental challenges: LLMs struggle with deterministic reasoning and may hallucinate metrics, while sending large, sensitive logs to external AI services raises serious data-privacy concerns. To address these limitations, we present PMAx, an autonomous agentic framework that functions as a virtual process analyst. Rather than relying on LLMs to generate process models or compute analytical results, PMAx employs a privacy-preserving multi-agent architecture. An Engineer agent analyzes event-log metadata and autonomously generates local scripts to run established process mining algorithms, compute exact metrics, and produce artifacts such as process models, summary tables, and visualizations. An Analyst agent then interprets these insights and artifacts to compile comprehensive reports. By separating computation from interpretation and executing analysis locally, PMAx ensures mathematical accuracy and data privacy while enabling non-technical users to transform high-level business questions into reliable process insights.
Logical specifications play a key role in the formal analysis of behavioural models. Automating the derivation of such specifications is particularly valuable in complex systems, where manual construction is time-consuming and error-prone. This article presents an approach for generating logical specifications from process models discovered via workflow mining, combining pattern-based translation with automated reasoning techniques. In contrast to earlier work, we evaluate the method on both general-purpose and real-case event logs, enabling a broader empirical assessment. The study examines the impact of data quality, particularly noise, on the structure and testability of generated specifications. Using automated theorem provers, we validate a variety of logical properties, including satisfiability, internal consistency, and alignment with predefined requirements. The results support the applicability of the approach in realistic settings and its potential integration into empirical software engineering practices.
The reconstruction, management, and optimization of gas pipelines is of significant importance for solving modern engineering problems. This paper presents innovative methodologies aimed at the effective reconstruction of gas pipelines under unstable conditions. The research encompasses the application of machine learning and optimization algorithms, targeting the enhancement of system reliability and the optimization of interventions during emergencies. The findings of the study present engineering solutions aimed at addressing the challenges in real-world applications by comparing the performance of various algorithms. Consequently, this work contributes to the advancement of cutting-edge approaches in the field of engineering and opens new perspectives for future research. A highly reliable and efficient technological Figure has been proposed for managing emergency processes in gas transportation based on the principles of the reconstruction phase. For complex gas pipeline systems, new approaches have been investigated for the modernization of existing control process monitoring systems. These approaches are based on modern achievements in control theory and information technology, aiming to select emergency and technological modes. One of the pressing issues is to develop a method to minimize the transmission time of measured and controlled data on non-stationary flow parameters of gas networks to dispatcher control centers. Therefore, the reporting Figures obtained for creating a reliable information base for dispatcher centers using modern methods to efficiently manage the gas dynamic processes of non-stationary modes are of particular importance.
Luis Vallejo-Molina, Astrid Blandon-Montes, Sebastian Lopez
et al.
AbstractThe use of Artificial Intelligence (AI), particularly of Artificial Neural Networks (ANN), in alerting possible scenarios of methane explosions in Colombian underground mines is illustrated by the analysis of an explosion that killed twelve miners. A combination of geological analysis, a detailed characterization of samples of coal dust and scene evidence, and an analysis with physical modeling tools supported the hypothesis of the existence of an initial methane explosion ignited by an unprotected tool that was followed by a coal dust explosion. The fact that one victim had a portable methane detector at the moment of the methane explosion suggested that the ubiquitous use of these systems in Colombian mines could be used to alert regulatory agencies of a possible methane explosion. This fact was illustrated with the generation of a database of possible readouts of methane concentration based on the recreation of the mine atmosphere before the explosion with Computational Fluid Dynamics (CFD). This database was used to train and test an ANN that included an input layer with two nodes, two hidden layers, each with eight nodes, and an output layer with one node. The inner layers applied a rectified linear unit activation function and the output layer a Sigmoid function. The performance of the ANN algorithm was considered acceptable as it correctly predicted the need for an explosion alert in 971.9 per thousand cases and illustrated how AI can process data that is currently discarded but that can be of importance to alert about methane explosions.
The rapid development of deep learning techniques, improved computational power, and the availability of vast training data have led to significant advancements in pre-trained models and large language models (LLMs). Pre-trained models based on architectures such as BERT and Transformer, as well as LLMs like ChatGPT, have demonstrated remarkable language capabilities and found applications in Software engineering. Software engineering tasks can be divided into many categories, among which generative tasks are the most concern by researchers, where pre-trained models and LLMs possess powerful language representation and contextual awareness capabilities, enabling them to leverage diverse training data and adapt to generative tasks through fine-tuning, transfer learning, and prompt engineering. These advantages make them effective tools in generative tasks and have demonstrated excellent performance. In this paper, we present a comprehensive literature review of generative tasks in SE using pre-trained models and LLMs. We accurately categorize SE generative tasks based on software engineering methodologies and summarize the advanced pre-trained models and LLMs involved, as well as the datasets and evaluation metrics used. Additionally, we identify key strengths, weaknesses, and gaps in existing approaches, and propose potential research directions. This review aims to provide researchers and practitioners with an in-depth analysis and guidance on the application of pre-trained models and LLMs in generative tasks within SE.
Due to the large size of open-pit mines’ long-term production scheduling (OPMPS) problem in large-scale deposits, it is challenging to solve that problem as the mixed integer linear programming (MILP) model. This study used an approach of the genetic algorithm (GA) to tackle this challenge. So, in a small hypothetical deposit, based on the blocks in the ultimate pit limit and scenarios with 2–6 phases, net present values (NPV) and computational times obtained from the GA and MILP model were compared to evaluate the GA. Also, the GA was applied to a large-scale deposit to determine the efficiency of the GA in real deposits. The maximum NPV was obtained for the four-phase scenario in the hypothetical deposit and the six-phase scenario in the large-scale deposit. Although the GA's NPV decreased slightly compared to the global optimum solution from the MILP model, the computational time was significantly reduced.
The aim of sequential pattern mining (SPM) is to discover potentially useful information from a given se-quence. Although various SPM methods have been investigated, most of these focus on mining all of the patterns. However, users sometimes want to mine patterns with the same specific prefix pattern, called co-occurrence pattern. Since sequential rule mining can make better use of the results of SPM, and obtain better recommendation performance, this paper addresses the issue of maximal co-occurrence nonoverlapping sequential rule (MCoR) mining and proposes the MCoR-Miner algo-rithm. To improve the efficiency of support calculation, MCoR-Miner employs depth-first search and backtracking strategies equipped with an indexing mechanism to avoid the use of sequential searching. To obviate useless support calculations for some sequences, MCoR-Miner adopts a filtering strategy to prune the sequences without the prefix pattern. To reduce the number of candidate patterns, MCoR-Miner applies the frequent item and binomial enumeration tree strategies. To avoid searching for the maximal rules through brute force, MCoR-Miner uses a screening strategy. To validate the per-formance of MCoR-Miner, eleven competitive algorithms were conducted on eight sequences. Our experimental results showed that MCoR-Miner outperformed other competitive algorithms, and yielded better recommendation performance than frequent co-occurrence pattern mining. All algorithms and datasets can be downloaded from https://github.com/wuc567/Pattern-Mining/tree/master/MCoR-Miner.
In this paper, we consider the naive applications of process mining in network traffic comprehension, traffic anomaly detection, and intrusion detection. We standardise the procedure of transforming packet data into an event log. We mine multiple process models and analyse the process models mined with the inductive miner using ProM and the fuzzy miner using Disco. We compare the two types of process models extracted from event logs of differing sizes. We contrast the process models with the RFC TCP state transition diagram and the diagram by Bishop et al. We analyse the issues and challenges associated with process mining in intrusion detection and explain why naive process mining with network data is ineffective.
AbstractInvestigation and uptake of filtered tailings continues to grow throughout the globe. This is driven by a wide range of site-specific considerations, which include such factors as tailings characteristics (e.g., amenability to filtration), production rates, climate, water availability, cost drivers, environmental requirements, and social factors. Despite the aforementioned technological growth, the currently available filtration technology is not able to meet the needs of many operations and projects that would otherwise adopt the technology. Experience with large-scale industrial filtration shows that vacuum belt filter systems meet the needs of many modern users, exceptions being the inability to effectively dewater tailings at altitude and/or with a fine particle size distribution: a potential fatal flaw. This paper presents a case study on the utilization of the patented Viper Filtration technology on gold tailings to overcome this challenge and shares the resultant full-scale plant design, highlighting the features designed to overcome cost and scalability deterrents. This technology is a novel mechanical process which complements the vacuum pressure in dewatering the filter cake as it travels along the belt filter. This project commenced with a pilot testing program, which successfully met the objective to rigorously test, measure and record any performance improvements achieved when engaging the Viper technology. Of the two tailings products tested, gross improvements of 4.2%w/w and 5.7%w/w were achieved when compared to the conventional vacuum belt filter operation. This pilot testing facilitated measurement of operating and design data, which forms the basis of the full-scale system design and resultant equipment supply of three vibration roller assemblies for retro-fitting on the existing vacuum belt filter.
Does the proof-of-work protocol serve its intended purpose of supporting decentralized cryptocurrency mining? To address this question, we develop a game-theoretical model where miners first invest in hardware to improve the efficiency of their operations, and then compete for mining rewards in a rent-seeking game. We argue that because of capacity constraints faced by miners, centralization in mining is lower than indicated by both public discourse and recent academic work. We show that advancements in hardware efficiency do not necessarily lead to larger miners increasing their advantage, but rather allow smaller miners to expand and new miners to enter the competition. Our calibrated model illustrates that hardware efficiency has a small impact on the cost of attacking a network, while the mining reward has a significant impact. This highlights the vulnerability of smaller and emerging cryptocurrencies, as well as of established cryptocurrencies transitioning to a fee-based mining reward scheme.
gSpan is a popular algorithm for mining frequent subgraphs. cgSpan (closed graph-based substructure pattern mining) is a gSpan extension that only mines closed subgraphs. A subgraph g is closed in the graphs database if there is no proper frequent supergraph of g that has equivalent occurrence with g. cgSpan adds the Early Termination pruning method to the gSpan pruning methods, while leaving the original gSpan steps unchanged. cgSpan also detects and handles cases in which Early Termination should not be applied. To the best of our knowledge, cgSpan is the first publicly available implementation for closed graphs mining
In the real world, the frequency of occurrence of objects is naturally skewed forming long-tail class distributions, which results in poor performance on the statistically rare classes. A promising solution is to mine tail-class examples to balance the training dataset. However, mining tail-class examples is a very challenging task. For instance, most of the otherwise successful uncertainty-based mining approaches struggle due to distortion of class probabilities resulting from skewness in data. In this work, we propose an effective, yet simple, approach to overcome these challenges. Our framework enhances the subdued tail-class activations and, thereafter, uses a one-class data-centric approach to effectively identify tail-class examples. We carry out an exhaustive evaluation of our framework on three datasets spanning over two computer vision tasks. Substantial improvements in the minority-class mining and fine-tuned model's performance strongly corroborate the value of our proposed solution.
Association Rule Mining is a machine learning method for discovering the interesting relations between the attributes in a huge transaction database. Typically, algorithms for Association Rule Mining generate a huge number of association rules, from which it is hard to extract structured knowledge and present this automatically in a form that would be suitable for the user. Recently, an information cartography has been proposed for creating structured summaries of information and visualizing with methodology called "metro maps". This was applied to several problem domains, where pattern mining was necessary. The aim of this study is to develop a method for automatic creation of metro maps of information obtained by Association Rule Mining and, thus, spread its applicability to the other machine learning methods. Although the proposed method consists of multiple steps, its core presents metro map construction that is defined in the study as an optimization problem, which is solved using an evolutionary algorithm. Finally, this was applied to four well-known UCI Machine Learning datasets and one sport dataset. Visualizing the resulted metro maps not only justifies that this is a suitable tool for presenting structured knowledge hidden in data, but also that they can tell stories to users.
Anil Koyuncu, Kui Liu, Tegawendé F. Bissyandé
et al.
Patching is a common activity in software development. It is generally performed on a source code base to address bugs or add new functionalities. In this context, given the recurrence of bugs across projects, the associated similar patches can be leveraged to extract generic fix actions. While the literature includes various approaches leveraging similarity among patches to guide program repair, these approaches often do not yield fix patterns that are tractable and reusable as actionable input to APR systems. In this paper, we propose a systematic and automated approach to mining relevant and actionable fix patterns based on an iterative clustering strategy applied to atomic changes within patches. The goal of FixMiner is thus to infer separate and reusable fix patterns that can be leveraged in other patch generation systems. Our technique, FixMiner, leverages Rich Edit Script which is a specialized tree structure of the edit scripts that captures the AST-level context of the code changes. FixMiner uses different tree representations of Rich Edit Scripts for each round of clustering to identify similar changes. These are abstract syntax trees, edit actions trees, and code context trees. We have evaluated FixMiner on thousands of software patches collected from open source projects. Preliminary results show that we are able to mine accurate patterns, efficiently exploiting change information in Rich Edit Scripts. We further integrated the mined patterns to an automated program repair prototype, PARFixMiner, with which we are able to correctly fix 26 bugs of the Defects4J benchmark. Beyond this quantitative performance, we show that the mined fix patterns are sufficiently relevant to produce patches with a high probability of correctness: 81% of PARFixMiner's generated plausible patches are correct.
The data mining field is an important source of large-scale applications and datasets which are getting more and more common. In this paper, we present grid-based approaches for two basic data mining applications, and a performance evaluation on an experimental grid environment that provides interesting monitoring capabilities and configuration tools. We propose a new distributed clustering approach and a distributed frequent itemsets generation well-adapted for grid environments. Performance evaluation is done using the Condor system and its workflow manager DAGMan. We also compare this performance analysis to a simple analytical model to evaluate the overheads related to the workflow engine and the underlying grid system. This will specifically show that realistic performance expectations are currently difficult to achieve on the grid.
Sequential pattern mining techniques extract patterns corresponding to frequent subsequences from a sequence database. A practical limitation of these techniques is that they overload the user with too many patterns. Local Process Model (LPM) mining is an alternative approach coming from the field of process mining. While in traditional sequential pattern mining, a pattern describes one subsequence, an LPM captures a set of subsequences. Also, while traditional sequential patterns only match subsequences that are observed in the sequence database, an LPM may capture subsequences that are not explicitly observed, but that are related to observed subsequences. In other words, LPMs generalize the behavior observed in the sequence database. These properties make it possible for a set of LPMs to cover the behavior of a much larger set of sequential patterns. Yet, existing LPM mining techniques still suffer from the pattern explosion problem because they produce sets of redundant LPMs. In this paper, we propose several heuristics to mine a set of non-redundant LPMs either from a set of redundant LPMs or from a set of sequential patterns. We empirically compare the proposed heuristics between them and against existing (local) process mining techniques in terms of coverage, redundancy, and complexity of the produced sets of LPMs.
Data Stream Mining is one of the area gaining lot of practical significance and is progressing at a brisk pace with new methods, methodologies and findings in various applications related to medicine, computer science, bioinformatics and stock market prediction, weather forecast, text, audio and video processing to name a few. Data happens to be the key concern in data mining. With the huge online data generated from several sensors, Internet Relay Chats, Twitter, Face book, Online Bank or ATM Transactions, the concept of dynamically changing data is becoming a key challenge, what we call as data streams. In this paper, we give the algorithm for finding frequent patterns from data streams with a case study and identify the research issues in handling data streams.