Christian Marius Lillelund

Christian Marius Lillelund

Auto-generated profile, based on publicly available information

Christian Marius Lillelund

Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 June 2024 in IEEE Journal of Biomedical and Health Informatics
Verified
Journal Article
Closed access
CLChristian Marius Lillelund
Christian Marius Lillelund
MMMartin Magris
Martin Magris
CPChristian Fischer Pedersen
Christian Fischer Pedersen
Variational Inference (VI) is a commonly used technique for approximate Bayesian inference and uncertainty estimation in deep learning models, yet it comes at a computational cost, as it doubles the number of trainable parameters to represent uncertainty. This rapidly becomes challenging in high-dimensional settings and motivates the use of alternative techniques for inference, such as Monte Carlo Dropout (MCD) or Spectral-normalized Neural Gaussian Process (SNGP). However, such methods have seen little adoption in survival analysis, and VI remains the prevalent approach for training probabilistic neural networks. In this paper, we investigate how to train deep probabilistic survival models in large datasets without introducing additional overhead in model complexity. To achieve this, we adopt three probabilistic approaches, namely VI, MCD, and SNGP, and evaluate them in terms of their prediction performance, calibration performance, and model complexity. In the context of probabilistic survival analysis, we investigate whether non-VI techniques can offer comparable or possibly improved prediction performance and uncertainty calibration compared to VI. In the MIMIC-IV dataset, we find that MCD aligns with VI in terms of the concordance index (0.748 vs. 0.743) and mean absolute error (254.9 vs. 254.7) using hinge loss, while providing C-calibrated uncertainty estimates. Moreover, our SNGP implementation provides D-calibrated survival functions in all datasets compared to VI (4/4 vs. 2/4, respectively). Our work encourages the use of techniques alternative to VI for survival analysis in high-dimensional datasets, where computational efficiency and overhead are of concern.

3 February 2022 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
CLChristian Marius Lillelund
Christian Marius Lillelund
HJHenrik Bagger Jensen
Henrik Bagger Jensen
CPChristian Fischer Pedersen
Christian Fischer Pedersen

30 July 2024 in Journal of Public Health
Verified
Journal Article
Open access
PDF file
CLChristian Marius Lillelund
Christian Marius Lillelund
MHMichael Harbo
Michael Harbo
CPChristian Fischer Pedersen
Christian Fischer Pedersen
Aim: The present study has designed, implemented, and evaluated a machine learning model that can predict fall risk and fall occurrence in community-dwelling elderly based on their home care usage. Subjects and methods: A dataset consisting of 2542 weekly home care records for 1499 citizens (59% female, 41% male) with a mean age of 77 years (SD 10 years) was collected from a large municipality in Denmark. The data were recorded between January 1, 2021, and December 31, 2021. The dataset was divided into two cohorts. Subsequently, five machine learning-based survival analysis models were trained and evaluated using cross-validation. Results: The CoxBoost model showed the best discriminative performance with a mean 0.64 (95% CI 0.57–0.72) Harrell’s concordance index, indicating better ranking than chance-level by 14% on average. However, the model could not accurately predict when the next fall would take place. Conclusions: The proposed method enables professionals to assess individual fall risk by using home care records from an Electronic Health Record (EHR) system. This facilitates the initiation of targeted fall-prevention programs for those at highest risk. Additionally, it is expected that a risk-based approach can lead to a lower number needed to treat (NNT), indicating greater effectiveness of health interventions.

1 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
CLChristian Marius Lillelund
Christian Marius Lillelund
HJHenrik Bagger Jensen
Henrik Bagger Jensen
CPChristian Fischer Pedersen
Christian Fischer Pedersen
Cloud K-SVD is a dictionary learning algorithm that can train at multiple nodes and hereby produce a mutual dictionary to represent low-dimensional geometric structures in image data. We present a novel application of the algorithm as we use it to recover both noiseless and noisy images from overlapping patches. We implement a node network in Kubernetes using Docker containers to facilitate Cloud K-SVD. Results show that Cloud K-SVD can recover images approximately and remove quantifiable amounts of noise from benchmark gray-scaled images without sacrificing accuracy in recovery; we achieve an SSIM index of 0.88, 0.91 and 0.95 between clean and recovered images for noise levels ($μ$ = 0, $σ^{2}$ = 0.01, 0.005, 0.001), respectively, which is similar to SOTA in the field. Cloud K-SVD is evidently able to learn a mutual dictionary across multiple nodes and remove AWGN from images. The mutual dictionary can be used to recover a specific image at any of the nodes in the network.

12 May 2023 in Research Square
Verified
Preprint
Open access
PDF file
CLChristian Marius Lillelund
Christian Marius Lillelund
MHMichael Harbo
Michael Harbo
CPChristian Fischer Pedersen
Christian Fischer Pedersen
Falling is the second leading cause of unintentional injury-related deaths, but fall injuries in older adults are often underreported, reported too late or reported with a lack of detail due to the stigma that surrounds falling. This makes it hard to locate and target the right citizens with fall prevention programs. In this paper, we propose a novel approach to assess fall risk over time and thus identify who would benefit from such a program. Using survival analysis, we train machine learning models to rank citizens by their predicted risk of getting a personal alarm within six months based on home care observations. Data were gathered from July 2021 to December 2021 for 57 types of home care from a large municipality in Denmark. After preprocessing, a total of 5713 observations for 346 citizens with mean age 81 (std. 5 years) are available for model training. Results show that a plain Cox proportional hazards model obtain a mean concordance index of 0.76 (95\% CI: 0.7-0.82), Random Survival Forest obtain 0.84 (95\% CI: 0.76-0.92) and XGBoost obtain 0.94 (95\% CI: 0.88-1) over 25 randomized folds using cross-validation. Censoring rate is 94.5\% on average. Most predictive features are help with personal hygiene, administration of medicine, excretions, cleaning and dispensing of medicine according to a SHAP summary plot. We also identify correlations between care usage in minutes per week and risk using SHAP dependency plots, but the correlation is not always positive. With our method, professionals at municipalities in Denmark or elsewhere, where home care services are recorded, will have a noninvasive decision-support tool that can predict individual fall risk over time.

24 March 2023 in arXiv
Verified
Preprint
Open access
PDF file
JAJimmi Agerskov
Jimmi Agerskov
KNKristian Nielsen
Kristian Nielsen
CLChristian Marius Lillelund
Christian Marius Lillelund
CPChristian Fischer Pedersen
Christian Fischer Pedersen
An abundance of information about cancer exists online, but categorizing and extracting useful information from it is difficult. Almost all research within healthcare data processing is concerned with formal clinical data, but there is valuable information in non-clinical data too. The present study combines methods within distributed computing, text retrieval, clustering, and classification into a coherent and computationally efficient system, that can clarify cancer patient trajectories based on non-clinical and freely available information. We produce a fully-functional prototype that can retrieve, cluster and present information about cancer trajectories from non-clinical forum posts. We evaluate three clustering algorithms (MR-DBSCAN, DBSCAN, and HDBSCAN) and compare them in terms of Adjusted Rand Index and total run time as a function of the number of posts retrieved and the neighborhood radius. Clustering results show that neighborhood radius has the most significant impact on clustering performance. For small values, the data set is split accordingly, but high values produce a large number of possible partitions and searching for the best partition is hereby time-consuming. With a proper estimated radius, MR-DBSCAN can cluster 50000 forum posts in 46.1 seconds, compared to DBSCAN (143.4) and HDBSCAN (282.3). We conduct an interview with the Danish Cancer Society and present our software prototype. The organization sees a potential in software that can democratize online information about cancer and foresee that such systems will be required in the future.