Demo Data from SIGIR 2026 / reviewers in the wild / expert
Andrea Malossini
dblp:66/5656
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorApplied, 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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
gene expression analysis |
0.1 | 1 | 2006 | Detecting potential labeling errors in microarrays by data perturbation · Bioinform. 2006 |
Bioinformatics and computational biology › genomics
machine learning for genomics |
0.1 | 1 | 2006 | Detecting potential labeling errors in microarrays by data perturbation · Bioinform. 2006 |
Bioinformatics and computational biology › gene expression analysis
microarray data analysis |
0.1 | 1 | 2006 | Detecting potential labeling errors in microarrays by data perturbation · Bioinform. 2006 |
Methods — techniques the papers use, named apart from their topics
support vector machine · 0.1leave-one-out perturbation · 0.1classification stability · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Quantum Genetic OptimizationabstractThe complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness functions, is , where is the size of the population. The quantum genetic optimization algorithm (QGOA) exploits the power of quantum computation in order to speed up genetic procedures. In QGOA, the classical fitness evaluation and selection procedures are replaced by a single quantum procedure. While the quantum and classical genetic algorithms use the same number of generations, the QGOA requires fewer operations to identify the high-fitness subpopulation at each generation. We show that the complexity of our QGOA is in terms of number of oracle calls in the selection procedure. Such theoretical results are confirmed by the simulations of the algorithm. Andrea Malossini, Enrico Blanzieri, Tommaso Calarco |
IEEE Trans. Evol. Comput. | 1 |
| 2006 | Detecting potential labeling errors in microarrays by data perturbationabstractMOTIVATION: Classification is widely used in medical applications. However, the quality of the classifier depends critically on the accurate labeling of the training data. But for many medical applications, labeling a sample or grading a biopsy can be subjective. Existing studies confirm this phenomenon and show that even a very small number of mislabeled samples could deeply degrade the performance of the obtained classifier, particularly when the sample size is small. The problem we address in this paper is to develop a method for automatically detecting samples that are possibly mislabeled. RESULTS: We propose two algorithms, a classification-stability algorithm and a leave-one-out-error-sensitivity algorithm for detecting possibly mislabeled samples. For both algorithms, the key structure is the computation of the leave-one-out perturbation matrix. The classification-stability algorithm is based on measuring the stability of the label of a sample with respect to label changes of other samples and the version of this algorithm based on the support vector machine appears to be quite accurate for three real datasets. The suspect list produced by the version is of high quality. Furthermore, when human intervention is not available, the correction heuristic appears to be beneficial. Andrea Malossini, Enrico Blanzieri, Raymond T. Ng |
Bioinform. | 1 |