Design and Implementation of a Cost Effective Ranking Adaptation Algorithm

K.Chiranjeevi ¹ , K.Archana ² , J.Pradeep Kumar³

Section:Technical Paper, Product Type: Isroset-Journal
Vol.1 , Issue.5 , pp.24-24, Sep-2013

Online published on Oct 30, 2013

Copyright © K.Chiranjeevi , K.Archana , J.Pradeep Kumar . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Ranking plays an important role in vertical search domains as it helps users to view the best results quickly. This is required as search engines return huge number of records. Generally a ranking model is required for every domain as the data in each domain is different. However, it is tedious task to develop separate ranking model for each and every domain. A ranking model which can adapt to different domains can solve this problem. This paper proposes a new algorithm which adapts to various domains thus eliminating repetition of writing separate algorithm for each domain. An algorithm adapting to new domain reduces training cost thus making it cost-effective. We also proposed a ranking adaptability measurement for estimating the adaptability of ranking model. A prototype application is built to test the effectiveness of the application. The empirical results revealed that the proposed ranking model adaptation algorithm is capable of adapting to new domains.

Key-Words / Index Term :
Ranking, Ranking Adaptation, Domain Specific Search, Information Retrieval

References :
[1] C.J.C. Burges, R. Ragno, and Q.V. Le, “Learning to Rank with Nonsmooth Cost Functions,” Proc. Advances in Neural Information Processing Systems (NIPS ’06), pp. 193-200, 2006.

[2] Z. Cao and T. Yan Liu, “Learning to Rank: From Pairwise Approach to Listwise Approach,” Proc. 24th Int’l Conf. Machine Learning (ICML ’07), pp. 129-136, 2007.

[3] C.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender, “Learning to Rank Using

Gradient Descent,” Proc. 22th Int’l Conf. Machine Learning (ICML ’05), 2005.

[4] Y. Freund, R. Iyer, R.E. Schapire, Y. Singer, and G. Dietterich, “An Efficient Boosting Algorithm for Combining

Preferences,” J. Machine Learning Research, vol. 4, pp. 933-969, 2003.

[5] R. Herbrich, T. Graepel, and K. Obermayer, “Large Margin Rank Boundaries for Ordinal Regression,” Advances in
Large Margin Classifiers, pp. 115-132, MIT Press, 2000.


[6] T. Joachims, “Optimizing Search Engines Using Clickthrough Data,” Proc. Eighth ACM SIGKDD Int’l Conf.
Knowledge Discovery and Data Mining (KDD ’02), pp. 133-142, 2002.

[7] J. Blitzer, R. Mcdonald, and F. Pereira, “Domain Adaptation with Structural Correspondence Learning,” Proc. Conf.

Empirical Methods in Natural Language Processing (EMNLP ’06), pp. 120-128, July 2006.

[8] W. Dai, Q. Yang, G.-R. Xue, and Y. Yu, “Boosting for Transfer Learning,” Proc. 24th Int’l Conf. Machine Learning (ICML ’07), pp. 193-200, 2007.

[9] H. Shimodaira, “Improving Predictive Inference Under Covariate Shift by Weighting the Log-Likelihood Function,” J.
Statistical Planning and Inference, vol. 90, no. 18, pp. 227-244, 2000.

[10] J. Yang, R. Yan, and A.G. Hauptmann, “Cross-Domain Video Concept Detection Using Adaptive Svms,” Proc. 15th Int’l Conf. Multimedia, pp. 188-197, 2007.

[11] B. Zadrozny, “Learning and Evaluating Classifiers Under Sample Selection Bias,” Proc. 21st Int’l Conf. Machine Learning (ICML ’04), p. 114, 2004.

[12] R. Klinkenberg and T. Joachims, “Detecting Concept Drift with Support Vector Machines,” Proc. 17th Int’l Conf.
Machine Learning (ICML ’00), pp. 487-494, 2000.

[13] J. Lafferty and C. Zhai, “Document Language Models, Query Models, and Risk Minimization for Information Retrieval,” Proc. 24th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’01), pp. 111-119, 2001.

[14] J.M. Ponte and W.B. Croft, “A Language Modeling Approach to Information Retrieval,” Proc. 21st Ann. Int’l ACM

SIGIR Conf. Research and Development in Information Retrieval, pp. 275-281, 1998. GENG ET AL.: RANKING MODEL ADAPTATION FOR DOMAIN-SPECIFIC SEARCH 757

[15] S. Robertson and D.A. Hull, “The Trec-9 Filtering Track Final Report,” Proc. Ninth Text Retrieval Conf., pp. 25-40, 2000.

[16] H. Daume III and D. Marcu, “Domain Adaptation for Statistical Classifiers,” J. Artificial Intelligence Research, vol.

26, pp. 101-126, 2006.

[17] J.M. Kleinberg, S.R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, “The Web as a Graph: Measurements, Models and Methods,” Proc. Int’l Conf. Combinatorics and Computing, pp. 1-18, 1999.

[18] L. Page, S. Brin, R. Motwani, and T. Winograd, “The Pagerank Citation Ranking: Bringing Order to the Web,” technical report, Stanford Univ., 1998.

[19] V.N. Vapnik, Statistical Learning Theory. Wiley-Interscience, 1998.

[20] F. Girosi, M. Jones, and T. Poggio, “Regularization Theory and Neural Networks Architectures,” Neural Computation, vol. 7, pp. 219-269, 1995.