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

Alain Hauser

dblp:40/8030 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2014
0000-0002-1553-5812ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-authorTheory of computation · 1 · 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
1 paper
Probabilistic and Bayesian machine learning · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 77% Computational science and engineering · 23%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
systems biology
0.212013
Near-optimal experimental design for model selection in systems biology · Bioinform. 2013
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.112012
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs · J. Mach. Learn. Res. 2012
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
directed acyclic graph
0.112012
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs · J. Mach. Learn. Res. 2012
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.112012
Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs · J. Mach. Learn. Res. 2012
Computational science and engineering › dynamical systems
dynamical systems reconstruction
0.012013
Near-optimal experimental design for model selection in systems biology · Bioinform. 2013

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

graphical model · 0.2approximation algorithm · 0.2score-based structure learning · 0.1greedy learning · 0.1
YearPublicationVenuePosition
2014 Two optimal strategies for active learning of causal models from interventional data
Alain Hauser, Peter Bühlmann
Int. J. Approx. Reason.1
2013 Near-optimal experimental design for model selection in systems biology
abstract
MOTIVATION: Biological systems are understood through iterations of modeling and experimentation. Not all experiments, however, are equally valuable for predictive modeling. This study introduces an efficient method for experimental design aimed at selecting dynamical models from data. Motivated by biological applications, the method enables the design of crucial experiments: it determines a highly informative selection of measurement readouts and time points. RESULTS: We demonstrate formal guarantees of design efficiency on the basis of previous results. By reducing our task to the setting of graphical models, we prove that the method finds a near-optimal design selection with a polynomial number of evaluations. Moreover, the method exhibits the best polynomial-complexity constant approximation factor, unless P = NP. We measure the performance of the method in comparison with established alternatives, such as ensemble non-centrality, on example models of different complexity. Efficient design accelerates the loop between modeling and experimentation: it enables the inference of complex mechanisms, such as those controlling central metabolic operation. AVAILABILITY: Toolbox 'NearOED' available with source code under GPL on the Machine Learning Open Source Software Web site (mloss.org).
Alberto Giovanni Busetto, Alain Hauser, Gabriel Krummenacher, Mikael Sunnåker, Sotiris Dimopoulos, Cheng Soon Ong, Jörg Stelling, Joachim M. Buhmann
Bioinform.2
2012 Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
Alain Hauser, Peter Bühlmann
J. Mach. Learn. Res.1
2011 Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs (Abstract)
Alain Hauser, Peter Bühlmann
UAI1
2010 Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars
Alain Hauser, Jens Maue
SEA1