{"id":626,"date":"2023-11-01T14:26:18","date_gmt":"2023-11-01T19:26:18","guid":{"rendered":"https:\/\/groups.cs.umass.edu\/zamani\/?page_id=626"},"modified":"2024-04-01T12:08:48","modified_gmt":"2024-04-01T17:08:48","slug":"compsci-546-applied-information-retrieval-spring-2024","status":"publish","type":"page","link":"https:\/\/groups.cs.umass.edu\/zamani\/compsci-546-applied-information-retrieval-spring-2024\/","title":{"rendered":"COMPSCI 546: Applied Information Retrieval \u2013 Spring 2024"},"content":{"rendered":"\n\n\n<p>COMPSCI 546 is a graduate level course intended to cover information retrieval and other information processing activities, from an applied perspective. There will be numerous programming projects and assignments. It provides a richer technical follow on to COMPSCI 446 (Search Engines), for undergraduates interested in a deeper understanding of the technologies. It also provides a strong basis for continuing on with COMPSCI 646 (Information Retrieval), for those graduate students who are interested in a more complete theoretical coverage of the area. Topics will include: search engine construction (document acquisition, processing, indexing, and querying); learning to rank; information retrieval system performance evaluation; classification and clustering; other machine learning information processing tasks (e.g., basic deep learning models for information retrieval); and many more. Undergraduate prerequisites: COMPSCI 320 and either COMPSCI 383, COMPSCI 446, or COMPSCI 585. 3 credits.<\/p>\n<p><a href=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/time-icon.png\"><img decoding=\"async\" class=\"alignnone wp-image-254\" src=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/time-icon-150x150.png\" alt=\"\" width=\"45\" height=\"45\" srcset=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/time-icon-150x150.png 150w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/time-icon.png 225w\" sizes=\"(max-width: 45px) 100vw, 45px\" \/><\/a>Tue &amp; Thu, 4:00 &#8211; 5:15 PM<\/p>\n<p><a href=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/location-icon.png\"><img decoding=\"async\" class=\"alignnone wp-image-258\" src=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/location-icon-150x150.png\" alt=\"\" width=\"45\" height=\"45\" srcset=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/location-icon-150x150.png 150w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/location-icon-300x300.png 300w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/08\/location-icon.png 512w\" sizes=\"(max-width: 45px) 100vw, 45px\" \/><\/a>CS 142<\/p>\n<hr \/>\n<table style=\"width: 100%;border-collapse: collapse;border-style: none\">\n<tbody>\n<tr>\n<td style=\"width: 30.2381%;border-style: none\"><a href=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/07\/zamani-photo-2-1.png\"><img decoding=\"async\" class=\"alignnone wp-image-78 size-thumbnail\" src=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/07\/zamani-photo-2-1-150x150.png\" alt=\"Hamed Zamani - UMass Amherst\" width=\"150\" height=\"150\" srcset=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/07\/zamani-photo-2-1-150x150.png 150w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/07\/zamani-photo-2-1-300x297.png 300w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2021\/07\/zamani-photo-2-1.png 404w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/td>\n<td style=\"width: 69.7619%;border-style: none\">\n<p><strong>Instructor:<\/strong><br \/>Hamed Zamani<br \/>Contact: zamani@cs.umass.edu<br \/>Office Hours: Tue, 9:00 &#8211; 10:00 AM @ CS 350<\/p>\n<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 30.2381%;border-style: none\"><a href=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2024\/01\/hasnain.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone wp-image-659 size-thumbnail\" src=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2024\/01\/hasnain-150x150.jpg\" alt=\"\" width=\"150\" height=\"150\" srcset=\"https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2024\/01\/hasnain-150x150.jpg 150w, https:\/\/groups.cs.umass.edu\/zamani\/wp-content\/uploads\/sites\/41\/2024\/01\/hasnain.jpg 300w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/a><\/td>\n<td style=\"width: 69.7619%;border-style: none\"><strong>Teaching Assistant:<\/strong><br \/>Hasnain Heickal<br \/>Contact: hheickal@cs.umass.edu<br \/>Office Hours: Mon, 9:00 &#8211; 11:00 AM @ CS 207<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<hr \/>\n<h2>Prerequisites<\/h2>\n<ul>\n<li>Proficiency in Python and\/or Java<\/li>\n<li>Basic knowledge of probability, statistics, and information theory<\/li>\n<li>Foundations of applied machine learning and deep learning<\/li>\n<\/ul>\n<h2><br \/>Textbook<\/h2>\n<ul>\n<li><b>[WBC]<\/b>\u00a0W. Bruce Croft, Donald Metzler, and Trevor Strohman.\u00a0<a href=\"http:\/\/ciir.cs.umass.edu\/irbook\/\">Search Engines: Information Retrieval in Practice<\/a>. Pearson Education, 2009.<\/li>\n<li><b>[CDM]<\/b>\u00a0Christopher D. Manning, Prabhakar Raghavan, and Hinrich Sch\u00fctze.\u00a0<a href=\"http:\/\/nlp.stanford.edu\/IR-book\/\">Introduction to Information Retrieval<\/a>. Cambridge University Press, 2008.<\/li>\n<\/ul>\n<h2>\u00a0<\/h2>\n<h2>Grading<\/h2>\n<ul>\n<li>Assignments ((8-1)x10%) &#8211; Your lowest grade assignment would be discarded.<\/li>\n<li>Final exam (30%)<\/li>\n<\/ul>\n<p>\u00a0<\/p>\n<h2>Tentative Schedule<\/h2>\n<table style=\"width: 100.117%;height: 2045px\">\n<tbody>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 24px\" width=\"50px\">#<\/td>\n<td style=\"width: 23.4154%;height: 24px\" width=\"300px\">Lecture<\/td>\n<td style=\"width: 9.58876%;height: 24px\" width=\"100px\">Date<\/td>\n<td style=\"width: 24.5155%;height: 24px\" width=\"500px\">Readings<\/td>\n<td style=\"width: 24.5155%;height: 24px\">Note<\/td>\n<\/tr>\n<tr style=\"height: 66px\">\n<td style=\"width: 5.15789%;height: 66px\">1<\/td>\n<td style=\"width: 23.4154%;height: 66px\">Introduction<\/td>\n<td style=\"width: 9.58876%;height: 66px\">2\/1<\/td>\n<td style=\"width: 24.5155%;height: 132px\" rowspan=\"2\">\n<ul>\n<li>[WBC] Ch.1<\/li>\n<li>[WBC] Ch.7.1<\/li>\n<li>[CDM] Ch.8.1, 8.2<\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 132px\" rowspan=\"2\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 66px\">\n<td style=\"width: 5.15789%;height: 66px\">2<\/td>\n<td style=\"width: 23.4154%;height: 66px\">IR Basics<\/td>\n<td style=\"width: 9.58876%;height: 66px\">2\/6<\/td>\n<\/tr>\n<tr style=\"height: 105px\">\n<td style=\"width: 5.15789%;height: 64px\">3<\/td>\n<td style=\"width: 23.4154%;height: 134px\" rowspan=\"2\">IR Evaluation and Ranking Metrics<\/td>\n<td style=\"width: 9.58876%;height: 64px\">2\/8<\/td>\n<td style=\"width: 24.5155%;height: 134px\" rowspan=\"2\">\n<ul>\n<li>[CDM] Ch.8.3, 8.4<\/li>\n<li>(optional) NDCG:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=582418\" target=\"\\blank\" rel=\"noopener\">J\u00e4rvelin and Kek\u00e4l\u00e4inen (TOIS 2002)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"height: 64px;width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 105px\">\n<td style=\"width: 5.15789%;height: 70px\">4<\/td>\n<td style=\"width: 9.58876%;height: 70px\">2\/13<\/td>\n<td style=\"width: 24.5155%;height: 70px\">Assignment 1 (IR Metrics)<\/td>\n<\/tr>\n<tr style=\"height: 66px\">\n<td style=\"width: 5.15789%;height: 63px\">5<\/td>\n<td style=\"width: 23.4154%;height: 129px\" rowspan=\"2\">Text Processing and Indexing<\/td>\n<td style=\"width: 9.58876%;height: 63px\">2\/15<\/td>\n<td style=\"height: 129px;width: 24.5155%\" rowspan=\"2\">\n<ul>\n<li>[WBC] Ch.4.1, 4.2, 4.3<\/li>\n<li>[WBC] Ch.5.1, 5.2, 5.3, 5.4, 5.7<\/li>\n<\/ul>\n<\/td>\n<td style=\"height: 63px;width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 66px\">\n<td style=\"width: 5.15789%;height: 66px\">6<\/td>\n<td style=\"width: 9.58876%;height: 66px\">2\/20<\/td>\n<td style=\"width: 24.5155%;height: 66px\">Assignment 2 (Text Processing &amp; Indexing)<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 5.15789%\">\u00a0<\/td>\n<td style=\"width: 23.4154%\"><span style=\"color: #ff0000\">No Class (Monday Class Schedule)<\/span><\/td>\n<td style=\"width: 9.58876%\">2\/22<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 76px\">\n<td style=\"width: 5.15789%;height: 73px\">7<\/td>\n<td style=\"width: 23.4154%;height: 148px\" rowspan=\"2\">Basic Retrieval Models<\/td>\n<td style=\"width: 9.58876%;height: 73px\">2\/27<\/td>\n<td style=\"width: 24.5155%;height: 148px\" rowspan=\"2\">\n<ul>\n<li>[CDM] Ch.6.2, 6.3, 6.4<\/li>\n<li>[CDM] Ch.11.1, 11.2, 11.3, 11.4.3<\/li>\n<li>(optional) LSI: <a href=\"https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/%28SICI%291097-4571%28199009%2941%3A6%3C391%3A%3AAID-ASI1%3E3.0.CO%3B2-9\" target=\"_blank\" rel=\"noopener\">Deerwester et al. (JASIS 1990)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 148px\" rowspan=\"2\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 75px\">\n<td style=\"width: 5.15789%;height: 75px\">8<\/td>\n<td style=\"width: 9.58876%;height: 75px\">2\/29<\/td>\n<\/tr>\n<tr style=\"height: 219px\">\n<td style=\"width: 5.15789%;height: 43px\">9<\/td>\n<td style=\"width: 23.4154%;height: 187px\" rowspan=\"2\">Language Models for IR<\/td>\n<td style=\"width: 9.58876%;height: 43px\">3\/5<\/td>\n<td style=\"width: 24.5155%;height: 187px\" rowspan=\"2\">\n<ul>\n<li>[CDM] Ch.12.1, 12.2, 12.3, 12.4<\/li>\n<li>[WBC] Ch.11.3<\/li>\n<li>(optional) Query likelihood:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=291008\" target=\"\\blank\" rel=\"noopener\">Ponte and Croft (SIGIR 1998)<\/a><\/li>\n<li>(optional) KL-divergence retrieval model:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=383970\" target=\"\\blank\" rel=\"noopener\">Lafferty and Zhai (SIGIR 2001)<\/a><\/li>\n<li>(optional) Language model smoothing:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=984322\" target=\"\\blank\" rel=\"noopener\">Zhai and Lafferty (TOIS 2004)<\/a><\/li>\n<li>(optional) Cluster-based LM:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=1009026\" target=\"\\blank\" rel=\"noopener\">Liu and Croft (SIGIR 2004)<\/a><\/li>\n<li>(optional) Dependence models:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=1076115\" target=\"\\blank\" rel=\"noopener\">Metzler and Croft (SIGIR 2005)<\/a><\/li>\n<li>(optional) Positional LM:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=1571994\" target=\"\\blank\" rel=\"noopener\">Lv and Zhai (SIGIR 2009)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 43px\">If you are interested in learning more about language modeling for IR, the book &#8220;<a href=\"https:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00158ED1V01Y200811HLT001\" target=\"\\blank\" rel=\"noopener\">Statistical Language Models for Information Retrieval<\/a>&#8221; by ChengXiang Zhai is recommended.<\/td>\n<\/tr>\n<tr style=\"height: 144px\">\n<td style=\"width: 5.15789%;height: 144px\">10<\/td>\n<td style=\"width: 9.58876%;height: 144px\">3\/7<\/td>\n<td style=\"width: 24.5155%;height: 144px\">Assignment 3 (Retrieval Models)<\/td>\n<\/tr>\n<tr style=\"height: 362px\">\n<td style=\"width: 5.15789%;height: 236px\">11<\/td>\n<td style=\"width: 23.4154%;height: 236px\">Query Expansion and Relevance Feedback<\/td>\n<td style=\"width: 9.58876%;height: 236px\">3\/12<\/td>\n<td style=\"width: 24.5155%;height: 236px\">\n<ul>\n<li>[WBC] Ch.7.3.2<\/li>\n<li>(optional) Relevance models:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=3130376\" target=\"\\blank\" rel=\"noopener\">Lavrenko and Croft (SIGIR 2001)<\/a><\/li>\n<li>(optional) Model-based feedback:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=502654\" target=\"\\blank\" rel=\"noopener\">Zhai and Lafferty (CIKM 2001)<\/a><\/li>\n<li>(optional) Matrix factorization model:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2983844\" target=\"\\blank\" rel=\"noopener\">Zamani et al. (CIKM 2016)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 236px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 16px\">\n<td style=\"width: 5.15789%;height: 16px\">12<\/td>\n<td style=\"height: 26px;width: 23.4154%\">Web Search and Search Engine Technologies<\/td>\n<td style=\"width: 9.58876%;height: 16px\">3\/14<\/td>\n<td style=\"height: 26px;width: 24.5155%\">\n<ul>\n<li>[CDM] Ch.21<\/li>\n<li>(optional) PageRank:\u00a0<a href=\"http:\/\/ilpubs.stanford.edu:8090\/422\/1\/1999-66.pdf\" target=\"\\blank\" rel=\"noopener\">Page et al. (1998)<\/a><\/li>\n<li>(optional) HITS:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=324140\" target=\"\\blank\" rel=\"noopener\">Kleinberg (JACM 1999)<\/a><\/li>\n<li>(optional) Waterloo spam scorer:\u00a0<a href=\"https:\/\/link.springer.com\/article\/10.1007\/s10791-011-9162-z\" target=\"\\blank\" rel=\"noopener\">Cormack et al. (IRJ 2011)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"height: 16px;width: 24.5155%\">Assignment 4 (Query Expansion)<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 5.15789%\">\u00a0<\/td>\n<td style=\"width: 23.4154%\"><span style=\"color: #ff0000\">No Class (Spring Break)<\/span><\/td>\n<td style=\"width: 9.58876%\">3\/19<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr>\n<td style=\"width: 5.15789%\">\u00a0<\/td>\n<td style=\"width: 23.4154%\"><span style=\"color: #ff0000\">No Class (Spring Break)<\/span><\/td>\n<td style=\"width: 9.58876%\">3\/21<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 10px\">\n<td style=\"width: 5.15789%;height: 10px\">13<\/td>\n<td style=\"width: 23.4154%\">Web Search and Search Engine Technologies (cont&#8217;d)<\/td>\n<td style=\"width: 9.58876%;height: 10px\">3\/26<\/td>\n<td style=\"width: 24.5155%\">\u00a0<\/td>\n<td style=\"width: 24.5155%;height: 10px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 24px\">16<\/td>\n<td style=\"width: 23.4154%;height: 24px\">Novelty and Diversity<\/td>\n<td style=\"width: 9.58876%;height: 24px\">3\/28<\/td>\n<td style=\"width: 24.5155%;height: 24px\">\n<ul>\n<li>Maximal Marginal Relevance (MMR):\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=291025\" target=\"\\blank\" rel=\"noopener\">Carbonell and Goldstein (SIGIR 1998)<\/a><\/li>\n<li>Novelty and diversity evaluation:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=1390446\" target=\"\\blank\" rel=\"noopener\">Clarke et al. (SIGIR 2008)<\/a><\/li>\n<li>(optional) Subtopic retrieval using language models:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=860440\" target=\"\\blank\" rel=\"noopener\">Zhai et al. (SIGIR 2003)<\/a><\/li>\n<li>(optional) Term-level diversification:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2484095\" target=\"\\blank\" rel=\"noopener\">Dang and Croft (SIGIR 2013)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 24px\">\n<p>Assignment 5 (Link Analysis)<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 24px\">17<\/td>\n<td style=\"width: 23.4154%;height: 24px\">Machine Learning Basics<\/td>\n<td style=\"width: 9.58876%;height: 24px\">4\/2<\/td>\n<td style=\"width: 24.5155%;height: 24px\">\n<p>\u00a0<\/p>\n<\/td>\n<td style=\"width: 24.5155%;height: 24px\">\n<p>\u00a0<\/p>\n<\/td>\n<\/tr>\n<tr style=\"height: 68px\">\n<td style=\"width: 5.15789%;height: 68px\">18<\/td>\n<td style=\"height: 68px;width: 23.4154%\">Document Clustering and Classification<\/td>\n<td style=\"width: 9.58876%;height: 68px\">4\/4<\/td>\n<td style=\"height: 68px;width: 24.5155%\">\n<p>\u00a0<\/p>\n<\/td>\n<td style=\"height: 68px;width: 24.5155%\">Assignment 6 (Clustering)<\/td>\n<\/tr>\n<tr style=\"height: 67px\">\n<td style=\"width: 5.15789%;height: 67px\">19<\/td>\n<td style=\"width: 23.4154%;height: 67px\">Learning to Rank<\/td>\n<td style=\"width: 9.58876%;height: 67px\">4\/9<\/td>\n<td style=\"width: 24.5155%;height: 67px\">\n<ul>\n<li>LTR Textbook:\u00a0<a href=\"https:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00348ED1V01Y201104HLT012\" target=\"\\blank\" rel=\"noopener\">Li (2011)<\/a>\u00a0Ch.1, 2, 6<\/li>\n<li>(optional) LTR Textbook:\u00a0<a href=\"https:\/\/www.morganclaypool.com\/doi\/abs\/10.2200\/S00348ED1V01Y201104HLT012\" target=\"\\blank\" rel=\"noopener\">Li (2011)<\/a>\u00a0Ch.4<\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 67px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 105px\">\n<td style=\"width: 5.15789%;height: 105px\">20<\/td>\n<td style=\"width: 23.4154%;height: 105px\">Introduction to Neural Networks and Neural IR<\/td>\n<td style=\"width: 9.58876%;height: 105px\">4\/11<\/td>\n<td style=\"width: 24.5155%;height: 105px\">\u00a0<\/td>\n<td style=\"width: 24.5155%;height: 105px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 219px\">\n<td style=\"width: 5.15789%;height: 205px\">21<\/td>\n<td style=\"width: 23.4154%;height: 205px\">\n<p>Distributed Representation Learning for Text<\/p>\n<\/td>\n<td style=\"width: 9.58876%;height: 205px\">4\/16<\/td>\n<td style=\"width: 24.5155%;height: 205px\">\n<ul>\n<li>word2vec:\u00a0<a href=\"http:\/\/papers.nips.cc\/paper\/5021-distributed-representations-of-words-andphrases\" target=\"\\blank\" rel=\"noopener\">Mikolov et al. (NIPS 2013)<\/a><\/li>\n<li>(optional) GloVe:\u00a0<a href=\"https:\/\/nlp.stanford.edu\/pubs\/glove.pdf\" target=\"\\blank\" rel=\"noopener\">Pennington et al. (EMNLP 2014)<\/a><\/li>\n<li>(optional) Relevance-based Word Embedding:\u00a0<a href=\"http:\/\/doi.acm.org\/10.1145\/3077136.3080831\" target=\"\\blank\" rel=\"noopener\">Zamani and Croft (SIGIR 2017)<\/a><\/li>\n<li>(optional) Embedding-based Query Expansion:\u00a0<a href=\"http:\/\/doi.acm.org\/10.1145\/2970398.2970405\" target=\"\\blank\" rel=\"noopener\">Zamani and Croft (ICTIR 2016)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 205px\">Assignment 7 (Learning to Rank)<\/td>\n<\/tr>\n<tr style=\"height: 162px\">\n<td style=\"width: 5.15789%;height: 40px\">22<\/td>\n<td style=\"width: 23.4154%;height: 80px\" rowspan=\"2\">Neural Ranking Models<\/td>\n<td style=\"width: 9.58876%;height: 40px\">4\/18<\/td>\n<td style=\"width: 24.5155%;height: 80px\" rowspan=\"2\">\n<ul>\n<li>(optional) DSSM:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2505665\" target=\"\\blank\" rel=\"noopener\">Huang et al. (CIKM 2013)<\/a><\/li>\n<li>(optional) K-NRM:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=3080809\" target=\"\\blank\" rel=\"noopener\">Xiong et al. (SIGIR 2017)<\/a><\/li>\n<li>(optional) Duet Model:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=3052579\" target=\"\\blank\" rel=\"noopener\">Mitra et al. (WWW 2017)<\/a><\/li>\n<li>(optional) SNRM:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=3271800\" target=\"\\blank\" rel=\"noopener\">Zamani et al. (CIKM 2018)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"width: 24.5155%;height: 80px\" rowspan=\"2\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 219px\">\n<td style=\"width: 5.15789%;height: 40px\">23<\/td>\n<td style=\"width: 9.58876%;height: 40px\">4\/23<\/td>\n<\/tr>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 58px\">24<\/td>\n<td style=\"width: 23.4154%;height: 58px\"><span style=\"color: #000000\">Question Answering<\/span><\/td>\n<td style=\"width: 9.58876%;height: 58px\">4\/25<\/td>\n<td style=\"width: 24.5155%;height: 58px\">\u00a0<\/td>\n<td style=\"width: 24.5155%;height: 58px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 80px\">\n<td style=\"width: 5.15789%;height: 72px\">25<\/td>\n<td style=\"width: 23.4154%;height: 139px\" rowspan=\"2\">Information Filtering and Recommendation<\/td>\n<td style=\"width: 9.58876%;height: 72px\">4\/30<\/td>\n<td style=\"width: 24.5155%;height: 139px\" rowspan=\"2\">\n<ul>\n<li>(optional) Information Retrieval and Information Filtering:\u00a0<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=138861\" target=\"\\blank\" rel=\"noopener\">Belkin and Croft (CACM 1992)<\/a><\/li>\n<li>(optional) Recommender Systems Handbook:\u00a0<a href=\"https:\/\/www.springer.com\/us\/book\/9781489976369\" target=\"\\blank\" rel=\"noopener\">Ricci et al. (2015)<\/a><\/li>\n<\/ul>\n<\/td>\n<td style=\"height: 72px;width: 24.5155%\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 80px\">\n<td style=\"width: 5.15789%;height: 67px\">26<\/td>\n<td style=\"width: 9.58876%;height: 67px\">5\/2<\/td>\n<td style=\"width: 24.5155%;height: 67px\">Assignment 8 (Collaborative Filtering)<\/td>\n<\/tr>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 54px\">27<\/td>\n<td style=\"width: 23.4154%;height: 54px\">IR Applications<\/td>\n<td style=\"width: 9.58876%;height: 54px\">5\/7<\/td>\n<td style=\"width: 24.5155%;height: 54px\">\u00a0<\/td>\n<td style=\"width: 24.5155%;height: 54px\">\u00a0<\/td>\n<\/tr>\n<tr style=\"height: 24px\">\n<td style=\"width: 5.15789%;height: 53px\">28<\/td>\n<td style=\"width: 23.4154%;height: 53px\">IR Research<\/td>\n<td style=\"width: 9.58876%;height: 53px\">5\/9<\/td>\n<td style=\"width: 24.5155%;height: 53px\">\u00a0<\/td>\n<td style=\"width: 24.5155%;height: 53px\">\u00a0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<h2>\u00a0<\/h2>\n<h2>Course Policy<\/h2>\n<h3>Late Submission<\/h3>\n<p>Each student has a total of 5 late days without penalty. You can use up to 3 late days per assignment.\u00a0<br \/><br \/>Once all 5 late days are used, any assignments turned in late will be penalized 20% (absolute grade) per late day.<br \/><br \/>In case of multiple submissions of an assignment, only the last one will be taken into account for the number of late days.<\/p>\n<h3>Collaboration and Help<\/h3>\n<p>You may discuss the ideas behind assignments with others. You may ask for help understanding class and IR concepts. You may study with friends. However&#8230;<br \/><br \/>The work that you submit must be your own. It may not be copied from the web, from another student in the class, or from anyone else. If you stumble upon and use a solution from the textbook or from class, you are expected to acknowledge the source of the work.<br \/><br \/>Your effort on the final exam must be your own. Your assignment submissions must be your own work and not in collaboration with anyone.\u00a0<\/p>\n<h3>Relevant UMass Resources<\/h3>\n<ul>\n<li><a href=\"https:\/\/www.umass.edu\/registrar\/calendars\/academic-calendar#fall2021\">UMass Academic Calendar<\/a><\/li>\n<li><a href=\"https:\/\/www.umass.edu\/honesty\/\">Academic Honesty Policy<\/a><\/li>\n<li><a href=\"https:\/\/www.umass.edu\/esl\/\">English as a Second Language (ESL) Program<\/a><\/li>\n<li><a href=\"https:\/\/www.umass.edu\/counseling\/\">Center for Counseling and Psychological Health<\/a><\/li>\n<li><a href=\"https:\/\/www.umass.edu\/disability\/\">Disability Services<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>COMPSCI 546 is a graduate level course intended to cover information retrieval and other information processing activities, from an applied perspective. There will be numerous programming projects and assignments. It provides a richer technical follow on to COMPSCI 446 (Search Engines), for undergraduates interested in a deeper understanding of the technologies. It also provides a &hellip; <a href=\"https:\/\/groups.cs.umass.edu\/zamani\/compsci-546-applied-information-retrieval-spring-2024\/\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;COMPSCI 546: Applied Information Retrieval \u2013 Spring 2024&#8221;<\/span><\/a><\/p>\n","protected":false},"author":67,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-626","page","type-page","status-publish","hentry","hfeed"],"_links":{"self":[{"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/pages\/626","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/users\/67"}],"replies":[{"embeddable":true,"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/comments?post=626"}],"version-history":[{"count":7,"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/pages\/626\/revisions"}],"predecessor-version":[{"id":751,"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/pages\/626\/revisions\/751"}],"wp:attachment":[{"href":"https:\/\/groups.cs.umass.edu\/zamani\/wp-json\/wp\/v2\/media?parent=626"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}