A parallel mixture of SVMs for very large scale problems
Neural Computation
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
An analysis of cooperative coevolutionary algorithms
An analysis of cooperative coevolutionary algorithms
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Learning to rank: from pairwise approach to listwise approach
Proceedings of the 24th international conference on Machine learning
AdaRank: a boosting algorithm for information retrieval
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to rank using evolutionary computation: immune programming or genetic programming?
Proceedings of the 18th ACM conference on Information and knowledge management
A library to run evolutionary algorithms in the cloud using mapreduce
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Parallelizing ListNet training using spark
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Improving on-demand learning to rank through parallelism
WISE'12 Proceedings of the 13th international conference on Web Information Systems Engineering
Cloud driven design of a distributed genetic programming platform
EvoApplications'13 Proceedings of the 16th European conference on Applications of Evolutionary Computation
| Hi-index | 0.00 |
Learning to rank represents a category of effective ranking methods for information retrieval. While the primary concern of existing research has been accuracy, learning efficiency is becoming an important issue due to the unprecedented availability of large-scale training data and the need for continuous update of ranking functions. In this paper, we investigate parallel learning to rank, targeting simultaneous improvement in accuracy and efficiency.