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

2026-02-17 · Volodymyr Yuzefovych arxiv

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.

📄 PDF Abstract BibTeX arXiv:2604.04939

Code (0)

등록된 구현이 없습니다.

An optimal hierarchical clustering approach to segmentation of mobile LiDAR point clouds

2017-03-06 · Sheng Xu, Ruisheng Wang, Han Zheng

This paper proposes a hierarchical clustering approach for the segmentation of mobile LiDAR point clouds. We perform the hierarchical clustering on unorganized point clouds based on a proximity matrix. The dissimilarity …

Clustering Point Cloud Segmentation Segmentation

Learning Human-Object Interaction as Groups

2025-10-21 · Jiajun Hong, Jianan Wei, Wenguan Wang arxiv

Human-Object Interaction Detection (HOI-DET) aims to localize human-object pairs and identify their interactive relationships. To aggregate contextual cues, existing methods typically propagate information across all det…

Human-Object Interaction Detection Semantic Similarity

Complex-valued embeddings of generic proximity data

2020-08-31 · Maximilian Münch, Michiel Straat, Michael Biehl, Frank-Michael Schleif

Proximities are at the heart of almost all machine learning methods. If the input data are given as numerical vectors of equal lengths, euclidean distance, or a Hilbertian inner product is frequently used in modeling alg…

BIG-bench Machine Learning Generalization Bounds

DISCOMAX: A Proximity-Preserving Distance Correlation Maximization Algorithm

2013-06-11 · Praneeth Vepakomma, Ahmed Elgammal

In a regression setting we propose algorithms that reduce the dimensionality of the features while simultaneously maximizing a statistical measure of dependence known as distance correlation between the low-dimensional f…

regression

Dual Graph Embedding for Object-Tag LinkPrediction on the Knowledge Graph

2020-07-16 · Chenyang Li, Xu Chen, Ya zhang, Siheng Chen 외

Knowledge graphs (KGs) composed of users, objects, and tags are widely used in web applications ranging from E-commerce, social media sites to news portals. This paper concentrates on an attractive application which aims…

Decoder Entity Embeddings Graph Embedding Knowledge Graphs+3