Demo Data from EDBT 2026 / reviewers in the wild / expert
Michail Tsagris
dblp:136/7739 · also Michalis Tsagris
· DBLP profile ↗
4ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0002-2049-3063ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 2 since 2021Artificial 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › statistical genetics › genomic prediction
genetic risk prediction |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › statistical genetics › genomic prediction
polygenic risk score |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › statistical genetics › fine-mapping
causal variant identification |
0.2 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › clinical bioinformatics
genetic variant interpretation |
0.2 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
biosignature discovery · 0.7automated machine learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Automated machine learning for genome wide association studiesabstractMOTIVATION: Genome-wide association studies (GWAS) present several computational and statistical challenges for their data analysis, including knowledge discovery, interpretability, and translation to clinical practice. RESULTS: We develop, apply, and comparatively evaluate an automated machine learning (AutoML) approach, customized for genomic data that delivers reliable predictive and diagnostic models, the set of genetic variants that are important for predictions (called a biosignature), and an estimate of the out-of-sample predictive power. This AutoML approach discovers variants with higher predictive performance compared to standard GWAS methods, computes an individual risk prediction score, generalizes to new, unseen data, is shown to better differentiate causal variants from other highly correlated variants, and enhances knowledge discovery and interpretability by reporting multiple equivalent biosignatures. AVAILABILITY AND IMPLEMENTATION: Code for this study is available at: https://github.com/mensxmachina/autoML-GWAS. JADBio offers a free version at: https://jadbio.com/sign-up/. SNP data can be downloaded from the EGA repository (https://ega-archive.org/). PRS data are found at: https://www.aicrowd.com/challenges/opensnp-height-prediction. Simulation data to study population structure can be found at: https://easygwas.ethz.ch/data/public/dataset/view/1/. Kleanthi Lakiotaki, Zacharias Papadovasilakis, Vincenzo Lagani, Stefanos Fafalios, Paulos Charonyktakis, Michail Tsagris, Ioannis Tsamardinos |
Bioinform. | 6 |
| 2022 | The $\gamma$γ-OMP Algorithm for Feature Selection With Application to Gene Expression DataabstractFeature selection for predictive analytics is the problem of identifying a minimal-size subset of features that is maximally predictive of an outcome of interest. To apply to molecular data, feature selection algorithms need to be scalable to tens of thousands of features. In this paper, we propose γ-OMP, a generalisation of the highly-scalable Orthogonal Matching Pursuit feature selection algorithm. γ-OMP can handle (a)various types of outcomes, such as continuous, binary, nominal, time-to-event, (b)discrete (categorical)features, (c)different statistical-based stopping criteria, (d)several predictive models (e.g., linear or logistic regression), (e)various types of residuals, and (f)different types of association. We compare γ-OMP against LASSO, a prototypical, widely used algorithm for high-dimensional data. On both simulated data and several real gene expression datasets, γ-OMP is on par, or outperforms LASSO in binary classification (case-control data), regression (quantified outcomes), and time-to-event data (censored survival times). γ-OMP is based on simple statistical ideas, it is easy to implement and to extend, and our extensive evaluation shows that it is also effective in bioinformatics analysis settings. Michail Tsagris, Zacharias Papadovasilakis, Kleanthi Lakiotaki, Ioannis Tsamardinos |
IEEE ACM Trans. Comput. Biol. Bioinform. | 1 |
| 2018 | Feature selection for high-dimensional temporal dataabstractBACKGROUND: Feature selection is commonly employed for identifying collectively-predictive biomarkers and biosignatures; it facilitates the construction of small statistical models that are easier to verify, visualize, and comprehend while providing insight to the human expert. In this work we extend established constrained-based, feature-selection methods to high-dimensional "omics" temporal data, where the number of measurements is orders of magnitude larger than the sample size. The extension required the development of conditional independence tests for temporal and/or static variables conditioned on a set of temporal variables. RESULTS: The algorithm is able to return multiple, equivalent solution subsets of variables, scale to tens of thousands of features, and outperform or be on par with existing methods depending on the analysis task specifics. CONCLUSIONS: The use of this algorithm is suggested for variable selection with high-dimensional temporal data. Michail Tsagris, Vincenzo Lagani, Ioannis Tsamardinos |
BMC Bioinform. | 1 |
| 2013 | Modelling distributions of the temporal membership grades for non-stationary fuzzy setsabstractNon-stationary fuzzy sets have been introduced to model variation in human reasoning. While they have some similarities to type-2 fuzzy sets, there are many detailed differences. One of these differences is that they may feature horizontal random perturbations of membership functions, which result in distributions across the membership grades over time, termed temporal membership grades, which are somewhat akin to secondary membership grades of type-2 fuzzy sets. In this paper we study the distribution of the temporal membership grades of non-stationary fuzzy sets with Gaussian underlying membership functions. We derive the distribution of these grades when the non-stationary fuzzy sets are obtained by variations in location using a normal distribution. We show how to estimate the parameters of the derived distribution using numerical optimisation. In addition, we investigate the changes in the distributions obtained when using variations in location using a uniform distribution. Finally, we exhibit the performance of the beta and logistic normal distribution using examples of simulated data. In doing so, we further explore the relationships between non-stationary and type-2 fuzzy sets. Michail Tsagris, Jonathan M. Garibaldi |
FUZZ-IEEE | 1 |