Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

10192938 · Jun 202019922001200920172026
48 results for non-small cell lung cancer

Study identifies biomarkers for lung cancer in female non-smokers.

problem Identifying prognostic biomarkers for stage III NSCLC in non-smoking females.
method Gene expression profiling and XGBoost machine learning algorithm.
result Top biomarkers validated in literature, with AUC score of 0.835.

New method estimates treatment effects over time for survival data, improving accuracy and smoothness.

problem Estimating treatment effects over time for survival data with left truncation and right censoring.
method surv-iTMLE, a targeted learning procedure for estimating conditional survival probabilities.
result surv-iTMLE outperforms existing methods in bias and smoothness of time-varying effect estimates.

The paper integrates AI and expert knowledge to optimize radiotherapy decisions.

problem Optimizing radiation dose planning considering patient-specific information.
method Integrating Gaussian process models with deep neural networks to quantify uncertainty.
result Improves AI model performance and guides clinical decision making.

New framework distinguishes lung cancer subtypes using MALDI mass spectrometry.

problem Distinguishing between adenocarcinoma and squamous cell carcinoma subtypes in lung cancer.
method Supervised topological data analysis on MALDI mass spectrometry imaging data.
result The proposed framework successfully classifies lung cancer subtypes with competitive results.

The paper studies causal effects of multiple treatments in healthcare databases with rare outcomes.

problem Estimating causal effects of multiple treatments in healthcare databases with rare outcomes.
method The paper designs three sets of simulations and compares the operating characteristics of three types of methods: Bayesian Additive Regression Trees (BART), regression adjustment on multivariate spline of generalized propensity scores (RAMS), and inverse probability of treatment weighting (IPTW) with multinomial logistic regression or generalized boosted models.
result BART and RAMS provide lower bias and mean squared error compared to IPTW methods.

We present *K-means clustering algorithm and source code by expanding statistical clustering methods applied in https://ssrn.com/abstract=2802753 to quantitative finance. *K-means is statistically deterministic without specifying initial centers, etc. We apply *K-means to extracting cancer signatures from genome data w…

2017-03-02abs ↗pdf ↗

Proposes a new model to analyze CT scans for lung cancer patients.

problem Analyzing survival risks of lung cancer patients using CT scans.
method Penalized Deep Partially Linear Cox Model (Penalized DPLC) incorporating SCAD penalty and deep neural network.
result The model effectively selects important texture features and estimates nonparametric components.

Lung cancer is the leading cause of cancer-related death worldwide. Early diagnosis of pulmonary nodules in Computed Tomography (CT) chest scans provides an opportunity for designing effective treatment and making financial and care plans. In this paper, we consider the problem of diagnostic classification between beni…

2018-03-19abs ↗pdf ↗

MSB framework improves survival prediction in immunotherapy patients with missing data.

problem High dimensionality and blockwise missingness in multimodal clinical data.
method MSB is a late-fusion framework that independently models modality-specific features before aggregating predictions via cross-validated stacking.
result MSB outperformed baseline algorithms in predicting progression-free survival in lung cancer patients.

Proposes ConRad model for lung cancer classification using radiomics and interpretable machine learning.

problem Lack of interpretability in deep neural networks for cancer diagnosis.
method Integration of radiomics and DNN-predicted biomarkers in interpretable classifiers (ConRad).
result ConRad models outperform CNNs in five-fold cross-validation.

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

Paper proposes inference method for high-dimensional censored quantile regression.

problem Identifying heterogeneous effects of high-dimensional genetic biomarkers on survival outcomes.
method Combines low-dimensional model estimates based on multi-sample splittings and variable selection.
result Proposed estimator is consistent and asymptotically follows a Gaussian process.

We estimate treatment cost-savings from early cancer diagnosis. For breast, lung, prostate and colorectal cancers and melanoma, which account for more than 50% of new incidences projected in 2017, we combine published cancer treatment cost estimates by stage with incidence rates by stage at diagnosis. We extrapolate to…

2017-08-30abs ↗pdf ↗

One of the challenges of using machine learning techniques with medical data is the frequent dearth of source image data on which to train. A representative example is automated lung cancer diagnosis, where nodule images need to be classified as suspicious or benign. In this work we propose an automatic synthetic lung …

