Email this article 
Open Access
Subscription or Fee Access
A Methodology to Study the Rank Aggregation in the Context of the Web
Abstract
Now a days Internet has become a vast source to retrieve information and more over size of accessed information’s has been enlarging day by day. It is to be concentrated that any method to access the information needs a proper ordering to get perfect information. As web users are getting the problems of information overload because of significant and rapid growth in the amount of information t be accessed and the number of users therefore there is need to design a platform for Web users for exactly needed information which is becoming a critical issue in web-based information retrieval and Web applications In this paper we are proposing a new algorithm to rank aggregation method and it could be analyzed that our methodology has the advantage of being applicable in a variety of contexts and tries to use as much information as available. Our method is simple for implementation and do not have any computational overhead as compared to other methods
Keywords
References
Meng, W., Yu, C., & Liu, K.-L., Building efficient and effective
metasearch engines. ACMComputing Surveys, 2001, 34(1), 48–89.
Aslam, J. A., Montague, M., Models for metasearch. In: Proceedings of
the 24th ACMSIGIR conference (pp. 276–284), 2001.
Cynthia Dwork, Ravi Kumar, Moni Naor, D Siva Kumar, Rank
Aggregation Methods for the web. In proceedings of the Tenth World
Wide Web Conference, 2001.
Amitay, E., Carmel, D., Lempel, R., & So.er, A., Scaling IR-system
evaluation using term relevance sets. In Proceedings of the 27th
ACMSIGIR conference, 2004, pp. 10–17.
Soboro., I., Nicholas, C., & Cahan, P. Ranking retrieval systems without
relevance judgments. In Proceedings of the 24th ACM SIGIR
conference, 2001, pp. 66–73.
Croft, W. B., Combining approaches to information retrieval. In W. B.
Croft (Ed.), Advances in information retrieval: recent research from the
center for intelligent information retrieval. Kluwer Academic Publishers,
Fan, W., Fox, E. A., Pathak, P., & Wu, H. The effects of fitness
functions on generic programming-based ranking discovery for Web
search. Journal of the American Society for Information Science and
Technology, 55(7), 2004, 628–636.
Hawking, D., Craswel, N., Bailey, P., & Gri.ths, K., Measuring search
engine quality. Information Retrieval, 4(1), 2005, 33–59.
Nuray, R., & Can, F., Automatic ranking of retrieval systems in
imperfect environments. In Proceedings of the 26th ACM SIGIR
conference 2003, pp. 379–380.
L. F. Cranor. Declared-Strategy Voting: An Instrument for Group
Decision-Making. Ph. D.
Thesis,WashingtonUniversity,1996.http://www.research.att.com/lorrie/p
ubs/diss/
C. Dwork, R. Kumar, M. Naor, D. Sivakumar. Rank Aggregation
Methods for the Web. Manuscript.
G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum
feedback sets and multicuts in directed
R. Fagin. Combining Fuzzy information from multiple systems. JCSS,
(1):83–99, 1999.
R. Fagin, M. Franklin, A. Lotem, and M. Naor, Optimal Aggregation
Algorithms for Middleware. manuscript,2000
Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer. An efficient boosting
algorithm for combining preferences.Proc. 15th International
Conference on Machine Learning, 1998.
Bing Zhou and Yiyu Yao, “Evaluating Information Retrieval System
Performance Based on User Preference” Journal of Intelligent
Information Systems Volume 34 Issue 3, June 2010 Pages 227-248
Shengli Wu and Sally McClean2 “ Several methods of ranking retrieval
systems with partial relevance judgment” in Journal of Information
Assurance and Security 2 (2007) 257-265”
Y.-T. Liu, T.-Y. Liu, T. Qin, Z.-M. Ma, and H. Li. Supervised rank
aggregation. In Proceedings of the 16th international conference on
World Wide Web, WWW ’07, pages 481–490, New York, NY, USA,
K. Subbian and P. Melville. Supervised rank aggregation for predicting
influence in networks. In the proceedings of the IEEE Conference on
Social Computing (SocialCom-2011)., Boston, October 2011.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.