Dimension reduction for supervised ordering

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 330-339

  Kamishima, Toshihiro ^a   Akaho, Shotaro ^a  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSION REDUCTIONS; SUPERVISED ORDERING; WEB SEARCH RESULTS;

LEARNING SYSTEMS; ONLINE SEARCHING; SORTING; WORLD WIDE WEB;

DATA PROCESSING;

EID: 84862083527     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.53     Document Type: Conference Paper

References (23)

1. B. C. Arnold, N. Balakrishnan, and H. N. Nagaraja. A First Course in Order Statistics. John Wiley & Sons, Inc., 1992.
2. A. Bahamonde, G. F. Bayón, J. D. J. R. Quevedo, O. Luaces, J. J. del Coz, J. Alonso, and F. Goyache. Feature subset selection for learning preferences: A case study. In Proc. of The 21st Int'l Conf. on Machine Learning, pages 49-56, 2004.
3. C. Burges, T Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender. Learning to rank using gradient descent. In Proc. of The 22nd Int'l Conf. on Machine Learning, pages 89-96, 2005.
4. W. W. Cohen, R. E. Schapire, and Y. Singer. Learning to order things. Journal of Artificial Intelligence Research, 10:243-270, 1999.
5. L. Deng, J. Pei, J. Ma, and D.-L. Lee. A rank sum test method for informative gene discovery. In Proc. of The 10th Int'l Conf. on Knowledge Discovery and Data Mining, pages 410-419, 2004.
6. M. Dettling and P. Bühlmann. Supervised clustering of genes. Genome Biology, 3(12):research0069.1-0069.15, 2002.
7. P Diaconis. A generalization of spectral analysis with application to ranked data. The Annals of Statistics, 17(3): 949-979, 1989.
8. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969, 2003.
9. R. Herbrich, T Graepel, P. Bollmann-Sdorra, and K. Obermayer. Learning preference relations for information retrieval. In ICML-98 Workshop: Text Categorization and Machine Learning, pages 80-84, 1998.
10. R. Herbrich, T Graepel, and K. Obermayer. Support vector learning for ordinal regression. In Proc. of the 9th Int'l Conf. on Artificial Neural Networks, pages 97-102, 1999.
11. T. Joachims. Optimizing search engines using clickthrough data. In Proc. of The 8th Int'l Conf. on Knowledge Discovery and Data Mining, pages 133-142, 2002.
12. T Kamishima. Homepage, http://www.kamishima.net/.
13. T Kamishima and S. Akaho. Filling-in missing objects in orders. In Proc. of The 4th IEEE Int'l Conf. on Data Mining, pages 423-426, 2004.
14. T Kamishima, H. Kazawa, and S. Akaho. Supervised ordering -an empirical survey. In Proc. of The 5th IEEE Int'l Conf. on Data Mining, pages 673-676, 2005.
15. H. Kazawa, T Hirao, and E. Maeda. Order SVM: a kernel method for order learning based on generalized order statistics. Systems and Computers in Japan, 36(1):35-43, 2005.
16. M. Kendall and J. D. Gibbons. Rank Correlation Methods. Oxford University Press, fifth edition, 1990.
17. O. Luaces, G. F. Bayón, J. R. Quevedo, J. Diez, J. J. del Coz, and A. Bahamonde. Analyzing sensory data using non-linear preference learning with feature subset selection. In Proc. of the 15th European Conf. on Machine Learning, pages 286-297, 2004. [LNAI 3201].
18. J. I. Marden. Analyzing and Modeling Rank Data, volume 64 of Monographs on Statistics and Applied Probability. Chapman & Hall, 1995.
19. P McCullagh. Regression models for ordinal data. Journal of The Royal Statistical Society (B), 42(2): 109-142, 1980.
20. F. Radlinski and T Joachims. Query chains: Learning to rank from implicit feedback. In Proc. of The 11th Int'l Conf. on Knowledge Discovery and Data Mining, pages 239-248, 2005.
21. A. Shashua and A. Levin. Ranking with large margin principle: Two approaches. In Advances in Neural Information Processing Systems 15, pages 961-968, 2003.
22. D. J. Slotta, J. R Vergara, N. Ramakrishnan, and L. S. Heath. Algorithms for feature selection in rank-order spaces. Technical Report TR-05-08, Computer Science, Virginia Tech., 2005.
23. H. Yu. SVM selective sampling for ranking with application to data retrieval. In Proc. of The 11th Int'l Conf. on Knowledge Discovery and Data Mining, pages 354-363, 2005.