Standard

On constructing functional dependencies from non-enclosing interval data. / Shary, S. P.; Zvyagin, M. A.

в: Journal of Computational Technologies, Том 29, № 4, 2024, стр. 71-94.

Результаты исследований: Научные публикации в периодических изданияхстатьяРецензирование

Harvard

Shary, SP & Zvyagin, MA 2024, 'On constructing functional dependencies from non-enclosing interval data', Journal of Computational Technologies, Том. 29, № 4, стр. 71-94. https://doi.org/10.25743/ICT.2024.29.4.006

APA

Vancouver

Shary SP, Zvyagin MA. On constructing functional dependencies from non-enclosing interval data. Journal of Computational Technologies. 2024;29(4):71-94. doi: 10.25743/ICT.2024.29.4.006

Author

Shary, S. P. ; Zvyagin, M. A. / On constructing functional dependencies from non-enclosing interval data. в: Journal of Computational Technologies. 2024 ; Том 29, № 4. стр. 71-94.

BibTeX

@article{2a43b87cc7e041a69092994c58e467c6,
title = "On constructing functional dependencies from non-enclosing interval data",
abstract = "The purpose of the paper is to present a simple and natural approach to reconstructing linear functional dependencies from non-enclosing data with interval uncertainty. It denotes interval data that is not guaranteed to contain the true values of the measured quantities, and therefore must be processed significantly differently than interval data that is certain to contain true values (enclosing). From the very definition of non-enclosing interval data it follows that they should be considered, rather, as integral objects without any internal structure, since it does not make sense for their point elements to require satisfaction of two-sided interval constraints, etc. For this reason, the construction of functional dependencies from non-enclosing interval data should be performed on the basis of approaches that find the best approximation of the intervals under consideration without resorting to their internal content. This can be done, for example, using the approximation theory. In the present study, solving the line fitting problem is reduced to finding the minimum deviation of the graph of the constructed function from the interval data boxes. The properties of the deviation functional for the most popular vector norms, which can be used to determine the distance between points, are investigated. It is shown that, under some conditions on the norm, the deviation functional is a convex polyhedral function. Its minimum can be efficiently found using existing non-smooth optimization methods. In particular, the paper presents a free program implemented by the authors for computing this minimum. In conclusion, the work provides numerical examples demonstrating the behavior of the new technique in various situations, as well as its comparison with methods for solving the problem of line fitting from enclosing interval data. Finally, correlations with methods of Symbolic Data Analysis are discussed in detail.",
keywords = "data fitting problem, enclosing measurements, interval, interval data analysis, method of direct interval approximation, non-enclosing measurements",
author = "Shary, {S. P.} and Zvyagin, {M. A.}",
note = "Шарый С.П., Звягин М.А. О восстановлении функциональных зависимостей по ненакрывающим интервальным данным // Вычислительные технологии. - 2024. - Т. 29. - № 4. - С. 71-94.",
year = "2024",
doi = "10.25743/ICT.2024.29.4.006",
language = "English",
volume = "29",
pages = "71--94",
journal = "Вычислительные технологии",
issn = "1560-7534",
publisher = " Издательский центр Института вычислительных технологий СО РАН",
number = "4",

}

RIS

TY - JOUR

T1 - On constructing functional dependencies from non-enclosing interval data

AU - Shary, S. P.

AU - Zvyagin, M. A.

N1 - Шарый С.П., Звягин М.А. О восстановлении функциональных зависимостей по ненакрывающим интервальным данным // Вычислительные технологии. - 2024. - Т. 29. - № 4. - С. 71-94.

PY - 2024

Y1 - 2024

N2 - The purpose of the paper is to present a simple and natural approach to reconstructing linear functional dependencies from non-enclosing data with interval uncertainty. It denotes interval data that is not guaranteed to contain the true values of the measured quantities, and therefore must be processed significantly differently than interval data that is certain to contain true values (enclosing). From the very definition of non-enclosing interval data it follows that they should be considered, rather, as integral objects without any internal structure, since it does not make sense for their point elements to require satisfaction of two-sided interval constraints, etc. For this reason, the construction of functional dependencies from non-enclosing interval data should be performed on the basis of approaches that find the best approximation of the intervals under consideration without resorting to their internal content. This can be done, for example, using the approximation theory. In the present study, solving the line fitting problem is reduced to finding the minimum deviation of the graph of the constructed function from the interval data boxes. The properties of the deviation functional for the most popular vector norms, which can be used to determine the distance between points, are investigated. It is shown that, under some conditions on the norm, the deviation functional is a convex polyhedral function. Its minimum can be efficiently found using existing non-smooth optimization methods. In particular, the paper presents a free program implemented by the authors for computing this minimum. In conclusion, the work provides numerical examples demonstrating the behavior of the new technique in various situations, as well as its comparison with methods for solving the problem of line fitting from enclosing interval data. Finally, correlations with methods of Symbolic Data Analysis are discussed in detail.

AB - The purpose of the paper is to present a simple and natural approach to reconstructing linear functional dependencies from non-enclosing data with interval uncertainty. It denotes interval data that is not guaranteed to contain the true values of the measured quantities, and therefore must be processed significantly differently than interval data that is certain to contain true values (enclosing). From the very definition of non-enclosing interval data it follows that they should be considered, rather, as integral objects without any internal structure, since it does not make sense for their point elements to require satisfaction of two-sided interval constraints, etc. For this reason, the construction of functional dependencies from non-enclosing interval data should be performed on the basis of approaches that find the best approximation of the intervals under consideration without resorting to their internal content. This can be done, for example, using the approximation theory. In the present study, solving the line fitting problem is reduced to finding the minimum deviation of the graph of the constructed function from the interval data boxes. The properties of the deviation functional for the most popular vector norms, which can be used to determine the distance between points, are investigated. It is shown that, under some conditions on the norm, the deviation functional is a convex polyhedral function. Its minimum can be efficiently found using existing non-smooth optimization methods. In particular, the paper presents a free program implemented by the authors for computing this minimum. In conclusion, the work provides numerical examples demonstrating the behavior of the new technique in various situations, as well as its comparison with methods for solving the problem of line fitting from enclosing interval data. Finally, correlations with methods of Symbolic Data Analysis are discussed in detail.

KW - data fitting problem

KW - enclosing measurements

KW - interval

KW - interval data analysis

KW - method of direct interval approximation

KW - non-enclosing measurements

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85202047086&origin=inward&txGid=ddcf37bdcdbc647e444957c6f67e64d3

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85202047086&origin=inward&txGid=ddcf37bdcdbc647e444957c6f67e64d3

UR - https://www.mendeley.com/catalogue/adebc6b3-6b66-3478-bf25-4bb8625c3559/

U2 - 10.25743/ICT.2024.29.4.006

DO - 10.25743/ICT.2024.29.4.006

M3 - Article

VL - 29

SP - 71

EP - 94

JO - Вычислительные технологии

JF - Вычислительные технологии

SN - 1560-7534

IS - 4

ER -

ID: 60462616