Identification of Cancer Patient Subgroups via Smoothed Shortest Path Graph Kernel
December 13, 2016 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ali Burak Γnal, Γznur TaΕtan
arXiv ID
1612.04431
Category
cs.CE: Computational Engineering
Cross-listed
cs.LG
Citations
1
Venue
arXiv.org
Last Checked
2 months ago
Abstract
Characterizing patient somatic mutations through next-generation sequencing technologies opens up possibilities for refining cancer subtypes. However, catalogues of mutations reveal that only a small fraction of the genes are altered frequently in patients. On the other hand different genomic alterations may perturb the same pathways. We propose a novel clustering procedure that quantifies the similarities of patients from their mutational profile on pathways via a novel graph kernel. We represent each KEGG pathway as an undirected graph. For each patient the vertex labels are assigned based on her altered genes. Smoothed shortest path graph kernel (smSPK) evaluates each pair of patients by comparing their vertex labeled pathway graphs. Our clustering procedure involves two steps: the smSPK kernel matrix derived for each pathway are input to kernel k-means algorithm and each pathway is evaluated individually. In the next step, only those pathways that are successful are combined in to a single kernel input to kernel k-means to stratify patients. Evaluating the procedure on simulated data showed that smSPK clusters patients up to 88\% accuracy. Finally to identify ovarian cancer patient subgroups, we apply our methodology to the cancer genome atlas ovarian data that involves 481 patients. The identified subgroups are evaluated through survival analysis. Grouping patients into four clusters results with patients groups that are significantly different in their survival times ($p$-value $\le 0.005$).
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Computational Engineering
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Probabilistic Graphical Model Foundation for Enabling Predictive Digital Twins at Scale
R.I.P.
π»
Ghosted
Temporal Attention augmented Bilinear Network for Financial Time-Series Data Analysis
R.I.P.
π»
Ghosted
Linked Component Analysis from Matrices to High Order Tensors: Applications to Biomedical Data
R.I.P.
π»
Ghosted
Deep Dynamical Modeling and Control of Unsteady Fluid Flows
R.I.P.
π»
Ghosted
Design and Optimization of Conforming Lattice Structures
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Language Models are Few-Shot Learners
R.I.P.
π»
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
π»
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
π»
Ghosted