Extended Isolation Forest with feature sensitivities

• URL: http://arxiv.org/abs/2602.09704v1
• Date: Tue, 10 Feb 2026 12:03:15 GMT
• Title: Extended Isolation Forest with feature sensitivities
• Authors: Illia Donhauzer,
• Abstract summary: This paper introduces an Extended Isolation Forest with feature sensitivities, which we refer to as the Anisotropic Isolation Forest (AIF)<n>The AIF enables anomaly detection with controllable sensitivity to deviations in different features or directions in the feature space.<n>We demonstrate the performance of the algorithm by applying it to synthetic and real-world datasets.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Compared to theoretical frameworks that assume equal sensitivity to deviations in all features of data, the theory of anomaly detection allowing for variable sensitivity across features is less developed. To the best of our knowledge, this issue has not yet been addressed in the context of isolation-based methods, and this paper represents the first attempt to do so. This paper introduces an Extended Isolation Forest with feature sensitivities, which we refer to as the Anisotropic Isolation Forest (AIF). In contrast to the standard EIF, the AIF enables anomaly detection with controllable sensitivity to deviations in different features or directions in the feature space. The paper also introduces novel measures of directional sensitivity, which allow quantification of AIF's sensitivity in different directions in the feature space. These measures enable adjustment of the AIF's sensitivity to task-specific requirements. We demonstrate the performance of the algorithm by applying it to synthetic and real-world datasets. The results show that the AIF enables anomaly detection that focuses on directions in the feature space where deviations from typical behavior are more important.

Related papers

• Sensor Generalization for Adaptive Sensing in Event-based Object Detection via Joint Distribution Training [18.51701989107632]
  Bio-inspired event cameras have recently attracted significant research due to their asynchronous and low-latency capabilities.<n>There is a gap in the variability of available data and a lack of extensive analysis of the parameters characterizing their signals.<n>This paper addresses these issues by providing readers with an in-depth understanding of how intrinsic parameters affect the performance of a model trained on event data, specifically for object detection.
  arXiv  Detail & Related papers  (2026-02-26T18:57:52Z)
• Reason-IAD: Knowledge-Guided Dynamic Latent Reasoning for Explainable Industrial Anomaly Detection [85.29900916231655]
  Reason-IAD is a knowledge-guided dynamic latent reasoning framework for explainable industrial anomaly detection.<n>Experiments demonstrate that Reason-IAD consistently outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-02-10T14:54:17Z)
• Efficient Test-time Adaptive Object Detection via Sensitivity-Guided Pruning [73.40364018029673]
  Continual test-time adaptive object detection (CTTA-OD) aims to online adapt a source pre-trained detector to ever-changing environments.<n>Our motivation stems from the observation that not all learned source features are beneficial.<n>Our method achieves superior adaptation performance while reducing computational overhead by 12% in FLOPs.
  arXiv  Detail & Related papers  (2025-06-03T05:27:56Z)
• Crane: Context-Guided Prompt Learning and Attention Refinement for Zero-Shot Anomaly Detection [50.343419243749054]
  Anomaly detection is critical in fields such as medical diagnostics and industrial defect detection.<n> CLIP's coarse-grained image-text alignment limits localization and detection performance for fine-grained anomalies.<n>Crane improves the state-of-the-art ZSAD from 2% to 28%, at both image and pixel levels, while remaining competitive in inference speed.
  arXiv  Detail & Related papers  (2025-04-15T10:42:25Z)
• Unifying Perplexing Behaviors in Modified BP Attributions through Alignment Perspective [61.5509267439999]
  We present a unified theoretical framework for methods like GBP, RectGrad, LRP, and DTD.<n>We demonstrate that they achieve input alignment by combining the weights of activated neurons.<n>This alignment improves the visualization quality and reduces sensitivity to weight randomization.
  arXiv  Detail & Related papers  (2025-03-14T07:58:26Z)
• Uncertainty Representation in a SOTIF-Related Use Case with Dempster-Shafer Theory for LiDAR Sensor-Based Object Detection [0.0]
  Uncertainty in LiDAR sensor-based object detection arises from environmental variability and sensor performance limitations.<n>Dempster-Shafer Theory (DST) is employed to construct a Frame of Discernment (FoD) to represent detection outcomes.<n>Yager's Rule of Combination is used to resolve conflicting evidence from multiple sources.
  arXiv  Detail & Related papers  (2025-03-03T22:13:51Z)
• A new paradigm for global sensitivity analysis [0.0]
  Current theory of global sensitivity analysis is limited in scope-for instance, the analysis is limited to the output's variance. It is shown that these important problems are solved all at once by adopting a new paradigm.
  arXiv  Detail & Related papers  (2024-09-10T07:20:51Z)
• A Neural Framework for Generalized Causal Sensitivity Analysis [78.71545648682705]
  We propose NeuralCSA, a neural framework for causal sensitivity analysis. We provide theoretical guarantees that NeuralCSA is able to infer valid bounds on the causal query of interest.
  arXiv  Detail & Related papers  (2023-11-27T17:40:02Z)
• How are Prompts Different in Terms of Sensitivity? [50.67313477651395]
  We present a comprehensive prompt analysis based on the sensitivity of a function. We use gradient-based saliency scores to empirically demonstrate how different prompts affect the relevance of input tokens to the output. We introduce sensitivity-aware decoding which incorporates sensitivity estimation as a penalty term in the standard greedy decoding.
  arXiv  Detail & Related papers  (2023-11-13T10:52:01Z)
• A Sequentially Fair Mechanism for Multiple Sensitive Attributes [0.46040036610482665]
  In the standard use case of Algorithmic Fairness, the goal is to eliminate the relationship between a sensitive variable and a corresponding score. We propose a sequential framework, which allows to progressively achieve fairness across a set of sensitive features. Our approach seamlessly extends to approximate fairness, enveloping a framework accommodating the trade-off between risk and unfairness.
  arXiv  Detail & Related papers  (2023-09-12T22:31:57Z)
• Sequential Attention Source Identification Based on Feature Representation [88.05527934953311]
  This paper proposes a sequence-to-sequence based localization framework called Temporal-sequence based Graph Attention Source Identification (TGASI) based on an inductive learning idea. It's worth mentioning that the inductive learning idea ensures that TGASI can detect the sources in new scenarios without knowing other prior knowledge.
  arXiv  Detail & Related papers  (2023-06-28T03:00:28Z)
• Bayesian Autoencoders for Drift Detection in Industrial Environments [69.93875748095574]
  Autoencoders are unsupervised models which have been used for detecting anomalies in multi-sensor environments. Anomalies can come either from real changes in the environment (real drift) or from faulty sensory devices (virtual drift)
  arXiv  Detail & Related papers  (2021-07-28T10:19:58Z)
• Detecting Adversarial Examples from Sensitivity Inconsistency of Spatial-Transform Domain [17.191679125809035]
  adversarial examples (AEs) are maliciously designed to cause dramatic model output errors. In this work, we reveal that normal examples (NEs) are insensitive to the fluctuations occurring at the highly-curved region of the decision boundary. AEs typically designed over one single domain (mostly spatial domain) exhibit exorbitant sensitivity on such fluctuations.
  arXiv  Detail & Related papers  (2021-03-07T08:43:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.