Demo Data from VLDB 2026 / reviewers in the wild / expert
Michal Draminski
dblp:39/6037
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0002-0354-5917ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Theory of computation · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene expression analysis
gene expression classification |
0.1 | 1 | 2008 | Monte Carlo feature selection for supervised classification · Bioinform. 2008 |
Methods — techniques the papers use, named apart from their topics
monte carlo sampling · 0.1decision tree · 0.1cross-validation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Random Reducts: A Monte Carlo Rough Set-based Method for Feature Selection in Large DatasetsabstractAn important step prior to constructing a classifier for a very large data set is feature selection. With many problems it is possible to find a subset of attributes that have the same discriminative power as the full data set. There are many feature selection methods but in none of them are Rough Set models tied up with statistical argumentation. Moreover, known methods of feature selection usually discard shadowed features, i.e. those carrying the same or partially the same information as the selected features. In this study we present Random Reducts (RR) - a feature selection method which precedes classification per se. The method is based on the Monte Carlo Feature Selection (MCFS) layout and uses Rough Set Theory in the feature selection process. On synthetic data, we demonstrate that the method is able to select otherwise shadowed features of which the user should be made aware, and to find interactions in the data set. Marcin Kruczyk, Nicholas Baltzer, Jakub Mieczkowski, Michal Draminski, Jacek Koronacki, Jan Komorowski |
Fundam. Informaticae | 4 |
| 2008 | Monte Carlo feature selection for supervised classificationabstractMOTIVATION: Pre-selection of informative features for supervised classification is a crucial, albeit delicate, task. It is desirable that feature selection provides the features that contribute most to the classification task per se and which should therefore be used by any classifier later used to produce classification rules. In this article, a conceptually simple but computer-intensive approach to this task is proposed. The reliability of the approach rests on multiple construction of a tree classifier for many training sets randomly chosen from the original sample set, where samples in each training set consist of only a fraction of all of the observed features. RESULTS: The resulting ranking of features may then be used to advantage for classification via a classifier of any type. The approach was validated using Golub et al. leukemia data and the Alizadeh et al. lymphoma data. Not surprisingly, we obtained a significantly different list of genes. Biological interpretation of the genes selected by our method showed that several of them are involved in precursors to different types of leukemia and lymphoma rather than being genes that are common to several forms of cancers, which is the case for the other methods. AVAILABILITY: Prototype available upon request. Michal Draminski, Alvaro Rada-Iglesias, Stefan Enroth, Claes Wadelius, Jacek Koronacki, Jan Komorowski |
Bioinform. | 1 |
| 2005 | Coexistence of Fuzzy and Crisp Concepts in Document Maps
Mieczyslaw A. Klopotek, Slawomir T. Wierzchon, Krzysztof Ciesielski, Michal Draminski, Dariusz Czerski |
ICANN (2) | 4 |