<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to RankLib</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>Recent changes to RankLib</description><atom:link href="https://sourceforge.net/p/lemur/wiki/RankLib/feed" rel="self"/><language>en</language><lastBuildDate>Wed, 16 Oct 2019 15:36:05 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/lemur/wiki/RankLib/feed" rel="self" type="application/rss+xml"/><item><title>RankLib modified by Michael Zarozinski</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v17
+++ v18
@@ -50,11 +50,6 @@

 # #

-#### Older Versions ####
-Older versions of RankLib (before it moved into the Lemur Project) can be found [here](http://people.cs.umass.edu/~vdang/ranklib.html).
-
-# #
-
 #### License ####
 RankLib is available under [BSD license](http://people.cs.umass.edu/~vdang/ranklib_license.html).

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Michael Zarozinski</dc:creator><pubDate>Wed, 16 Oct 2019 15:36:05 -0000</pubDate><guid>https://sourceforge.net8fa7bb1559b92678b6f24011d5539808e32fbe99</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v16
+++ v17
@@ -68,4 +68,4 @@
 \[5\] Q. Wu, C.J.C. Burges, K. Svore and J. Gao. Adapting Boosting for Information Retrieval Measures. Journal of Information Retrieval, 2007.
 \[6\] J.H. Friedman. Greedy function approximation: A gradient boosting machine. Technical Report, IMS Reitz Lecture, Stanford, 1999; see also Annals of Statistics, 2001.
 \[7\] Z. Cao, T. Qin, T.Y. Liu, M. Tsai and H. Li. Learning to Rank: From Pairwise Approach to Listwise Approach. ICML 2007. 
-\[8\] J.H. Friedman. Greedy function approximation: A gradient boosting machine. Annals of Statistics 29: 1189–1232, 1999.
+\[8\] L. Breiman. Random Forests. Machine Learning 45 (1): 5–32, 2001.
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Sat, 05 Oct 2013 00:58:52 -0000</pubDate><guid>https://sourceforge.nete8b45492b741095ce3aba8994931e9c42cdb943d</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 17:48:19 -0000</pubDate><guid>https://sourceforge.net56dabfc3f6d17034a51a6df4c74b17970f61b7b5</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v14
+++ v15
@@ -46,7 +46,7 @@
 # #

 #### Community Contribution ####
-If you want to contribute (ideas, codes, etc.) to make RankLib better, let us know in the [community contribution forum](https://sourceforge.net/p/lemur/discussion/communitycontribution/).
+If you want to contribute (ideas, codes, etc.) to make RankLib better, let me know in the [community contribution forum](https://sourceforge.net/p/lemur/discussion/communitycontribution/).

 # #

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 17:21:42 -0000</pubDate><guid>https://sourceforge.netbc937042bc69e5c15f8064b6ff32847adb9f414f</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v13
+++ v14
@@ -55,6 +55,11 @@

 # #

+#### License ####
+RankLib is available under [BSD license](http://people.cs.umass.edu/~vdang/ranklib_license.html).
+
+# #
+
 #### References ####
 \[1\]  C.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton and G. Hullender. Learning to rank using gradient descent. In Proc. of ICML, pages 89-96, 2005.
 \[2\] Y. Freund, R. Iyer, R. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. The Journal of Machine Learning Research, 4: 933-969, 2003.
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 17:19:38 -0000</pubDate><guid>https://sourceforge.netba9d44e2ec0ca3abed176d9344e4360d482a11f2</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v12
+++ v13
@@ -1,6 +1,10 @@
 ## RankLib ##

 -----
+
+# #
+
+#### Overview ####

 RankLib is a library of learning to rank algorithms. Currently eight popular algorithms have been implemented: 

@@ -42,7 +46,7 @@
 # #

 #### Community Contribution ####
-If you want to contribute (ideas, codes, etc) to make Ranklib better, let us know in the [community contribution forum](https://sourceforge.net/p/lemur/discussion/communitycontribution/).
+If you want to contribute (ideas, codes, etc.) to make RankLib better, let us know in the [community contribution forum](https://sourceforge.net/p/lemur/discussion/communitycontribution/).

 # #

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 15:29:55 -0000</pubDate><guid>https://sourceforge.netfeea84ab94325ce725f2903f1b9e39290d2cd8ac</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v11
+++ v12
@@ -31,6 +31,26 @@

 # #

+#### Bug Report &amp; Feature Request ####
+Use the sourceforge toolbar  right above this page: "Tickets" -&gt; "Bugs" and "Feature Requests".
+
+# #
+
+#### General Questions &amp; Discussions ####
+Use the [discussion forum](https://sourceforge.net/p/lemur/discussion/ranklib/).
+
+# #
+
+#### Community Contribution ####
+If you want to contribute (ideas, codes, etc) to make Ranklib better, let us know in the [community contribution forum](https://sourceforge.net/p/lemur/discussion/communitycontribution/).
+
+# #
+
+#### Older Versions ####
+Older versions of RankLib (before it moved into the Lemur Project) can be found [here](http://people.cs.umass.edu/~vdang/ranklib.html).
+
+# #
+
 #### References ####
 \[1\]  C.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton and G. Hullender. Learning to rank using gradient descent. In Proc. of ICML, pages 89-96, 2005.
 \[2\] Y. Freund, R. Iyer, R. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. The Journal of Machine Learning Research, 4: 933-969, 2003.
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 15:22:24 -0000</pubDate><guid>https://sourceforge.net545fb6cd000a734b20c477d2bc9458c37033667b</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v10
+++ v11
@@ -22,6 +22,12 @@
 * [Download &amp; Install](https://sourceforge.net/p/lemur/wiki/RankLib%20Installation/)
 * [File Format](https://sourceforge.net/p/lemur/wiki/RankLib%20File%20Format/)
 * [How to use](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use/)
+    * [Cmd-line parameters](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use/)
+    * [Train models from held-out data](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use#training)
+    * [k-fold cross validation](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use#kcv)
+    * [Evaluate pre-trained models](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use#eval)
+    * [Compare models](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use#compare_models)
+    * [Use pre-trained models for ranking](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use#ranking)

 # #

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 14:56:46 -0000</pubDate><guid>https://sourceforge.net673dbc101a023c711e2a0364d25ee87a4ca51fd2</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v9
+++ v10
@@ -1,4 +1,6 @@
 ## RankLib ##
+
+-----

 RankLib is a library of learning to rank algorithms. Currently eight popular algorithms have been implemented: 

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 14:22:38 -0000</pubDate><guid>https://sourceforge.net2d247072e62289895cb478a03643721caa66c610</guid></item><item><title>RankLib modified by Van Dang</title><link>https://sourceforge.net/p/lemur/wiki/RankLib/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v8
+++ v9
@@ -1,4 +1,4 @@
-# RankLib #
+## RankLib ##

 RankLib is a library of learning to rank algorithms. Currently eight popular algorithms have been implemented: 

@@ -13,15 +13,17 @@

 It also implements many retrieval metrics as well as provides many ways to carry out evaluation.

+# #

-### Getting Started ###
+#### Getting Started ####

-* [RankLib Installation]
-* [RankLib File Format]
-* [RankLib How to use]
+* [Download &amp; Install](https://sourceforge.net/p/lemur/wiki/RankLib%20Installation/)
+* [File Format](https://sourceforge.net/p/lemur/wiki/RankLib%20File%20Format/)
+* [How to use](https://sourceforge.net/p/lemur/wiki/RankLib%20How%20to%20use/)

+# #

-### References ###
+#### References ####
 \[1\]  C.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton and G. Hullender. Learning to rank using gradient descent. In Proc. of ICML, pages 89-96, 2005.
 \[2\] Y. Freund, R. Iyer, R. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. The Journal of Machine Learning Research, 4: 933-969, 2003.
 \[3\] J. Xu and H. Li. AdaRank: a boosting algorithm for information retrieval. In Proc. of SIGIR, pages 391-398, 2007.
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Van Dang</dc:creator><pubDate>Wed, 14 Aug 2013 14:17:43 -0000</pubDate><guid>https://sourceforge.net11efc2b5546d9b20aed0a0064fe91553fc759177</guid></item></channel></rss>