2018-11-19abs ↗pdf ↗

New method uses probabilistic independence to discover disease signatures from medical records.

problem Insufficiently precise diagnosis of clinical disease leading to treatment failures.
method Unsupervised machine learning using probabilistic independence to disentangle disease patterns.
result Inferred 2000 clinical disease signatures from medical records, improving cancer prediction.

Accurately predicting drug responses to cancer is an important problem hindering oncologists' efforts to find the most effective drugs to treat cancer, which is a core goal in precision medicine. The scientific community has focused on improving this prediction based on genomic, epigenomic, and proteomic datasets measu…

2016-12-02abs ↗pdf ↗

Model predicts anti-cancer drug responses using gene and molecular data.

problem Expensive and time-consuming cancer drug discovery and tailoring.
method Uses variational autoencoders and multi-layer perceptrons to encode gene expression and drug data.
result High average R2R^{2} of 0.83 and 0.845 in predicting drug responses for breast and pan-cancer cell lines, respectively.

Selecting the right drugs for the right patients is a primary goal of precision medicine. In this manuscript, we consider the problem of cancer drug selection in a learning-to-rank framework. We have formulated the cancer drug selection problem as to accurately predicting 1). the ranking positions of sensitive drugs an…

2018-01-23abs ↗pdf ↗

Exploratory cancer drug studies test multiple tumor cell lines against multiple candidate drugs. The goal in each paired (cell line, drug) experiment is to map out the dose-response curve of the cell line as the dose level of the drug increases. We propose Bayesian Tensor Filtering (BTF), a hierarchical Bayesian model …

2019-06-10abs ↗pdf ↗

TransST improves spatial transcriptomics data analysis by identifying cell clusters and biomarkers.

problem Low resolution and insufficient sequencing depth in spatial transcriptomics data.
method Transfer learning framework to adaptively leverage external cell-labeled information.
result TransST successfully identifies five biologically meaningful cell clusters and separates adipose tissues from connective issues.

Understanding the phenotypic drug response on cancer cell lines plays a vital rule in anti-cancer drug discovery and re-purposing. The Genomics of Drug Sensitivity in Cancer (GDSC) database provides open data for researchers in phenotypic screening to test their models and methods. Previously, most research in these ar…

2018-12-28abs ↗pdf ↗

There are various algorithms and methodologies used for automated screening of cervical cancer by segmenting and classifying cervical cancer cells into different categories. This study presents a critical review of different research papers published that integrated AI methods in screening cervical cancer via different…

2018-11-02abs ↗pdf ↗

With the wealth of high-throughput sequencing data generated by recent large-scale consortia, predictive gene expression modelling has become an important tool for integrative analysis of transcriptomic and epigenetic data. However, sequencing data-sets are characteristically large, and previously modelling frameworks …

2015-07-21abs ↗pdf ↗

MINN-SA enhances cancer detection using TCR sequences with better interpretability.

problem Challenges in detecting cancers using TCR sequences due to one-to-many correspondence.
method Multiple Instance Neural Networks based on Sparse Attention (MINN-SA).
result MINN-SA achieves highest AUC scores on 10 cancer types compared to existing MIL approaches.

Paper proposes a method to estimate confidence bands for survival random forests.

problem No statistically valid and computationally feasible approach for estimating confidence bands for survival random forests.
method Extending recent developments in infinite-order incomplete U-statistics, the paper proposes an unbiased confidence band estimation.
result The proposed method accurately estimates the confidence band and achieves desired coverage rate.

Accurate and robust cell nuclei classification is the cornerstone for a wider range of tasks in digital and Computational Pathology. However, most machine learning systems require extensive labeling from expert pathologists for each individual problem at hand, with no or limited abilities for knowledge transfer between…

2016-06-02abs ↗pdf ↗

Bayesian SPCA method tackles orthogonality constraint with spike and slab prior.

problem Bayesian SPCA method for high-dimensional data with orthogonality constraint.
method Parameter-expanded coordinate ascent variational inference (PX-CAVI) with spike and slab prior.
result PX-CAVI algorithm outperforms existing SPCA approaches in performance.