Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformatica:ir:ir22:start [18/01/2023 alle 15:01 (2 anni fa)] – [Exams] Paolo Ferragina
+++ magistraleinformatica:ir:ir22:start [07/09/2023 alle 14:00 (22 mesi fa)] (versione attuale) – [Exams] Paolo Ferragina
@@ Linea 42: / Linea 42: @@
 ^ Date  ^ Room  ^ Text ^ Notes |
-| 17/01/23, start at 09:00 | room E | {{ :magistraleinformatica:ir:ir22:ir230117.pdf |text}}, {{ :magistraleinformatica:ir:ir22:ir230117_solution.pdf |solution}}, {{ :magistraleinformatica:ir:ir22:informationretrieval-2023-jan.pdf |results}} | Correction will occur tomorrow Wednesday 18 January, at 16:00 (Ferragina's office). For registration only, also online same date-hour, please show yourself on Teams' room of the course.\\ Students that have passed only the “exercises” part can repeat only the “theory” part on any of the following exam dates, they have to register on the portal “ESAMI” writing in the notes “only theory”. Moreover, they can come +45mins after the start of the exam, to join the class that did in the first hour the “exercises” part. |
+| 17/01/23, start at 09:00 | room E | {{ :magistraleinformatica:ir:ir22:ir230117.pdf |text}}, {{ :magistraleinformatica:ir:ir22:ir230117_solution.pdf |solution}}, {{ :magistraleinformatica:ir:ir22:informationretrieval-2023-jan.pdf |results}} | Correction will occur tomorrow Wednesday 18 January, at 16:00 (Ferragina's office). For registration only, just send me an email to accept the rank.\\ Students that have passed only the “exercises” part can repeat only the “theory” part on any of the following exam dates, they have to register on the portal “ESAMI” writing in the notes “only theory”. Moreover, they can come +45mins after the start of the exam, to join the class that did in the first hour the “exercises” part. |
-| 08/02/23, start at 11:00 | room E | text, results, solution |    |
+| 08/02/23, start at 11:00 | room A1 | {{ :magistraleinformatica:ir:ir22:ir230208.pdf |text}}, {{ :magistraleinformatica:ir:ir22:informationretrieval-2023-feb-a.pdf |results}}, {{ :magistraleinformatica:ir:ir22:ir230208_solution.pdf |solution}} | Correction will occur Monday 13 January, at 11:00 (Ferragina's office). For registration only, just send me an email to accept the rank.\\ Students that have passed only the “exercises” part can repeat only the “theory” part on any of the following exam dates, they have to register on the portal “ESAMI” writing in the notes “only theory”. Moreover, they can come +45mins after the start of the exam, to join the class that did in the first hour the “exercises” part.  |
+| 05/06/2023, start at 16:00 | room C | {{ :magistraleinformatica:ir:ir22:ir230605.pdf |text}} |   |
+| 05/07/2023, start at 11:00 | room A1 | {{ :magistraleinformatica:ir:ir22:ir230705.pdf |text}} |   |
+| 24/07/2023, start at 14:00 | room C | {{ :magistraleinformatica:ir:ir22:ir230724.pdf |text}} |   |
+| 07/09/2023, start at 14:00 | room A1 | {{ :magistraleinformatica:ir:ir22:ir230907.pdf |text}} |   |
 ====== Materials for study ======
@@ Linea 72: / Linea 77: @@
 | 07.11.2022 | Query processing: soft-AND. Phrase queries, biword index and positional index. Exact search: hashing. Prefix search: compacted trie, front coding, 2-level indexing. Edit distance with e-errors via brute-force approach, or Dynamic Programming (possibly weighted). Overlap measure with k-gram index. An index for e-error matches based on k-gram index (with false positives, no false negatives). | Sect. 2.3 and 2.4 of [MRS].\\ [[https://www.dropbox.com/s/c9yslt21191t3vi/Lect%2010%20-%20dict%20search.pptx?dl=0|Slides]] |
 | 08.11.2022 | Caching and Tiered index. An efficient filter for one-error match (with false positives, no false negatives).  Wild-card queries (permuterm, k-gram). Phonetic match. Scoring and ranking spelling errors. |   |
-| 14.11.2022 | Text-based ranking: dice, jaccard, tf-idf. Vector space model and cosine similarity doc-doc and query-doc. Storage of tf-idf and use for computing document-query similarity. Fast top-k retrieval: high idf, champion lists, many query terms, clustering.| Sect 6.2 and 6.3 and 7 from [MRS], [[https://unipiit.sharepoint.com/sites/a__td_54786/Shared%20Documents/General/Recordings/Lecture%20IR%20-%2014_11_2022-20221114_110231-Meeting%20Recording.mp4?web=1|video]], and [[https://www.dropbox.com/s/lga0y1aofruimns/lect%2012-text%20ranking.ppt?dl=0|slides]] |
+| 14.11.2022 | Text-based ranking: dice, jaccard, tf-idf. Vector space model and cosine similarity doc-doc and query-doc. Storage of tf-idf and use for computing document-query similarity. Fast top-k retrieval: high idf, champion lists, many query terms, clustering.| Sect 6.2 and 6.3 and 7 from [MRS], [[https://unipiit.sharepoint.com/sites/a__td_54786/Shared%20Documents/General/Recordings/Lecture%20IR%20-%2014_11_2022-20221114_110231-Meeting%20Recording.mp4?web=1|video]], and [[https://www.dropbox.com/s/k9mzcweaav6q7pj/lect%2012-text%20ranking.ppt?dl=0|slides]] |
 | 15.11.2022 | Fast top-k retrieval: fancy hits. Exact Top-K: WAND and blocked-WAND. |  |
 | 21.11.2022 | Relevance feedback, Rocchio, pseudo-relevance feedback, query expansion. Performance measures: precision, recall, F1, DCG and NDCG. | Sect 8.1-8.3 and 9 [MRS]. |