Utilization of Efficient Features, Vectors and Machine Learning for Ranking Techniques
Abstract
Document ranking systems and recommender systems are two of the most
used applications on the internet. Document ranking systems search for documents
in response to a query given by the user. On the other hand, recommender
systems suggest items to the users on the basis of their previously expressed preferences.
Both document ranking systems and recommender systems make use
of ranking techniques, since they typically present their results in the form of a
ranked list. The order of the results is important because the users expect the
most useful results at the top of these ranked lists.
Improvements in algorithms used by document ranking systems and recommender
systems, including the utilization of advanced machine learning techniques,
lead to the generation of improved rankings. Moreover, advanced document
ranking systems often use features collected from the documents to generate
rankings. Similarly, vectors generated for the users as well as items are utilized
by the recommender systems. Therefore, generation of features and vectors
of good quality is instrumental for ranking techniques.
This dissertation makes the following contributions to explore the improvements
in ranking techniques using efficient features, vectors and machine learning:
a) Creation of a feature extraction algorithm for learning to rank tasks in document
ranking, b) Creation of pairwise preference vectors of ratings on items by
using neural embeddings that can be utilized in machine learning tasks including
recommender systems, c) Utilization of deep neural networks and transfer
learning for serendipitous recommendations, d) Recommendations using ranking
probabilities and non-negative matrix factorization and e) Application of neural
embeddings to search for cities and tours, taking user’s travel interests into
account.
Keywords: Ranking, Information Retrieval, Recommender Systems, Deep Learning,
Neural Embedding, Serendipitous Recommendations
Main Author
Format
Theses
Doctoral thesis
Published
2019
Series
ISBN
978-951-39-7806-8
Publisher
Jyväskylän yliopisto
The permanent address of the publication
https://urn.fi/URN:ISBN:978-951-39-7806-8Use this for linking
ISSN
2489-9003
Language
English
Published in
JYU Dissertations
Contains publications
- Artikkeli I: Pandey, G., Ren, Z., Wang, S., Veijalainen, J., & Rijke, M. d. (2018). Linear feature extraction for ranking. Information Retrieval, 21 (6), 481-506. DOI: 10.1007/s10791-018-9330-5
- Artikkeli II: Pandey, G., Wang, S., Ren, Z., & Chang, Y. (2019). Vectors of Pairwise Item Preferences. In L. Azzopardi, B. Stein, N. Fuhr, P. Mayr, C. Hauff, & D. Hiemstra (Eds.), ECIR 2019: Advances in Information Retrieval : 41st European Conference on IR Research, ECIR 2019, Cologne, Germany, April 14–-8, 2019, Proceedings, Part I (pp. 323-336). Cham: Springer. DOI: 10.1007/978-3-030-15712-8_21
- Artikkeli III: Pandey, G., Kotkov, D., & Semenov, A. (2018). Recommending Serendipitous Items using Transfer Learning. In CIKM '18 : Proceedings of the 27th ACM International Conference on Information and Knowledge Management (pp. 1771-1774). ACM Press. DOI: 10.1145/3269206.3269268
- Artikkeli IV: Pandey, G., & Wang, S. (2018). Listwise Recommendation Approach with Non-negative Matrix Factorization. In I. Czarnowski, R. J. Howlett, L. C. Jain, & L. Vlacic (Eds.), KES-IDT 2018 : Proceedings of the 10th International KES Conference on Intelligent Decision Technologies (pp. 22-32). Cham: Springer. DOI: 10.1007/978-3-319-92028-3_3
- Artikkeli V: Maksoud, M. A., Pandey, G., & Wang, S. (2017). CitySearcher: A City Search Engine For Interests. In SIGIR '17 : Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 1141-1144). New York: ACM. DOI: 10.1145/3077136.3080742
- Artikkeli VI: Maksoud, Mohamed Abdul; Pandey, Gaurav; Wang, Shuaiqiang (2018). Finding tours for a set of interests. In WWW '18 Companion: The 2018 Web Conference Companion, April 23–27, 2018, Lyon, France. ACM, New York, NY, USA. DOI: 10.1145/3184558.3186982
Copyright© The Author & University of Jyväskylä