395 search results - page 32 / 79 » Learning to rank with partially-labeled data |
108
click to vote
WWW
2009
ACM
16 years 2 months ago
2009
ACM
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
135
click to vote
WSDM
2010
ACM
15 years 6 months ago
2010
ACM
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
140
click to vote
ISNN
2004
Springer
15 years 7 months ago
2004
Springer
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
123
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Pattern ordering is an important task in data mining because the number of patterns extracted by standard data mining algorithms often exceeds our capacity to manually analyze the...
100
click to vote
AIMS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We discuss an approach to reducing the number of events accepted by anomaly detection systems, based on alternative schemes for interest-ranking. The basic assumption is ...