AI Article Synopsis

  • - The MDUP hypersphere method is a new binary classification approach for analyzing high-dimensional clinical data, addressing limitations of existing algorithms that miss important information while handling multiple variables.
  • - This method creates collections of hyperspheres in a high-dimensional space by iteratively adding spheres at the most distant uncovered points, effectively mapping the region of interest, and it was tested on a cardiovascular model involving 35.8 million points.
  • - Results show that while the method can generate many smaller hyperspheres near boundaries of feasible areas, it has a quadratic runtime, indicating potential inefficiencies due to its current non-parallelized implementation.

Article Abstract

Background: Physiological modelling often involves models described by large numbers of variables and significant volumes of clinical data. Mathematical interpretation of such models frequently necessitates analysing data points in high-dimensional spaces. Existing algorithms for analysing high-dimensional points either lose important dimensionality or do not describe the full position of points. Hence, there is a need for an algorithm which preserves this information.

Methods: The most-distant uncovered point (MDUP) hypersphere method is a binary classification approach which defines a collection of equidistant N-dimensional points as the union of hyperspheres. The method iteratively generates hyperspheres at the most distant point in the interest region not yet contained within any hypersphere, until the entire region of interest is defined by the union of all generated hyperspheres. This method is tested on a 7-dimensional space with up to 35.8 million points representing feasible and infeasible spaces of model parameters for a clinically validated cardiovascular system model.

Results: For different numbers of input points, the MDUP hypersphere method tends to generate large spheres away from the boundary of feasible and infeasible points, but generates the greatest number of relatively much smaller spheres around the boundary of the region of interest to fill this space. Runtime scales quadratically, in part because the current MDUP implementation is not parallelised.

Conclusions: The MDUP hypersphere method can define points in a space of any dimension using only a collection of centre points and associated radii, making the results easily interpretable. It can identify large continuous regions, and in many cases capture the general structure of a region in only a relative few hyperspheres. The MDUP method also shows promise for initialising optimisation algorithm starting conditions within pre-defined feasible regions of model parameter spaces, which could improve model identifiability and the quality of optimisation results.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11004565PMC
http://dx.doi.org/10.1016/j.heliyon.2024.e28822DOI Listing

Publication Analysis

Top Keywords

hypersphere method
16
mdup hypersphere
12
points
9
hyperspheres method
8
region interest
8
feasible infeasible
8
spheres boundary
8
method
7
hypersphere
5
mdup
5

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!