An eigenvalue-based pivot selection strategy for improving search efficiency in metric spaces

Author(s):  
Sung-Hwan Kim ◽  
Da-Young Lee ◽  
Hwan-Gue Cho
2017 ◽  
Vol 20 (4) ◽  
pp. 3643-3655
Author(s):  
Sung-Hwan Kim ◽  
Da-Young Lee ◽  
Hwan-Gue Cho

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Cai Dai ◽  
Xiujuan Lei

Brain storm optimization (BSO) algorithm is a simple and effective evolutionary algorithm. Some multiobjective brain storm optimization algorithms have low search efficiency. This paper combines the decomposition technology and multiobjective brain storm optimization algorithm (MBSO/D) to improve the search efficiency. Given weight vectors transform a multiobjective optimization problem into a series of subproblems. The decomposition technology determines the neighboring clusters of each cluster. Solutions of adjacent clusters generate new solutions to update population. An adaptive selection strategy is used to balance exploration and exploitation. Besides, MBSO/D compares with three efficient state-of-the-art algorithms, e.g., NSGAII and MOEA/D, on twenty-two test problems. The experimental results show that MBSO/D is more efficient than compared algorithms and can improve the search efficiency for most test problems.


2019 ◽  
Vol 62 (6) ◽  
pp. 2349-2382 ◽  
Author(s):  
Guillermo Ruiz ◽  
Edgar Chavez ◽  
Ubaldo Ruiz ◽  
Eric S. Tellez

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.


2003 ◽  
Vol 24 (14) ◽  
pp. 2357-2366 ◽  
Author(s):  
Benjamin Bustos ◽  
Gonzalo Navarro ◽  
Edgar Chávez

1969 ◽  
Vol 130 (1-6) ◽  
pp. 277-303 ◽  
Author(s):  
Aloysio Janner ◽  
Edgar Ascher

Sign in / Sign up

Export Citation Format

Share Document