paper-with-me

홈 › Papers

MURAL: An Unsupervised Random Forest-Based Embedding for Electronic Health Record Data

2021-11-19 · Michal Gerasimiuk, Dennis Shung, Alexander Tong, Adrian Stanley, Michael Schultz, Jeffrey Ngu, Loren Laine, Guy Wolf, Smita Krishnaswamy

A major challenge in embedding or visualizing clinical patient data is the heterogeneity of variable types including continuous lab values, categorical diagnostic codes, as well as missing or incomplete data. In particular, in EHR data, some variables are {\em missing not at random (MNAR)} but deliberately not collected and thus are a source of information. For example, lab tests may be deemed necessary for some patients on the basis of suspected diagnosis, but not for others. Here we present the MURAL forest -- an unsupervised random forest for representing data with disparate variable types (e.g., categorical, continuous, MNAR). MURAL forests consist of a set of decision trees where node-splitting variables are chosen at random, such that the marginal entropy of all other variables is minimized by the split. This allows us to also split on MNAR variables and discrete variables in a way that is consistent with the continuous variables. The end goal is to learn the MURAL embedding of patients using average tree distances between those patients. These distances can be fed to nonlinear dimensionality reduction method like PHATE to derive visualizable embeddings. While such methods are ubiquitous in continuous-valued datasets (like single cell RNA-sequencing) they have not been used extensively in mixed variable data. We showcase the use of our method on one artificial and two clinical datasets. We show that using our approach, we can visualize and classify data more accurately than competing approaches. Finally, we show that MURAL can also be used to compare cohorts of patients via the recently proposed tree-sliced Wasserstein distances.

📄 PDF Abstract BibTeX arXiv:2111.10452

Code (1)

mgerasimiuk/mural 공식 구현

Tasks

DiagnosticDimensionality Reduction

Similar Papers 제목 키워드 기반

A random forest system combination approach for error detection in digital dictionaries

2014-10-30 · WS 2012 4 · Michael Bloodgood, Peng Ye, Paul Rodrigues, David Zajic 외

When digitizing a print bilingual dictionary, whether via optical character recognition or manual entry, it is inevitable that errors are introduced into the electronic version that is created. We investigate automating …

Language ModelingLanguage ModellingOptical Character RecognitionOptical Character Recognition (OCR)

MuRAL-CPD: Active Learning for Multiresolution Change Point Detection

2026-01-28 · Stefano Bertolasi, Diego Carrera, Diego Stucchi, Pasqualina Fragneto 외 arxiv

Change Point Detection (CPD) is a critical task in time series analysis, aiming to identify moments when the underlying data-generating process shifts. Traditional CPD methods often rely on unsupervised techniques, which…

Change Point DetectionTime Series AnalysisActive Learning

Deep learning with sentence embeddings pre-trained on biomedical corpora improves the performance of finding similar sentences in electronic medical records

2019-09-06 · Qingyu Chen, Jingcheng Du, Sun Kim, W. John Wilbur 외

Capturing sentence semantics plays a vital role in a range of text mining applications. Despite continuous efforts on the development of related datasets and models in the general domain, both datasets and models are lim…

Semantic Textual SimilaritySentenceSentence EmbeddingsSTS

Explainable Unsupervised Anomaly Detection with Random Forest

2025-04-22 · Joshua S. Harvey, Joshua Rosaler, Mingshu Li, Dhruv Desai 외

We describe the use of an unsupervised Random Forest for similarity learning and improved unsupervised anomaly detection. By training a Random Forest to discriminate between real data and synthetic data sampled from a un…

Anomaly DetectionFeature ImportanceUnsupervised Anomaly Detection

Randomized PCA Forest for Unsupervised Outlier Detection

2025-08-18 · Muhammad Rajabinasab, Farhad Pakdaman, Moncef Gabbouj, Peter Schneider-Kamp 외 arxiv

We propose a novel unsupervised outlier detection method based on Randomized Principal Component Analysis (PCA). Motivated by the performance of Randomized PCA (RPCA) Forest in approximate K-Nearest Neighbor (KNN) search…

Computational EfficiencyOutlier Detection