Результаты исследований: Глава в книге, отчете, сборнике статей › Материалы конференции › Рецензирование
Результаты исследований: Глава в книге, отчете, сборнике статей › Материалы конференции › Рецензирование
}
TY - GEN
T1 - An Optimal Algorithm for Finding the Spectrum of the Joint Action of Binary Factors
AU - Nagrebetskaya, Julia
AU - Panov, Vladimir
AU - Vasilko, Ekaterina
PY - 2023/5/15
Y1 - 2023/5/15
N2 - The paper describes an effective algorithm for calculating the spectrum of joint action (interaction) of binary factors in a binary response. The spectrum of joint action allows us to determine the presence/absence of interaction of factors (Boolean variables) in a given response (Boolean function), as well as todetermine the strength of this interaction described by the degree of joint action concept. The need to calculate these characteristics of joint action is obvious in itself, and it is also relevant to the theory of sufficient causes, which is the basic concept of causality in the medical and biological sciences. The paper shows thatthe proposed algorithm, given its implementation, is optimal in terms of time complexity among all algorithms that compute the spectrum of joint action by definition. Some new theoretical results were obtained and utilised for creation of this algorithm. The proposed implementation uses data parsing, representation of Boolean vectors as decimal numbers and application of bitwiseoperations to them. It is shown that for this algorithm the time complexity is O(6n ), where n is the number of binary factors.
AB - The paper describes an effective algorithm for calculating the spectrum of joint action (interaction) of binary factors in a binary response. The spectrum of joint action allows us to determine the presence/absence of interaction of factors (Boolean variables) in a given response (Boolean function), as well as todetermine the strength of this interaction described by the degree of joint action concept. The need to calculate these characteristics of joint action is obvious in itself, and it is also relevant to the theory of sufficient causes, which is the basic concept of causality in the medical and biological sciences. The paper shows thatthe proposed algorithm, given its implementation, is optimal in terms of time complexity among all algorithms that compute the spectrum of joint action by definition. Some new theoretical results were obtained and utilised for creation of this algorithm. The proposed implementation uses data parsing, representation of Boolean vectors as decimal numbers and application of bitwiseoperations to them. It is shown that for this algorithm the time complexity is O(6n ), where n is the number of binary factors.
UR - http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85164920757
U2 - 10.1109/USBEREIT58508.2023.10158845
DO - 10.1109/USBEREIT58508.2023.10158845
M3 - Conference contribution
SP - 198
EP - 201
BT - Proceedings - 2023 IEEE Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology, USBEREIT 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 IEEE Ural-Siberian Conference on Biomedical Engineering, Radioelectronics and Information Technology (USBEREIT)
Y2 - 15 May 2023 through 17 May 2023
ER -
ID: 41993716