Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hubert Wassner

dblp:38/5261 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
1 paper
Multi-agent systems · 33% Learning theory · 33% Probabilistic and Bayesian machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › hypothesis testing
a/b testing
0.712023
Dynamic Allocation Optimization in A/B-Tests Using Classification-Based Preprocessing · IEEE Trans. Knowl. Data Eng. 2023
Knowledge, reasoning and agents › Multi-agent systems › task allocation
dynamic allocation
0.712023
Dynamic Allocation Optimization in A/B-Tests Using Classification-Based Preprocessing · IEEE Trans. Knowl. Data Eng. 2023
Machine learning › Probabilistic and Bayesian machine learning
experimental design
0.712023
Dynamic Allocation Optimization in A/B-Tests Using Classification-Based Preprocessing · IEEE Trans. Knowl. Data Eng. 2023

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 0.7classification-based preprocessing · 0.7
YearPublicationVenuePosition
2023 Dynamic Allocation Optimization in A/B-Tests Using Classification-Based Preprocessing
abstract
AnA/B-Testevaluates the impact of a new technology by running it in a real production environment and testing its performance on a set of items. Recent development efforts aroundA/B-Testsrevolve around dynamic allocation. They allow for quicker determination of the best variation (A or B), thus saving money for the user. However, dynamic allocation by traditional methods requires certain assumptions, which are not always valid in reality. This is often due to the fact that the populations being tested are not homogeneous. This article reports on a new reinforcement learning methodology which has been deployed by the commercialA/B-Testplatform AB Tasty. We provide a new method that not only builds homogeneous groups of users, but also allows the best variation for these groups to be found in a short period of time. This article provides numerical results on AB Tasty's data, in addition to public datasets, tha demonstrate an improvement over traditional methods.
Emmanuelle Claeys, Pierre Gançarski, Myriam Maumy-Bertrand, Hubert Wassner
IEEE Trans. Knowl. Data Eng.4
2017 Regression Tree for Bandits Models in A/B Testing
Emmanuelle Claeys, Pierre Gançarski, Myriam Maumy-Bertrand, Hubert Wassner
IDA4
1997 Integrating acoustic and labial information for speaker identification and verification
abstract
LIDIAP
Pierre Jourlin, Jürgen Lüttin, Dominique Genoud, Hubert Wassner
EUROSPEECH4
1997 Acoustic-labial speaker verification
abstract
This paper describes a multimodal approach for speaker verification. The system consists of two classifiers, one using visual features, the other using acoustic features. A lip tracker is used to extract visual information from the speaking face which provides shape and intensity features. We describe an approach for normalizing and mapping different modalities onto a common confidence interval. We also describe a novel method for integrating the scores of multiple classifiers. Verification experiments are reported for the individual modalities and for the combined classifier. The integrated system outperformed each sub-system and reduced the false acceptance rate of the acoustic sub-system from 2.3% to 0.5%.
Pierre Jourlin, Jürgen Lüttin, Dominique Genoud, Hubert Wassner
Pattern Recognit. Lett.4
1996 New cepstral representation using wavelet analysis and spectral transformation for robust speech recognition
abstract
The goal is to improve recognition rate by optimisation of Mel Frequency Cepstral Coecients (MFCCs): modications concern the time-frequency representations used to estimate these coecients.There are many w a ys to obtain a spectrum out of a signal which dier in the method itself (Fourier, Wavelets,...), and in the normalisation.We show here that we can obtain noise resistant cepstral coecients, for speaker independent connected word recognition.The recognition system is based on a continuous whole word hidden Markov model.An error reduction rate of approximately 50% is achieved with word models.
Hubert Wassner, Gérard Chollet
ICSLP1