Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

8-2017

Abstract

Relative similarity learning (RSL) aims to learn similarity functions from data with relative constraints. Most previous algorithms developed for RSL are batch-based learning approaches which suffer from poor scalability when dealing with real world data arriving sequentially. These methods are often designed to learn a single similarity function for a specific task. Therefore, they may be sub-optimal to solve multiple task learning problems. To overcome these limitations, we propose a scalable RSL framework named OMTRSL (Online Multi-Task Relative Similarity Learning). Specifically, we first develop a simple yet effective online learning algorithm for multi-task relative similarity learning. Then, we also propose an active learning algorithm to save the labeling cost. The proposed algorithms not only enjoy theoretical guarantee, but also show high efficacy and efficiency in extensive experiments on real-world datasets.

Keywords

Artificial intelligence, E-learning, Active-learning algorithm, Learning approach, Online learning algorithms, Real-world datasets, Similarity functions, Similarity learning, Specific tasks, Theoretical guarantees, Learning algorithms

Discipline

Artificial Intelligence and Robotics | Databases and Information Systems | Theory and Algorithms

Research Areas

Data Science and Engineering

Publication

Proceedings of the 26th International Joint Conference on Artificial Intelligence IJCAI-17: Melbourne, Australia, August 19-25

First Page

1823

Last Page

1829

ISBN

9780999241103

Identifier

10.24963/ijcai.2017/253

Publisher

IJCAI

City or Country

San Francisco, CA

Copyright Owner and License

Publisher

Additional URL

https://doi.org/10.24963/ijcai.2017/253

Download

Share

COinS