Cross-domain ranking via latent space learning
Cross-domain ranking via latent space learning
We study the problem of cross-domain ranking, which addresses learning to rank objects from multiple interrelated domains. In many applications, we may have multiple interrelated domains, some of them with a large amount of training data and others with very little. We often wish to utilize the training data from all these related domains to help improve ranking performance. In this paper, we present a unified model: BayCDR for cross-domain ranking. BayCDR uses a latent space to measure the correlation between different domains, and learns the ranking functions from the interrelated domains via the latent space by a Bayesian model, where each ranking function is based on a weighted average model. An efficient learning algorithm based on variational inference and a generalization bound has been developed. To scale up to handle real large data, we also present a learning algorithm under the Map-Reduce programming model. Finally, we demonstrate the effectiveness and efficiency of BayCDR on large datasets.
cross-domain ranking, heterogeneous ranking, Machine Learning
2618-2624
Tang, Jie
69c44bae-b1fa-45eb-a01d-3ac5b00fa749
Hall, Wendy
11f7f8db-854c-4481-b1ae-721a51d8790c
13 February 2017
Tang, Jie
69c44bae-b1fa-45eb-a01d-3ac5b00fa749
Hall, Wendy
11f7f8db-854c-4481-b1ae-721a51d8790c
Tang, Jie and Hall, Wendy
(2017)
Cross-domain ranking via latent space learning.
In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence and the Twenty-Ninth Innovative Applications of Artificial Intelligence Conference.
AAAI Press.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
We study the problem of cross-domain ranking, which addresses learning to rank objects from multiple interrelated domains. In many applications, we may have multiple interrelated domains, some of them with a large amount of training data and others with very little. We often wish to utilize the training data from all these related domains to help improve ranking performance. In this paper, we present a unified model: BayCDR for cross-domain ranking. BayCDR uses a latent space to measure the correlation between different domains, and learns the ranking functions from the interrelated domains via the latent space by a Bayesian model, where each ranking function is based on a weighted average model. An efficient learning algorithm based on variational inference and a generalization bound has been developed. To scale up to handle real large data, we also present a learning algorithm under the Map-Reduce programming model. Finally, we demonstrate the effectiveness and efficiency of BayCDR on large datasets.
Text
14459-66941-1-PB
- Version of Record
Restricted to Repository staff only
Request a copy
More information
Accepted/In Press date: 11 November 2016
Published date: 13 February 2017
Venue - Dates:
Thirty-First AAAI Conference on Artificial Intelligence, , San Francisco, United States, 2017-02-04 - 2017-02-09
Keywords:
cross-domain ranking, heterogeneous ranking, Machine Learning
Organisations:
Web & Internet Science
Identifiers
Local EPrints ID: 411954
URI: http://eprints.soton.ac.uk/id/eprint/411954
PURE UUID: 4d359b34-be73-441f-95a5-d44d485ab3d6
Catalogue record
Date deposited: 03 Jul 2017 16:31
Last modified: 16 Mar 2024 02:33
Export record
Contributors
Author:
Jie Tang
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics