Sciweavers

440 search results - page 9 / 88
» A Fast Algorithm for Learning a Ranking Function from Large-...
Sort
View
WWW
2011
ACM
13 years 2 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
BMCBI
2006
164views more  BMCBI 2006»
13 years 8 months ago
Evaluation of clustering algorithms for gene expression data
Background: Cluster analysis is an integral part of high dimensional data analysis. In the context of large scale gene expression data, a filtered set of genes are grouped togethe...
Susmita Datta, Somnath Datta
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
14 years 8 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
TFS
2008
230views more  TFS 2008»
13 years 7 months ago
SGERD: A Steady-State Genetic Algorithm for Extracting Fuzzy Classification Rules From Data
Abstract--This paper considers the automatic design of fuzzyrule-based classification systems from labeled data. The performance of classifiers and the interpretability of generate...
Eghbal G. Mansoori, Mansoor J. Zolghadri, Seraj D....
SIGIR
2011
ACM
12 years 10 months ago
Pseudo test collections for learning web search ranking functions
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
Nima Asadi, Donald Metzler, Tamer Elsayed, Jimmy L...