Name
Abstract | ||
|---|---|---|
Learning to rank utilizes machine learning methods to solve ranking problems by constructing ranking models in a supervised way, which needs fixed-length feature vectors of documents as inputs, and outputs the ranking models learned by iteratively reducing the pre-defined ranking loss. The document features are always extracted based on classic textual statistics, and different features contribute differently to ranking performance. Given that well-defined features would contribute more to the retrieval performance, we investigate the usage of autoencoders to enrich the feature representations of documents. Autoencoders, as basic building blocks of deep neural networks, have been successfully used in many text mining tasks for generating effective features. To enrich the feature space for learning to rank, we introduce supervision into the loss functions of autoencoders. Specifically, we first train a linear ranking model on the training data, and then incorporate the learned weights into the reconstruction costs of an autoencoder. Meanwhile, we accumulate the costs of documents for a given query with query-level constraints for producing more useful features. We evaluate the effectiveness of our model on three LETOR datasets, and show that our model can generate effective document features to improve the retrieval performance.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3132847.3133049 | CIKM |
Keywords | Field | DocType |
Learning to rank, autoencoders, semi-supervised learning | Training set,Learning to rank,Data mining,Feature vector,Semi-supervised learning,Autoencoder,Ranking,Computer science,Artificial intelligence,Machine learning,Deep neural networks | Conference |
ISBN | Citations | PageRank |
978-1-4503-4918-5 | 0 | 0.34 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bo Xu | 1 | 95 | 28.26 |
| Hongfei Lin | 2 | 768 | 122.52 |
| Yuan Lin | 3 | 99 | 10.66 |
| Kan Xu | 4 | 47 | 12.73 |