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

Markus Kalisch

dblp:55/4625 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

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
2 papers
Probabilistic and Bayesian machine learning · 64% Knowledge representation and reasoning · 36%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › causal reasoning
causal graphical model
0.312017
Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs · J. Mach. Learn. Res. 2017
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
markov equivalence class
0.312017
Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs · J. Mach. Learn. Res. 2017
Bioinformatics and computational biology › genomics
genome-wide association study
0.212016
Assessing statistical significance in multivariable genome wide association analysis · Bioinform. 2016
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.112007
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm · J. Mach. Learn. Res. 2007
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
directed acyclic graph learning
0.112007
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm · J. Mach. Learn. Res. 2007
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning
0.112007
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm · J. Mach. Learn. Res. 2007

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

graph theory · 0.3generalized linear model · 0.2family-wise error rate control · 0.2data-driven SNP grouping · 0.2constraint-based structure learning · 0.1PC algorithm · 0.1
YearPublicationVenuePosition
2017 Interpreting and Using CPDAGs With Background Knowledge
Emilija Perkovic, Markus Kalisch, Marloes H. Maathuis
UAI2
2017 Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs
Emilija Perkovic, Johannes Textor, Markus Kalisch, Marloes H. Maathuis
J. Mach. Learn. Res.3
2016 Assessing statistical significance in multivariable genome wide association analysis
abstract
MOTIVATION: Although Genome Wide Association Studies (GWAS) genotype a very large number of single nucleotide polymorphisms (SNPs), the data are often analyzed one SNP at a time. The low predictive power of single SNPs, coupled with the high significance threshold needed to correct for multiple testing, greatly decreases the power of GWAS. RESULTS: We propose a procedure in which all the SNPs are analyzed in a multiple generalized linear model, and we show its use for extremely high-dimensional datasets. Our method yields P-values for assessing significance of single SNPs or groups of SNPs while controlling for all other SNPs and the family wise error rate (FWER). Thus, our method tests whether or not a SNP carries any additional information about the phenotype beyond that available by all the other SNPs. This rules out spurious correlations between phenotypes and SNPs that can arise from marginal methods because the 'spuriously correlated' SNP merely happens to be correlated with the 'truly causal' SNP. In addition, the method offers a data driven approach to identifying and refining groups of SNPs that jointly contain informative signals about the phenotype. We demonstrate the value of our method by applying it to the seven diseases analyzed by the Wellcome Trust Case Control Consortium (WTCCC). We show, in particular, that our method is also capable of finding significant SNPs that were not identified in the original WTCCC study, but were replicated in other independent studies. AVAILABILITY AND IMPLEMENTATION: Reproducibility of our research is supported by the open-source Bioconductor package hierGWAS. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Laura Buzdugan, Markus Kalisch, Arcadi Navarro, Daniel Schunk, Ernst Fehr, Peter Bühlmann
Bioinform.2
2015 A Complete Generalized Adjustment Criterion
Emilija Perkovic, Johannes Textor, Markus Kalisch, Marloes H. Maathuis
UAI3
2011 Learning high-dimensional DAGs with latent and selection variables (Abstract)
Diego Colombo, Marloes H. Maathuis, Markus Kalisch, Thomas Richardson 0001
UAI3
2007 Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm
Markus Kalisch, Peter Bühlmann
J. Mach. Learn. Res.1