Demo Data from EDBT 2026 / reviewers in the wild / expert
Aleks Jakulin
dblp:50/7027
· DBLP profile ↗
7ranked-venue papers
5as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 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.
| Artificial intelligence
2 papers |
Probabilistic and Bayesian machine learning · 64% Trustworthy machine learning · 36% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
0.1 | 1 | 2005 | Nomograms for visualizing support vector machines · KDD 2005 |
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models |
0.0 | 1 | 2004 | Testing the significance of attribute interactions · ICML 2004 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
structure learning |
0.0 | 1 | 2004 | Testing the significance of attribute interactions · ICML 2004 |
Visualization and visual analytics
model visualization |
0.0 | 1 | 2005 | Nomograms for visualizing support vector machines · KDD 2005 |
Methods — techniques the papers use, named apart from their topics
nomograms · 0.1logistic regression · 0.1kirkwood superposition approximation · 0.0chi-squared test · 0.0bootstrap · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Bayesian Learning of Markov Network Structure
Aleks Jakulin, Irina Rish |
ECML | 1 |
| 2006 | Acquiring an Ontology from the Text
Nuria Casellas, Aleks Jakulin, Joan-Josep Vallbé, Pompeu Casanovas |
IEA/AIE | 2 |
| 2005 | Nomograms for visualizing support vector machinesabstractWe propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphically encode the complete model on a single page. The dimensionality of the visualization does not depend on the number of attributes, but merely on the properties of the kernel. To represent the effect of each predictive feature on the log odds ratio scale as required for the nomograms, we employ logistic regression to convert the distance from the separating hyperplane into a probability. Case studies on selected data sets show that for a technique thought to be a black-box, nomograms can clearly expose its internal structure. By providing an easy-to-interpret visualization the analysts can gain insight and study the effects of predictive factors. Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan Bratko, Blaz Zupan |
KDD | 1 |
| 2004 | Testing the significance of attribute interactionsabstractAttribute interactions are the irreducible dependencies between attributes. Interactions underlie feature relevance and selection, the structure of joint probability and classification models: if and only if the attributes interact, they should be connected. While the issue of 2-way interactions, especially of those between an attribute and the label, has already been addressed, we introduce an operational definition of a generalized n-way interaction by highlighting two models: the reductionistic part-to-whole approximation, where the model of the whole is reconstructed from models of the parts, and the holistic reference model, where the whole is modelled directly. An interaction is deemed significant if these two models are significantly different. In this paper, we propose the Kirkwood superposition approximation for constructing part-to-whole approximations. To model data, we do not assume a particular structure of interactions, but instead construct the model by testing for the presence of interactions. The resulting map of significant interactions is a graphical model learned from the data. We confirm that the P-values computed with the assumption of the asymptotic X2 distribution closely match those obtained with the boot-strap. Aleks Jakulin, Ivan Bratko |
ICML | 1 |
| 2004 | Applying Discrete PCA in Data Analysis
Wray L. Buntine, Aleks Jakulin |
UAI | 2 |
| 2003 | Attribute Interactions in Medical Data Analysis
Aleks Jakulin, Ivan Bratko, Dragica Smrke, Janez Demsar, Blaz Zupan |
AIME | 1 |
| 2003 | Analyzing Attribute Dependencies
Aleks Jakulin, Ivan Bratko |
PKDD | 1 |