Differences

This shows you the differences between two versions of the page.

--- public:ranking [2009/06/19 00:38] – 建立 htlin
+++ public:ranking [2024/09/04 04:00] (current) – external edit 127.0.0.1
@@ Line 18: / Line 18: @@
 we want the machines to automatically
 rank/recommend the songs based on our personal tastes.
+====== Our Related Works ======
+===== paper =====
+  * Yu-Xun Ruan, Hsuan-Tien Lin and Ming-Feng Tsai, Improving Ranking Performance with Cost-sensitive Ordinal Classification via Regression,  Improving Ranking Performance with Cost-sensitive Ordinal Classification via Regression. Information Retrieval, 2013. [[http://www.csie.ntu.edu.tw/~htlin/paper/doc/cocr.pdf|link]]
+  * Hsuan-Tien Lin and Ling Li. Reduction from Cost-sensitive Ordinal Ranking to Weighted Binary Classification. Neural Computation, to appear. Some preliminary parts appeared in NIPS '06 and PL Workshop @ ECML/PKDD '09. [[http://www.csie.ntu.edu.tw/~htlin/paper/doc/redordinal.pdf|link]]
+  * Ming-Feng Tsai, Shang-Tse Chen, Yao-Nan Chen, Chun-Sung Ferng, Chia-Hsuan Wang, Tzay-Yeu Wen and Hsuan-Tien Lin. An Ensemble Ranking Solution to the Yahoo! Learning to Rank Challenge. National Taiwan University, Technical Report, September 2010. [[http://www.csie.ntu.edu.tw/~htlin/paper/doc/wsltr10ensemble.pdf|link]]
+  * Hsuan-Tien Lin and Ling Li. Combining Ordinal Preferences by Boosting. Preference Learning Workshop @ ECML/PKDD '09, 2009. [[http://www.csie.ntu.edu.tw/~htlin/paper/doc/wspl09adaboostor.pdf|link]]
+===== thesis =====
+  * Yu-Xun Ruan. Studies on Ordinal Ranking with Regression. Master's Thesis, 2010.
+  * Ken-Yi Lin. Data Selection Techniques for Large-scale RankSVM. Master's Thesis, 2009.