Abstract
Ranking has been applied in many domains using recommendation systems such as search engine, e-commerce, and so on. We will introduce and study N-linear mutual ranking, which can rank n classes of objects at once. The ranking scores of these classes are dependent to the others. For instance, PageRank by Google is a 2-linear mutual ranking, which ranks the webpages and links at once. Particularly, we focus to N-star ranking model and demonstrate it in ranking conference and journal problems. We have conducted the experiments for the models in which the citations are not considered. The experimental results are based on the DBLP dataset, which contains more than one million papers, authors and thousands of conferences and journals in computer science. Finally, N-star ranking is a very strong ranking algorithm can be applied in many real-world problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brin, S., Page, L.: The anatomy of a large-scale hypertextual web search engine. In: Proceedings of the 7th International World Wide Web Conference, pp. 107–117 (1998)
Keener, J.: The Perron-Frobenius theorem and the ranking of football teams. SIAM Review 35(1), 80–93 (1993)
Kien, L.T., Hieu, L.T., Hung, T.L., Vu, L.A.: MpageRank: The Stability of Web Graph. Vietnam Journal of Mathematics 37, 475–489 (2009)
Sidiropoulos, A., Katsaros, D., Manolopoulos, Y.: Generalized Hirsch h-index for disclosing latent facts in citation networks. Scientometrics 72(2), 253–280 (2006)
Ley, M., Reuther, P.: Maintaining an Online Bibliographical Database: The Problem of Data Quality. EGC 2006, 5–10 (2006)
Ley, M.: DBLP - Some Lessons Learned. PVLDB 2(2), 1493–1500 (2009)
Furukawa, T., Okamoto, S., Matsuo, Y., Ishizuka, M.: Prediction of social bookmarking based on a behavior transition model. In: Proceedings of the 2010 ACM Symposium on Applied Computing, pp. 1741–1747 (2010)
Rendle, S., Freudenthaler, C., Thieme, L.S.: Factorizing personalized Markov chains for next-basket recommendation. In: Proceedings of the 19th International Conference on World Wide Web, pp. 811–820 (2010)
Freudenthaler, C., Rendle, S., Thieme, L.S.: Factorizing Markov Models for Categorical Time Series Prediction. In: Proceedings of ICNAAM, pp. 405–409 (2011)
Microsoft Corporation: Microsoft Academic Search (June 26, 2013), http://academic.research.microsoft.com/
Collins, M.: Ranking algorithms for named-entity extraction: Boosting and the voted perceptron. In: Proceedings of the 40th Annual Meeting on Association for Computational Linguistics, pp. 489–496 (2002)
Vercoustre, A.-M., Thom, J.A., Pehcevski, J.: Entity ranking in Wikipedia. In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC 2008), pp. 1101–1106 (2008)
Cronin, B.: Bibliometrics and beyond: Some thoughts on web-based citation analysis. Journal of Information Science 27(1), 1–7 (2001)
Nie, Z., Zhang, Y., Wen, J., Ma, W.: Object-Level Ranking: Bringing Order to Web Objects, Study of the eXplicit Control Protocol (XCP). IEEE Infocom (2005)
Snchez-Burillo, E., Duch, J., Gmez-Gardenes, J., Zueco, D.: Quantum Navigation and Ranking in Complex Networks Nature online journal (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Le Anh, V., Vo Hoang, H., Le Trung, K., Le Trung, H., Jung, J.J. (2014). A General Model for Mutual Ranking Systems. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds) Intelligent Information and Database Systems. ACIIDS 2014. Lecture Notes in Computer Science(), vol 8397. Springer, Cham. https://doi.org/10.1007/978-3-319-05476-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-05476-6_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05475-9
Online ISBN: 978-3-319-05476-6
eBook Packages: Computer ScienceComputer Science (R0)