Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Meir Kalech has a total of 89 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Code Smells Thresholds Optimization: Defect Prediction as a Case Study

    by Tom Mashiach, Gilad Katz, Meir Kalech

    In software engineering, detecting and managing code smells are pivotal for maintaining software quality and reducing the risk of defects. Code smells signify potential issues in code that, while not problematic in themselves, may indicate deeper design flaws or future complications. Traditional code smells detection methods, which compare code metrics against fixed or statistically derived thresholds, may not always yield the most accurate code smells relevant to specific software practices. Addressing this gap, this research introduces an innovative methodology that utilizes a neural threshold generator, trained via a cooperative critic, to dynamically generate threshold values for detecting code smells in software components. Although the critic is conceptually related to the discriminator in a Generative Adversarial Network (GAN), its training objective is aligned with rather than adversarial to that of the generator. By integrating relevant code metrics, the proposed model generates customized thresholds for each software component. Our current evaluation focuses on a set of 11 class-level code smells defined by single or AND-connected conditions. It then uses these thresholds to identify code smells, which serve as input features to train a defect prediction model. A key feature of our approach is a cooperative-critic feedback mechanism that continuously refines the thresholds based on the defect prediction outcomes, ensuring the model’s effectiveness in identifying potential software issues is consistently improved. This advanced approach has demonstrated superior defect prediction performance, as evidenced by improved metrics such as the F1-score, AUC-ROC, and AUC-PRC, compared with the results of a defect prediction model that uses the traditional thresholds. Our study underscores the effectiveness of generating context-specific thresholds through neural networks, suggesting a promising avenue for exploring related software practices.

  • Open Access

    Beating the Page Limit: Minimizing the Size of Documents

    by Inbal Roshanski, Tal Abraham, Michal Alhindi, Lidor Ashtamker, Or Fuchs, Adi Toris, Amit Witkowski, Lidor Zur, Meir Kalech

    Compilation-based text editors, such as Overleaf for enable users to insert text alongside commands, which are then compiled into a formatted document such as a PDF. A major drawback of these editors is the inability to preview the final document layout without compiling. Consequently, users often resort to trial-and-error methods to condense documents to meet space constraints, making changes in the text editor and repeatedly compiling to check whether the document fits the required space. In addition, space-saving modifications may compromise the readability of the document. For example, reducing the size of a figure by 50% can render it unreadable. In this paper, we formally define the problem of optimizing document layout to fit space constraints while minimizing the magnitude of layout modifications and thereby reducing the likelihood of harming readability. To address this challenge, we propose an automated decision-support system that employs machine learning models to estimate the space saved by specific adjustments. This system provides recommendations for modifications that optimize space usage while favoring smaller geometric changes, with final readability and layout quality verified separately. To evaluate the quality and real-world applicability of our algorithms, we conducted extensive experiments. First, we tested our algorithms on a dataset of 329,000 generated files, achieving improved reductions in document length compared with baseline heuristics. To assess applicability to real-world scenarios, we further evaluated our algorithms on 140 articles accepted to AAAI and obtained from arXiv. These experiments show that, in this benchmark setting, the proposed method achieves the best observed performance among the compared approaches, with moderate but consistent improvements over simpler methods and heuristics.

  • Open Access

    Spectrum-based fault diagnosis with partial traces

    by Bruno Sotto-Mayor, Roni Stern, Meir Kalech


  • Open Access

    Marine radar target detection in a noisy environment using rings-based convolutional neural network

    by Ido Tam, Yehonatan Zadok, Eli Mozeson, Meir Kalech

    The detection of small maritime targets by radar demands particular attention due to the challenge of distinguishing them within noisy environments. With advancements in machine learning (ML), several studies have explored integrating ML models to replace or enhance traditional radar target detection methods. In this research, we explore the integration of ML with airborne radar for maritime target detection, a domain that, to the best of our knowledge, has not been addressed in existing studies. We introduce an approach that uniquely applies ML as a secondary stage to enhance detection in scenarios where traditional methods prove insufficient. In this paper, we propose two deep-learning models aimed at improving real-time detection of small marine targets using airborne radar systems. The first model is a Convolutional Neural Network (CNN) designed to handle low-height, highly asymmetrical input dimensions (AsymCNN) adapted to classify small targets and spikes from Range-Doppler ( R / D ) maps. The second, a novel Rings-based Convolutional Neural Network (RbCNN) developed for this research, extends the AsymCNN architecture, optimizing it for cylindrical input data such as R / D maps. To evaluate our method, we used raw radar signal data collected from airborne radar systems operating over the sea. Each signal is represented using two components, in-phase and quadrature ( I / Q ) samples, which together capture both the amplitude and phase characteristics of the signal. We demonstrate that our architectures, AsymCNN and RbCNN, outperform traditional detection methods, Resnet and Densenet, in distinguishing small marine targets from spikes.


  • Open Access

    A Survey on Transfer Learning for Cross-Project Defect Prediction

    by Bruno Sotto-Mayor, Meir Kalech

    Software defect prediction involves predicting which components in a software program, like classes or functions, are likely to have defects, based on metrics that describe those components. Cross-project defect prediction is a type of defect prediction where, due to not enough labeled defect data for the target project, the model is trained on data from other projects to predict defects in the target project. Within cross-project defect prediction, several transfer learning techniques have been proposed, whose goal is to transfer knowledge from a source to a target domain. Although there is a collection of comprehensive surveys on cross-project defect prediction, no study surveyed the cross-project defect prediction approaches through the lens of a transfer learning algorithm design framework. The contribution of this survey is twofold: it establishes a taxonomy for transfer learning approaches and surveys 44 cross-project defect prediction methods, analyzing and organizing each paper according to those categories. Ultimately, this survey provides a new perspective on how transfer learning approaches are employed in cross-project defect prediction and opens new research directions for the application of transfer learning for cross-project defect prediction.


  • Open Access

    Multi-Agent Planning and Diagnosis with Commonsense Reasoning

    by Tran Cao Son, William Yeoh, Roni Stern, Meir Kalech

    In multi-agent systems, multi-agent planning and diagnosis are two key subfields – multi-agent planning approaches identify plans for the agents to execute in order to reach their goals, and multi-agent diagnosis approaches identify root causes for faults when they occur, typically by using information from the multi-agent planning model as well as the resulting multi-agent plan. However, when a plan fails during execution, the cause can often be related to some commonsense information that is neither explicitly encoded in the planning nor diagnosis problems. As such existing diagnosis approaches fail to accurately identify the root causes in such situations. To remedy this limitation, we extend the Multi-Agent STRIPS problem (a common multi-agent planning framework) to a Commonsense Multi-Agent STRIPS model, which includes commonsense fluents and axioms that may affect the classical planning problem. We show that a solution to a (classical) Multi-Agent STRIPS problem is also a solution to the commonsense variant of the same problem. Then, we propose a decentralized multi-agent diagnosis algorithm, which uses the commonsense information to diagnose faults when they occur during execution. Finally, we demonstrate the feasibility and promise of this approach on several key multi-agent planning benchmarks.


  • Open Access

    Diagnosis for Post Concept Drift Decision Trees Repair

    by Shaked Almog, Meir Kalech

    Decision trees are commonly used in machine learning since they are accurate and robust classifiers. After a decision tree is built, the data can change over time, causing the classification perfor...

  • Open Access

    Distributed Spectrum-Based Fault Localization

    by Avraham Natan, Roni Stern, Meir Kalech

    Spectrum-Based Fault Localization (SFL) is a popular approach for diagnosing faulty systems. SFL algorithms are inherently centralized, where observations are collected and analyzed by a single diagnoser. Applying SFL to diagnose distributed systems is challenging, especially when communication is costly and there are privacy concerns. We propose two SFL-based algorithms that are designed for distributed systems: one for diagnosing a single faulty component and one for diagnosing multiple faults. We analyze these algorithms theoretically and empirically. Our analysis shows that the distributed SFL algorithms we developed output identical diagnoses to centralized SFL while preserving privacy.