Demo Data from VLDB 2026 / reviewers in the wild / expert
Tomislav Smuc
dblp:28/15
· DBLP profile ↗
16ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-9185-9384ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 9 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 4
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
2 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
1 paper |
Trustworthy machine learning · 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 › molecular property prediction
binding affinity prediction |
0.7 | 1 | 2023 | Dynamic applicability domain (dAD): compound-target binding affinity estimates with local conformal prediction · Bioinform. 2023 |
Bioinformatics and computational biology
drug discovery |
0.7 | 1 | 2023 | Dynamic applicability domain (dAD): compound-target binding affinity estimates with local conformal prediction · Bioinform. 2023 |
Bioinformatics and computational biology › functional genomics
gene function prediction |
0.2 | 1 | 2016 | Extensive complementarity between gene function prediction methods · Bioinform. 2016 |
Bioinformatics and computational biology › protein function prediction
gene ontology annotation |
0.2 | 1 | 2016 | Extensive complementarity between gene function prediction methods · Bioinform. 2016 |
Machine learning › Trustworthy machine learning
uncertainty estimation |
0.2 | 1 | 2023 | Dynamic applicability domain (dAD): compound-target binding affinity estimates with local conformal prediction · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
conformal prediction · 1.3applicability domain · 1.3information-theoretic analysis · 0.2genomic feature integration · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Dynamic applicability domain (dAD): compound-target binding affinity estimates with local conformal predictionabstractMOTIVATION: Increasing efforts are being made in the field of machine learning to advance the learning of robust and accurate models from experimentally measured data and enable more efficient drug discovery processes. The prediction of binding affinity is one of the most frequent tasks of compound bioactivity modelling. Learned models for binding affinity prediction are assessed by their average performance on unseen samples, but point predictions are typically not provided with a rigorous confidence assessment. Approaches, such as the conformal predictor framework equip conventional models with a more rigorous assessment of confidence for individual point predictions. In this article, we extend the inductive conformal prediction framework for interaction data, in particular the compound-target binding affinity prediction task. The new framework is based on dynamically defined calibration sets that are specific for each testing pair and provides prediction assessment in the context of calibration pairs from its compound-target neighbourhood, enabling improved estimates based on the local properties of the prediction model. RESULTS: The effectiveness of the approach is benchmarked on several publicly available datasets and tested in realistic use-case scenarios with increasing levels of difficulty on a complex compound-target binding affinity space. We demonstrate that in such scenarios, novel approach combining applicability domain paradigm with conformal prediction framework, produces superior confidence assessment with valid and more informative prediction regions compared to other 'state-of-the-art' conformal prediction approaches. AVAILABILITY AND IMPLEMENTATION: Dataset and the code are available on GitHub (https://github.com/mlkr-rbi/dAD). Davor Orsolic, Tomislav Smuc |
Bioinform. | 2 |
| 2023 | WINTENDED: WINdowed TENsor decomposition for Densification Event Detection in time-evolving networks
Sofia Fernandes 0001, Hadi Fanaee-T, João Gama 0001, Leo Tisljaric, Tomislav Smuc |
Mach. Learn. | 5 |
| 2018 | Extending Redescription Mining to Multiple Views
Matej Mihelcic, Saso Dzeroski, Tomislav Smuc |
DS | 3 |
| 2018 | Redescription mining augmented with random forest of multi-target predictive clustering trees
Matej Mihelcic, Saso Dzeroski, Nada Lavrac, Tomislav Smuc |
J. Intell. Inf. Syst. | 4 |
| 2018 | Targeted and contextual redescription set exploration
Matej Mihelcic, Tomislav Smuc |
Mach. Learn. | 2 |
| 2017 | Phenotype Inference from Text and Genomic Data
Maria Brbic, Matija Piskorec, Vedrana Vidulin, Anita Krisko, Tomislav Smuc, Fran Supek |
ECML/PKDD (3) | 5 |
| 2017 | A framework for redescription set construction
Matej Mihelcic, Saso Dzeroski, Nada Lavrac, Tomislav Smuc |
Expert Syst. Appl. | 4 |
| 2016 | InterSet: Interactive Redescription Set Exploration
Matej Mihelcic, Tomislav Smuc |
DS | 2 |
| 2016 | Extensive complementarity between gene function prediction methodsabstractMOTIVATION: The number of sequenced genomes rises steadily but we still lack the knowledge about the biological roles of many genes. Automated function prediction (AFP) is thus a necessity. We hypothesized that AFP approaches that draw on distinct genome features may be useful for predicting different types of gene functions, motivating a systematic analysis of the benefits gained by obtaining and integrating such predictions. RESULTS: Our pipeline amalgamates 5 133 543 genes from 2071 genomes in a single massive analysis that evaluates five established genomic AFP methodologies. While 1227 Gene Ontology (GO) terms yielded reliable predictions, the majority of these functions were accessible to only one or two of the methods. Moreover, different methods tend to assign a GO term to non-overlapping sets of genes. Thus, inferences made by diverse genomic AFP methods display a striking complementary, both gene-wise and function-wise. Because of this, a viable integration strategy is to rely on a single most-confident prediction per gene/function, rather than enforcing agreement across multiple AFP methods. Using an information-theoretic approach, we estimate that current databases contain 29.2 bits/gene of known Escherichia coli gene functions. This can be increased by up to 5.5 bits/gene using individual AFP methods or by 11 additional bits/gene upon integration, thereby providing a highly-ranking predictor on the Critical Assessment of Function Annotation 2 community benchmark. Availability of more sequenced genomes boosts the predictive accuracy of AFP approaches and also the benefit from integrating them. AVAILABILITY AND IMPLEMENTATION: The individual and integrated GO predictions for the complete set of genes are available from http://gorbi.irb.hr/ CONTACT: [email protected] information: Supplementary materials are available at Bioinformatics online. Vedrana Vidulin, Tomislav Smuc, Fran Supek |
Bioinform. | 2 |
| 2015 | MultiNets: Web-Based Multilayer Network Visualization
Matija Piskorec, Borut Sluban, Tomislav Smuc |
ECML/PKDD (3) | 3 |
| 2014 | Synthetic Sequence Generator for Recommender Systems - Memory Biased Random Walk on a Sequence Multilayer Network
Nino Antulov-Fantulin, Matko Bosnjak, Vinko Zlatic, Miha Grcar, Tomislav Smuc |
Discovery Science | 5 |
| 2013 | Phyletic Profiling with Cliques of Orthologs Is Enhanced by Signatures of Paralogy RelationshipsabstractNew microbial genomes are sequenced at a high pace, allowing insight into the genetics of not only cultured microbes, but a wide range of metagenomic collections such as the human microbiome. To understand the deluge of genomic data we face, computational approaches for gene functional annotation are invaluable. We introduce a novel model for computational annotation that refines two established concepts: annotation based on homology and annotation based on phyletic profiling. The phyletic profiling-based model that includes both inferred orthologs and paralogs-homologs separated by a speciation and a duplication event, respectively-provides more annotations at the same average Precision than the model that includes only inferred orthologs. For experimental validation, we selected 38 poorly annotated Escherichia coli genes for which the model assigned one of three GO terms with high confidence: involvement in DNA repair, protein translation, or cell wall synthesis. Results of antibiotic stress survival assays on E. coli knockout mutants showed high agreement with our model's estimates of accuracy: out of 38 predictions obtained at the reported Precision of 60%, we confirmed 25 predictions, indicating that our confidence estimates can be used to make informed decisions on experimental validation. Our work will contribute to making experimental validation of computational predictions more approachable, both in cost and time. Our predictions for 998 prokaryotic genomes include ~400000 specific annotations with the estimated Precision of 90%, ~19000 of which are highly specific-e.g. "penicillin binding," "tRNA aminoacylation for protein translation," or "pathogenesis"-and are freely available at http://gorbi.irb.hr/. Nives Skunca, Matko Bosnjak, Anita Krisko, Pance Panov, Saso Dzeroski, Tomislav Smuc, Fran Supek |
PLoS Comput. Biol. | 6 |
| 2012 | Descriptive Modeling of Systemic Banking Crises
Dragan Gamberger, Drazen Lucanin, Tomislav Smuc |
Discovery Science | 3 |
| 2008 | Language morphology offset: Text classification on a Croatian-English parallel corpus
Mislav Malenica, Tomislav Smuc, Jan Snajder, Bojana Dalbelo Basic |
Inf. Process. Manag. | 2 |
| 2001 | Coronary Heart Disease Patient Models Based on Inductive Machine Learning
Goran Krstacic, Dragan Gamberger, Tomislav Smuc |
AIME | 3 |
| 2001 | Combining Unsupervised and Supervised Machine Learning
Tomislav Smuc, Dragan Gamberger, Goran Krstacic |
AIME | 1 |