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

Xiaoxu Xia

dblp:167/0274 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorSystems, architecture and hardware · 1

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
1 paper
Empirical software engineering · 56% Software testing · 44%
Databases, data mining, and information retrieval
1 paper
Data mining · 77% Data integration and cleaning · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
process mining
0.312017
Scientific Workflow Mining in Clouds · IEEE Trans. Parallel Distributed Syst. 2017
Software testing › protocol testing
conformance checking
0.312017
Efficient Alignment Between Event Logs and Process Models · IEEE Trans. Serv. Comput. 2017
Empirical software engineering
process mining
0.312017
Efficient Alignment Between Event Logs and Process Models · IEEE Trans. Serv. Comput. 2017
High-performance computing › scientific workflow
scientific workflow management
0.312017
Scientific Workflow Mining in Clouds · IEEE Trans. Parallel Distributed Syst. 2017
Data integration and cleaning
data provenance
0.112017
Scientific Workflow Mining in Clouds · IEEE Trans. Parallel Distributed Syst. 2017
Empirical software engineering › process mining
process discovery
0.112017
Efficient Alignment Between Event Logs and Process Models · IEEE Trans. Serv. Comput. 2017

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

prom · 0.6process mining · 0.6trace replaying · 0.3heuristic search · 0.3a* search · 0.3
YearPublicationVenuePosition
2017 Scientific Workflow Mining in Clouds
abstract
Computing clouds have become the platform of choice for the deployment and execution of scientific workflows. Due to the uncertainty and unpredictability of scientific exploration, the execution plan for a scientific workflow may vary from the definition. It is therefore of great significance to be able to discover actual workflows from execution histories (event logs) to reproduce experimental results and to establish provenance. However, most existing process mining techniques focus on discovering control flow-oriented business processes in a centralized environment, and thus, they are mostly inapplicable to the discovery of data flow-oriented, unstructured scientific workflows in distributed cloud environments. In this paper, we present Scientific Workflow Mining as a Service (SWMaaS) to support both intra-cloud and inter-cloud scientific workflow mining. The approach is implemented as a ProM plug-in and is evaluated on event logs derived from real-world scientific workflows. Through experimental results, we demonstrate the effectiveness and efficiency of our approach.
Wei Song 0003, Fangfei Chen, Hans-Arno Jacobsen, Xiaoxu Xia, Chunyang Ye, Xiaoxing Ma
IEEE Trans. Parallel Distributed Syst.4
2017 Efficient Alignment Between Event Logs and Process Models
abstract
The aligning of event logs with process models is of great significance for process mining to enable conformance checking, process enhancement, performance analysis, and trace repairing. Since process models are increasingly complex and event logs may deviate from process models by exhibiting redundant, missing, and dislocated events, it is challenging to determine the optimal alignment for each event sequence in the log, as this problem is NP-hard. Existing approaches utilize the cost-based A* algorithm to address this problem. However, scalability is often not considered, which is especially important when dealing with industrial-sized problems. In this paper, by taking advantage of the structural and behavioral features of process models, we present an efficient approach which leverages effective heuristics and trace replaying to significantly reduce the overall search space for seeking the optimal alignment. We employ real-world business processes and their traces to evaluate the proposed approach. Experimental results demonstrate that our approach works well in most cases, and that it outperforms the state-of-the-art approach by up to 5 orders of magnitude in runtime efficiency.
Wei Song 0003, Xiaoxu Xia, Hans-Arno Jacobsen, Pengcheng Zhang 0001, Hao Hu 0001
IEEE Trans. Serv. Comput.2
2016 Effa: a proM plugin for recovering event logs
abstract
While event logs generated by business processes play an increasingly significant role in business analysis, the quality of data remains a serious problem. Automatic recovery of dirty event logs is desirable and thus receives more attention. However, existing methods only focus on missing event recovery, or fall short of efficiency. To this end, we present Effa, a ProM plugin, to automatically recover event logs in the light of process specifications. Based on advanced heuristics including process decomposition and trace replaying to search the minimum recovery, Effa achieves a balance between repairing accuracy and efficiency.
Xiaoxu Xia, Wei Song 0003, Fangfei Chen, Xuansong Li, Pengcheng Zhang 0001
Internetware1
2015 Heuristic Recovery of Missing Events in Process Logs
abstract
Event logs are of paramount significance for process mining and complex event processing. Yet, the quality of event logs remains a serious problem. Missing events of logs are usually caused by omitting manual recording, system failures, and hybrid storage of executions of different processes. It has been proved that the problem of minimum recovery based on a priori process specification is NP-hard. State-of-the-art approach is still lacking in efficiency because of the large search space. To address this issue, in this paper, we leverage the technique of process decomposition and present heuristics to efficiently prune the unqualified sub-processes that fail to generate the minimum recovery. We employ real-world processes and their incomplete sequences to evaluate our heuristic approach. The experimental results demonstrate that our approach achieves high accuracy as the state-of-the-art approach does, but it is more efficient.
Wei Song 0003, Xiaoxu Xia, Hans-Arno Jacobsen, Pengcheng Zhang 0001, Hao Hu 0001
ICWS2