EDBT 2026 Demo / reviewers in the wild / expert
Frans Voorbraak
dblp:52/2364
· DBLP profile ↗
11ranked-venue papers
9as 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 · 7 · 7 first-authorApplied, interdisciplinary, general and emerging computing · 2Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
4 papers |
Knowledge representation and reasoning · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › statistical genetics
genetic association study |
0.3 | 1 | 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic data · Bioinform. 2017 |
Bioinformatics and computational biology
genomics |
0.3 | 1 | 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic data · Bioinform. 2017 |
Bioinformatics and computational biology › omics data analysis
high-dimensional omics data analysis |
0.3 | 1 | 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic data · Bioinform. 2017 |
Bioinformatics and computational biology › epigenomics
DNA methylation |
0.1 | 1 | 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic data · Bioinform. 2017 |
Bioinformatics and computational biology
epigenomics |
0.1 | 1 | 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic data · Bioinform. 2017 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
nonmonotonic reasoning |
0.1 | 2 | 2004 | A nonmonotonic observation logic · Artif. Intell. 2004 Preference-Based Semantics for Nonmonotonic Logics · IJCAI 1993 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
belief functions |
0.0 | 2 | 1991 | On the Justification of Dempster's Rule of Combination · Artif. Intell. 1991 A Computationally Efficient Approximation of Dempster-Shafer Theory · Int. J. Man Mach. Stud. 1989 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
uncertainty reasoning |
0.0 | 2 | 1991 | On the Justification of Dempster's Rule of Combination · Artif. Intell. 1991 A Computationally Efficient Approximation of Dempster-Shafer Theory · Int. J. Man Mach. Stud. 1989 |
Logic in computer science › nonmonotonic reasoning
nonmonotonic semantics |
0.0 | 1 | 1993 | Preference-Based Semantics for Nonmonotonic Logics · IJCAI 1993 |
Methods — techniques the papers use, named apart from their topics
sparse redundancy analysis · 0.3penalized regression · 0.3elastic net · 0.3nonmonotonic logic · 0.0preference semantics · 0.0evidence theory · 0.0approximation algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Sparse redundancy analysis of high-dimensional genetic and genomic dataabstractMOTIVATION: Recent technological developments have enabled the possibility of genetic and genomic integrated data analysis approaches, where multiple omics datasets from various biological levels are combined and used to describe (disease) phenotypic variations. The main goal is to explain and ultimately predict phenotypic variations by understanding their genetic basis and the interaction of the associated genetic factors. Therefore, understanding the underlying genetic mechanisms of phenotypic variations is an ever increasing research interest in biomedical sciences. In many situations, we have a set of variables that can be considered to be the outcome variables and a set that can be considered to be explanatory variables. Redundancy analysis (RDA) is an analytic method to deal with this type of directionality. Unfortunately, current implementations of RDA cannot deal optimally with the high dimensionality of omics data (p≫n). The existing theoretical framework, based on Ridge penalization, is suboptimal, since it includes all variables in the analysis. As a solution, we propose to use Elastic Net penalization in an iterative RDA framework to obtain a sparse solution. RESULTS: We proposed sparse redundancy analysis (sRDA) for high dimensional omics data analysis. We conducted simulation studies with our software implementation of sRDA to assess the reliability of sRDA. Both the analysis of simulated data, and the analysis of 485 512 methylation markers and 18,424 gene-expression values measured in a set of 55 patients with Marfan syndrome show that sRDA is able to deal with the usual high dimensionality of omics data. AVAILABILITY AND IMPLEMENTATION: http://uva.csala.me/rda. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Attila Csala, Frans Voorbraak, Aeilko H. Zwinderman, Michel H. Hof |
Bioinform. | 2 |
| 2005 | Dichotomization of ICU Length of Stay Based on Model Calibration
Marion Verduijn, Niels Peek, Frans Voorbraak, Evert de Jonge, Bas A. de Mol |
AIME | 3 |
| 2004 | A nonmonotonic observation logic
Frans Voorbraak |
Artif. Intell. | 1 |
| 2001 | Decision-Theoretic Planning for Autonomous Robotic Surveillance
Frans Voorbraak, Nilos Massios |
Appl. Intell. | 1 |
| 2000 | Partial Probability: Theory and ApplicationsabstractIn this paper, we describe an approach to handling partially specified probabilistic information. We propose a formalism, called Partial Probability Theory (PPT), which allows very general representations of belief states, and we give brief treatments of problems, like belief change, evidence combination, and decision making in the context of PPT. We argue that the generality of PPT provide new insights in all the mentioned problem areas. More detailed treatments of these issues can be found in several papers referred to in the text. Frans Voorbraak |
Int. J. Uncertain. Fuzziness Knowl. Based Syst. | 1 |
| 1999 | Probabilistic Belief Change: Expansion, Conditioning and Constraining
Frans Voorbraak |
UAI | 1 |
| 1993 | Preference-Based Semantics for Nonmonotonic Logics
Frans Voorbraak |
IJCAI | 1 |
| 1992 | Generalized Kripke Models for Epistemic Logic
Frans Voorbraak |
TARK | 1 |
| 1991 | A Preferential Model Semantics For Default Logic
Frans Voorbraak |
ECSQARU | 1 |
| 1991 | On the Justification of Dempster's Rule of Combination
Frans Voorbraak |
Artif. Intell. | 1 |
| 1989 | A Computationally Efficient Approximation of Dempster-Shafer Theory
Frans Voorbraak |
Int. J. Man Mach. Stud. | 1 |