ArticleComputers in biology and medicine2020
A partition-based optimization model and its performance benchmark for Generative Anatomy Modeling Language.
Article in Computers in biology and medicine, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
Abstract
backgroundThis paper presents a novel iterative approach and rigorous accuracy testing for geometry modeling language - a Partition-based Optimization Model for Generative Anatomy Modeling Language (POM-GAML). POM-GAML is designed to model and create anatomical structures and their variations by satisfying any imposed geometric constraints using a non-linear optimization model. Model partitioning of POM-GAML creates smaller sub-problems of the original model to reduce the exponential execution time required to solve the constraints in linear time with a manageable error.
methodWe analyzed our model concerning the iterative approach and graph parameters for different constraint hierarchies. The iteration was used to reduce the error for partitions and solve smaller sub-problems generated by various clustering/community detection algorithms. We empirically tested our model with eleven graph parameters. Graphs for each parameter with increasing constraint sets were generated to evaluate the accuracy of our method.
resultsThe average decrease in normalized error with respect to the original problem using cluster/community detection algorithms for constraint sets was above 63.97%. The highest decrease in normalized error after five iterations for the constraint set of 3900 was 70.31%, while the lowest decrease for the constraint set of 3000 was with 63.97%. Pearson correlation analysis between graph parameters and normalized error was carried out. We identified that graph parameters such as diameter, average eccentricity, global efficiency, and average local efficiency showed strong correlations to the normalized error.
conclusionsWe observed that iteration monotonically decreases the error in all experiments. Our iteration results showed decreased normalized error using the partitioned constrained optimization by linear approximation to the non-linear optimization model.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.