• Deutsch
Login

Open Access

  • Home
  • Search
  • Browse
  • Publish
  • FAQ
Schließen

Refine

Author

  • Herbold, Steffen (5)
  • Trautsch, Alexander (3)
  • Grabowski, Jens (2)
  • Erbel, Johannes (1)
  • Hautli‑Janisz, Annette (1)
  • Heuer, Ute (1)
  • Kikteva, Zlata (1)
  • Ledel, Benjamin (1)
  • Schulte, Lukas (1)
  • Tunkel, Steffen (1)
+ more

Year of publication

  • 2024 (1)
  • 2023 (3)

Document Type

  • Article (5)

Language

  • English (5)

Has Fulltext

  • yes (5)

Is part of the Bibliography

  • no (5)

Keywords

  • Quality evolution (2)
  • Software metrics (2)
  • Software quality (2)
  • Static code analysis (2)
  • Differential testing (1)
  • Explainable AI (1)
  • Issue type prediction (1)
  • LIME (1)
  • Machine learning (1)
  • SHAP (1)
+ more

Institute

  • Fakultät für Informatik und Mathematik (5)

5 search hits

  • 1 to 5
  • BibTeX
  • CSV
  • RIS
  • XML
  • 10
  • 20
  • 50
  • 100

Sort by

  • Year
  • Year
  • Title
  • Title
  • Author
  • Author
Differential testing for machine learning: an analysis for classification algorithms beyond deep learning (2023)
Herbold, Steffen ; Tunkel, Steffen
Differential testing is a useful approach that uses different implementations of the same algorithms and compares the results for software testing. In recent years, this approach was successfully used for test campaigns of deep learning frameworks. There is little knowledge about the application of differential testing beyond deep learning. Within this article, we want to close this gap for classification algorithms. We conduct a case study using Scikit-learn, Weka, Spark MLlib, and Caret in which we identify the potential of differential testing by considering which algorithms are available in multiple frameworks, the feasibility by identifying pairs of algorithms that should exhibit the same behavior, and the effectiveness by executing tests for the identified pairs and analyzing the deviations. While we found a large potential for popular algorithms, the feasibility seems limited because, often, it is not possible to determine configurations that are the same in other frameworks. The execution of the feasible tests revealed that there is a large number of deviations for the scores and classes. Only a lenient approach based on statistical significance of classes does not lead to a huge amount of test failures. The potential of differential testing beyond deep learning seems limited for research into the quality of machine learning libraries. Practitioners may still use the approach if they have deep knowledge about implementations, especially if a coarse oracle that only considers significant differences of classes is sufficient.
A large‑scale comparison of human‑written versus ChatGPT‑generated essays ()
Herbold, Steffen ; Hautli‑Janisz, Annette ; Heuer, Ute ; Kikteva, Zlata ; Trautsch, Alexander
ChatGPT and similar generative AI models have attracted hundreds of millions of users and have become part of the public discourse. Many believe that such models will disrupt society and lead to significant changes in the education system and information generation. So far, this belief is based on either colloquial evidence or benchmarks from the owners of the models—both lack scientific rigor. We systematically assess the quality of AI-generated content through a large-scale study comparing human-written versus ChatGPT-generated argumentative student essays. We use essays that were rated by a large number of human experts (teachers). We augment the analysis by considering a set of linguistic characteristics of the generated essays. Our results demonstrate that ChatGPT generates essays that are rated higher regarding quality than human-written essays. The writing style of the AI models exhibits linguistic characteristics that are different from those of the human-written essays. Since the technology is readily available, we believe that educators must act immediately. We must re-invent homework and develop teaching concepts that utilize these AI models in the same way as math utilizes the calculator: teach the general concepts first and then use AI tools to free up time for other learning objectives.
What really changes when developers intend to improve their source code: a commit-level study of static metric value and static analysis warning changes (2023)
Trautsch, Alexander ; Erbel, Johannes ; Herbold, Steffen ; Grabowski, Jens
Are automated static analysis tools worth it? An investigation into relative warning density and external software quality on the example of Apache open source projects (2023)
Trautsch, Alexander ; Herbold, Steffen ; Grabowski, Jens
Automated Static Analysis Tools (ASATs) are part of software development best practices. ASATs are able to warn developers about potential problems in the code. On the one hand, ASATs are based on best practices so there should be a noticeable effect on software quality. On the other hand, ASATs suffer from false positive warnings, which developers have to inspect and then ignore or mark as invalid. In this article, we ask whether ASATs have a measurable impact on external software quality, using the example of PMD for Java. We investigate the relationship between ASAT warnings emitted by PMD on defects per change and per file. Our case study includes data for the history of each file as well as the differences between changed files and the project in which they are contained. We investigate whether files that induce a defect have more static analysis warnings than the rest of the project. Moreover, we investigate the impact of two different sets of ASAT rules. We find that, bug inducing files contain less static analysis warnings than other files of the project at that point in time. However, this can be explained by the overall decreasing warning density. When compared with all other changes, we find a statistically significant difference in one metric for all rules and two metrics for a subset of rules. However, the effect size is negligible in all cases, showing that the actual difference in warning density between bug inducing changes and other changes is small at best.
Studying the explanations for the automated prediction of bug and non-bug issues using LIME and SHAP (2024)
Schulte, Lukas ; Ledel, Benjamin ; Herbold, Steffen
Context The identification of bugs within issues reported to an issue tracking system is crucial for triage. Machine learning models have shown promising results for this task. However, we have only limited knowledge of how such models identify bugs. Explainable AI methods like LIME and SHAP can be used to increase this knowledge. Objective We want to understand if explainable AI provides explanations that are reasonable to us as humans and align with our assumptions about the model’s decision-making. We also want to know if the quality of predictions is correlated with the quality of explanations. Methods We conduct a study where we rate LIME and SHAP explanations based on their quality of explaining the outcome of an issue type prediction model. For this, we rate the quality of the explanations, i.e., if they align with our expectations and help us understand the underlying machine learning model. Results We found that both LIME and SHAP give reasonable explanations and that correct predictions are well explained. Further, we found that SHAP outperforms LIME due to a lower ambiguity and a higher contextuality that can be attributed to the ability of the deep SHAP variant to capture sentence fragments. Conclusion We conclude that the model finds explainable signals for both bugs and non-bugs. Also, we recommend that research dealing with the quality of explanations for classification tasks reports and investigates rater agreement, since the rating of explanations is highly subjective.
  • 1 to 5

DINI-Zertifikat     OPUS4 Logo

  • Contact
  • Imprint
  • Sitelinks