Carrer Can Planes s/n, Campus de la UAB
08193 Bellaterra
Seminari tècnic en anglès “Investigating performance and scalability issues for rank learning with regression tree ensembles”, a càrrec de Mark Carman, de Monash University (Australia), organitzat per l’Institut d’Investigació en Intel·ligència Artificial.
When ranking Web pages against user queries (and their associated context), there exist a large number of signals that can be leveraged to determine relevance. Such signals include the similarity between the user’s query (/profile) and various parts of the document or related anchor-text, the recency of the content, spam scores, etc. Rank learning algorithms provide a coherent framework for determining the best way to combine these signals in order to maximise retrieval performance. As such, they have become a crucial component of current Information Retrieval infrastructure.
State-of-the-art rank-learning techniques discover non-linear combinations of features and are mostly based on ensembles of regression trees, using either bagged & randomised regressors (as in Random Forests) or boosted ensembles (as in Gradient-boosted methods). With an interest in both the performance and scalability of these algorithms, we investigate the importance of three different aspects: (i) the number of negative examples used to train the algorithm, (ii) the size of the subsample used to learn individual trees, and (iii) the type of objective function used to recursively partition the feature space.
Més informació
Imatge: IIIA-CSIC
Imprimeix