Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Navodit Misra

dblp:95/8064 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 75% Learning theory · 25%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
bayesian network
0.212016
Stable Graphical Models · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.212016
Stable Graphical Models · J. Mach. Learn. Res. 2016
Machine learning › Learning theory › high-dimensional statistics
heavy-tailed distribution
0.212016
Stable Graphical Models · J. Mach. Learn. Res. 2016
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.212016
Stable Graphical Models · J. Mach. Learn. Res. 2016
Bioinformatics and computational biology
cancer genomics
0.212014
Inferring the paths of somatic evolution in cancer · Bioinform. 2014
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.112011
An Optimization-Based Sampling Scheme for Phylogenetic Trees · RECOMB 2011
Bioinformatics and computational biology › genomics
computational genomics
0.112010
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny · RECOMB 2010
Bioinformatics and computational biology
phylogenetics
0.112010
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny · RECOMB 2010
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
epistasis
0.112014
Inferring the paths of somatic evolution in cancer · Bioinform. 2014
Mathematical optimization
combinatorial optimization
0.012010
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny · RECOMB 2010

Methods — techniques the papers use, named apart from their topics

penalized maximum likelihood · 0.2minimum dispersion criterion · 0.2bayesian information criterion · 0.2parsimony · 0.2buneman pruning · 0.2bayesian probabilistic model · 0.2ancestral genotype reconstruction · 0.2optimization-based sampling · 0.1
YearPublicationVenuePosition
2016 Stable Graphical Models
abstract
Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. In this paper, we introduce $\alpha$-stable graphical ($\alpha$-SG) models, a class of multivariate stable densities that can also be represented as Bayesian networks whose edges encode linear dependencies between random variables. One major hurdle to the extensive use of stable distributions is the lack of a closed- form analytical expression for their densities. This makes penalized maximum-likelihood based learning computationally demanding. We establish theoretically that the Bayesian information criterion (BIC) can asymptotically be reduced to the computationally more tractable minimum dispersion criterion (MDC) and develop StabLe, a structure learning algorithm based on MDC. We use simulated datasets for five benchmark network topologies to empirically demonstrate how StabLe improves upon ordinary least squares (OLS) regression. We also apply StabLe to microarray gene expression data for lymphoblastoid cells from 727 individuals belonging to eight global population groups. We establish that StabLe improves test set performance relative to OLS via ten-fold cross-validation. Finally, we develop SGEX, a method for quantifying differential expression of genes between different population groups.
Navodit Misra, Ercan E. Kuruoglu
J. Mach. Learn. Res.1
2014 Inferring the paths of somatic evolution in cancer
abstract
MOTIVATION: Cancer cell genomes acquire several genetic alterations during somatic evolution from a normal cell type. The relative order in which these mutations accumulate and contribute to cell fitness is affected by epistatic interactions. Inferring their evolutionary history is challenging because of the large number of mutations acquired by cancer cells as well as the presence of unknown epistatic interactions. RESULTS: We developed Bayesian Mutation Landscape (BML), a probabilistic approach for reconstructing ancestral genotypes from tumor samples for much larger sets of genes than previously feasible. BML infers the likely sequence of mutation accumulation for any set of genes that is recurrently mutated in tumor samples. When applied to tumor samples from colorectal, glioblastoma, lung and ovarian cancer patients, BML identifies the diverse evolutionary scenarios involved in tumor initiation and progression in greater detail, but broadly in agreement with prior results. AVAILABILITY AND IMPLEMENTATION: Source code and all datasets are freely available at bml.molgen.mpg.de. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Navodit Misra, Ewa Szczurek, Martin Vingron
Bioinform.1
2011 An Optimization-Based Sampling Scheme for Phylogenetic Trees
Navodit Misra, Guy E. Blelloch, R. Ravi 0001, Russell Schwartz
RECOMB1
2010 Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny
Navodit Misra, Guy E. Blelloch, R. Ravi 0001, Russell Schwartz
RECOMB1