scholarly journals Pivot Selection Strategies for Permutation-Based Similarity Search

Author(s):  
Giuseppe Amato ◽  
Andrea Esuli ◽  
Fabrizio Falchi
2010 ◽  
Vol E93-D (6) ◽  
pp. 1422-1432 ◽  
Author(s):  
Hisashi KURASAWA ◽  
Daiji FUKAGAWA ◽  
Atsuhiro TAKASU ◽  
Jun ADACHI

Author(s):  
Xia Cui ◽  
Noor Al-Bazzaz ◽  
Danushka Bollegala ◽  
Frans Coenen

AbstractSelecting pivot features that connect a source domain to a target domain is an important first step in unsupervised domain adaptation (UDA). Although different strategies such as the frequency of a feature in a domain, mutual (or pointwise mutual) information have been proposed in prior work in domain adaptation (DA) for selecting pivots, a comparative study into (a) how the pivots selected using existing strategies differ, and (b) how the pivot selection strategy affects the performance of a target DA task remain unknown. In this paper, we perform a comparative study covering different strategies that use both labelled (available for the source domain only) as well as unlabelled (available for both the source and target domains) data for selecting pivots for UDA. Our experiments show that in most cases pivot selection strategies that use labelled data outperform their unlabelled counterparts, emphasising the importance of the source domain labelled data for UDA. Moreover, pointwise mutual information and frequency-based pivot selection strategies obtain the best performances in two state-of-the-art UDA methods.


Author(s):  
Lindsey M. Kitchell ◽  
Francisco J. Parada ◽  
Brandi L. Emerick ◽  
Tom A. Busey

Sign in / Sign up

Export Citation Format

Share Document