Open Access
Refining active learning to increase behavioral coverage
Kousar Aslam,Yaping Luo,Ramon R. H. Schiffelers,M.G.J. van den Brand +3 more
- 03 Oct 2018
1
TL;DR: This work presents an approach to aid active learning technique with software logs (execution traces) and passive learning result to increase the behavioral coverage of learned models.
read more
Abstract: Modern high-tech industry is dealing with the maintenance of complex software systems today which consist of a large number of interconnected software components. Many of these components become legacy over years due to lack of documentation and unavailability of original developers. Several techniques are available in literature to retrieve the behavioral models from the existing software. Among those, the dynamic analysis techniques analyze the actual execution of the software, either via execution traces (passive learning), or by interaction with the software components (active learning). These techniques cannot guarantee alone to learn the complete and correct software behavior due to the limitations of each technique. We present an approach to aid active learning technique with software logs (execution traces) and passive learning result to increase the behavioral coverage of learned models.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Improving Model Inference in Industry by Combining Active and Passive Learning
Nan Yang,Kousar Aslam,Ramon R. H. Schiffelers,Leonard Lensink,Dennis Hendriks,Loek Cleophas,Alexander Serebrenik +6 more
- 15 Mar 2019
TL;DR: The learning time/completeness achieved trade-off of active learning is investigated with a pilot study at ASML, provider of lithography systems for the semiconductor industry, and the advocate extending active learning with execution logs and passive learning results is advocated.
References
Learning regular sets from queries and counterexamples
TL;DR: In this article, the problem of identifying an unknown regular set from examples of its members and nonmembers is addressed, where the regular set is presented by a minimaMy adequate teacher, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not.
•Book
Process Mining: Data Science in Action
Wil M. P. van der Aalst
- 20 Apr 2016
TL;DR: This is the second edition of Wil van der Aalsts seminal book on process mining, which now discusses the field also in the broader context of data science and big data approaches.
1.4K
Related Papers (5)
Sumit Mahapatra,Subhankar Mishra,Subhankar Mishra +2 more
- 01 Jan 2020
Iulian Neamtiu,Pamela Bhattacharya +1 more
- 01 Jan 2012