Search Results for author: Hamed Bonab

Found 9 papers, 3 papers with code

On-the-Fly Ensemble Pruning in Evolving Data Streams

no code implementations15 Sep 2021 Sanem Elbasi, Alican Büyükçakır, Hamed Bonab, Fazli Can

Ensemble pruning is the process of selecting a subset of componentclassifiers from an ensemble which performs at least as well as theoriginal ensemble while reducing storage and computational costs. Ensemble pruning in data streams is a largely unexplored area ofresearch.

Ensemble Pruning

Cross-Market Product Recommendation

1 code implementation13 Sep 2021 Hamed Bonab, Mohammad Aliannejadi, Ali Vardasbi, Evangelos Kanoulas, James Allan

We introduce and formalize the problem of cross-market product recommendation, i. e., market adaptation.

Domain Adaptation Meta-Learning +1

Query-driven Segment Selection for Ranking Long Documents

no code implementations10 Sep 2021 Youngwoo Kim, Razieh Rahimi, Hamed Bonab, James Allan

Transformer-based rankers have shown state-of-the-art performance.

A Multi-Task Architecture on Relevance-based Neural Query Translation

no code implementations ACL 2019 Sheikh Muhammad Sarwar, Hamed Bonab, James Allan

We describe a multi-task learning approach to train a Neural Machine Translation (NMT) model with a Relevance-based Auxiliary Task (RAT) for search query translation.

Cross-Lingual Information Retrieval Machine Translation +5

A Novel Online Stacked Ensemble for Multi-Label Stream Classification

1 code implementation26 Sep 2018 Alican Büyükçakır, Hamed Bonab, Fazli Can

As data streams become more prevalent, the necessity for online algorithms that mine this transient and dynamic data becomes clearer.

Classification General Classification +1

Less Is More: A Comprehensive Framework for the Number of Components of Ensemble Classifiers

no code implementations9 Sep 2017 Hamed Bonab, Fazli Can

In this paper, we use a geometric framework for a priori determining the ensemble size, which is applicable to most of existing batch and online ensemble classifiers.

Cannot find the paper you are looking for? You can Submit a new open access paper.