22 research outputs found
Deep Multi-view Learning to Rank
We study the problem of learning to rank from multiple information sources.
Though multi-view learning and learning to rank have been studied extensively
leading to a wide range of applications, multi-view learning to rank as a
synergy of both topics has received little attention. The aim of the paper is
to propose a composite ranking method while keeping a close correlation with
the individual rankings simultaneously. We present a generic framework for
multi-view subspace learning to rank (MvSL2R), and two novel solutions are
introduced under the framework. The first solution captures information of
feature mappings from within each view as well as across views using
autoencoder-like networks. Novel feature embedding methods are formulated in
the optimization of multi-view unsupervised and discriminant autoencoders.
Moreover, we introduce an end-to-end solution to learning towards both the
joint ranking objective and the individual rankings. The proposed solution
enhances the joint ranking with minimum view-specific ranking loss, so that it
can achieve the maximum global view agreements in a single optimization
process. The proposed method is evaluated on three different ranking problems,
i.e. university ranking, multi-view lingual text ranking and image data
ranking, providing superior results compared to related methods.Comment: Published at IEEE TKD
Sufficient Canonical Correlation Analysis
Canonical correlation analysis (CCA) is an effective
way to find two appropriate subspaces in which Pearson’s correlation
coefficients are maximized between projected random vectors.
Due to its well-established theoretical support and relatively
efficient computation, CCA is widely used as a joint dimension
reduction tool and has been successfully applied to many image
processing and computer vision tasks. However, as reported,
the traditional CCA suffers from overfitting in many practical
cases. In this paper, we propose sufficient CCA (S-CCA) to
relieve CCA’s overfitting problem, which is inspired by the theory
of sufficient dimension reduction. The effectiveness of S-CCA
is verified both theoretically and experimentally. Experimental
results also demonstrate that our S-CCA outperforms some of
CCA’s popular extensions during the prediction phase, especially
when severe overfitting occurs