Proximity Measure of Information Object Features for Solving the Problem of Their Identification in Information Systems

• URL: http://arxiv.org/abs/2604.04939v1
• Date: Tue, 17 Feb 2026 19:10:18 GMT
• Title: Proximity Measure of Information Object Features for Solving the Problem of Their Identification in Information Systems
• Abstract summary: The paper considers a new quantitative-qualitative proximity measure for the features of information objects.<n>The goal is to determine the possibility of their relation to the same physical object (observation object)
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The paper considers a new quantitative-qualitative proximity measure for the features of information objects, where data enters a common information resource from several sources independently. The goal is to determine the possibility of their relation to the same physical object (observation object). The proposed measure accounts for the possibility of differences in individual feature values - both quantitative and qualitative - caused by existing determination errors. To analyze the proximity of quantitative feature values, the author employs a probabilistic measure; for qualitative features, a measure of possibility is used. The paper demonstrates the feasibility of the proposed measure by checking its compliance with the axioms required of any measure. Unlike many known measures, the proposed approach does not require feature value transformation to ensure comparability. The work also proposes several variants of measures to determine the proximity of information objects (IO) based on a group of diverse features.

Related papers

• Computational Identifiability [58.12019389497595]
  'Identical identifiability' assumes properties, infinite data, or other mathematically idealized conditions.<n>'Computational identifiability' is to instead define a finite computational search procedure for an empirical estimator.<n>We show how this framework allows us to answer fine-grained, practical identification questions.
  arXiv  Detail & Related papers  (2026-06-08T19:39:59Z)
• Dynamic Feature Selection from Variable Feature Sets Using Features of Features [24.668942936732083]
  We propose a new problem setting for Dynamic Feature Selection (DFS) with variable feature sets.<n>We show that the proposed method effectively selects features based on the prior information, even when the set of measurable features changes from instance to instance.
  arXiv  Detail & Related papers  (2025-03-12T09:13:21Z)
• Feature Importance Depends on Properties of the Data: Towards Choosing the Correct Explanations for Your Data and Decision Trees based Models [3.8246193345000226]
  We assess the quality of feature importance estimates provided by local explanation methods.<n>We find notable disparities in the magnitude and sign of the feature importance estimates generated by these methods.<n>Our assessment highlights these limitations and provides valuable insight into the suitability and reliability of different explanatory methods.
  arXiv  Detail & Related papers  (2025-02-11T00:29:55Z)
• Size-invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection [133.66006666465447]
  Current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. We develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes.
  arXiv  Detail & Related papers  (2024-05-16T03:01:06Z)
• Second-Order Uncertainty Quantification: Variance-Based Measures [2.3999111269325266]
  This paper proposes a novel way to use variance-based measures to quantify uncertainty on the basis of second-order distributions in classification problems. A distinctive feature of the measures is the ability to reason about uncertainties on a class-based level, which is useful in situations where nuanced decision-making is required.
  arXiv  Detail & Related papers  (2023-12-30T16:30:52Z)
• On the Properties and Estimation of Pointwise Mutual Information Profiles [49.877314063833296]
  The pointwise mutual information profile, or simply profile, is the distribution of pointwise mutual information for a given pair of random variables. We introduce a novel family of distributions, Bend and Mix Models, for which the profile can be accurately estimated using Monte Carlo methods.
  arXiv  Detail & Related papers  (2023-10-16T10:02:24Z)
• Uncertainty Calibration and its Application to Object Detection [0.0]
  In this work, we examine the semantic uncertainty (which object type?) as well as the spatial uncertainty. We evaluate if the predicted uncertainties of an object detection model match with the observed error that is achieved on real-world data.
  arXiv  Detail & Related papers  (2023-02-06T08:41:07Z)
• Learning Conditional Invariance through Cycle Consistency [60.85059977904014]
  We propose a novel approach to identify meaningful and independent factors of variation in a dataset. Our method involves two separate latent subspaces for the target property and the remaining input information. We demonstrate on synthetic and molecular data that our approach identifies more meaningful factors which lead to sparser and more interpretable models.
  arXiv  Detail & Related papers  (2021-11-25T17:33:12Z)
• CertainNet: Sampling-free Uncertainty Estimation for Object Detection [65.28989536741658]
  Estimating the uncertainty of a neural network plays a fundamental role in safety-critical settings. In this work, we propose a novel sampling-free uncertainty estimation method for object detection. We call it CertainNet, and it is the first to provide separate uncertainties for each output signal: objectness, class, location and size.
  arXiv  Detail & Related papers  (2021-10-04T17:59:31Z)
• Ranking the information content of distance measures [61.754016309475745]
  We introduce a statistical test that can assess the relative information retained when using two different distance measures. This in turn allows finding the most informative distance measure out of a pool of candidates.
  arXiv  Detail & Related papers  (2021-04-30T15:57:57Z)
• TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions [0.0]
  Total cumulative mutual information (TCMI) is a measure of the relevance of mutual dependences. TCMI is a non-parametric, robust, and deterministic measure that facilitates comparisons and rankings between feature sets.
  arXiv  Detail & Related papers  (2020-01-30T08:42:25Z)

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.