Strumenti Utente

Strumenti Sito


magistraleinformatica:ir:ir15:start

Differenze

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

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
Prossima revisione
Revisione precedente
magistraleinformatica:ir:ir15:start [11/12/2015 alle 11:30 (10 anni fa)] Paolo Ferraginamagistraleinformatica:ir:ir15:start [02/11/2016 alle 09:15 (9 anni fa)] (versione attuale) – [Exam] Paolo Ferragina
Linea 28: Linea 28:
  
 ^ Date         ^ Room ^ Text ^ ^ Date         ^ Room ^ Text ^
-| 11/01/2016 |  L1 (9:00)  +| 11/01/2016 |  L1 (9:00) {{:magistraleinformatica:ir:ir15:ir160111.docx|text}} 
-| 01/02/2016 |  L1 (9:00)  |  |+| 01/02/2016 |  L1 (9:00)  | {{:magistraleinformatica:ir:ir15:ir160201.docx|text}} | 
 +| 27/06/2016 |  L1 (9:00)  | {{:magistraleinformatica:ir:ir15:ir160627.docx|text}} | 
 +| 19/07/2016 |  L1 (9:00)  | no participants | 
 +| 02/09/2016 |  L1 (9:30)  | {{:magistraleinformatica:ir:ir15:ir160902.docx|text}} |
  
 =====  Books ===== =====  Books =====
Linea 40: Linea 43:
 ^ Date         ^ Argument ^ Refs ^  ^ Date         ^ Argument ^ Refs ^ 
 | 22/09/2015 | Introduction to the course: modern IR, not just search engines! Boolean retrieval model. Matrix document-term. Inverted list: dictionary + postings. How to implement an AND, OR and NOT queries, and their time complexities. The structure of a search engine. | {{:magistraleinformatica:ir:ir15:lect_01-intro_new.ppt|Slides}}\\ Chapt 1 of [MRS] | | 22/09/2015 | Introduction to the course: modern IR, not just search engines! Boolean retrieval model. Matrix document-term. Inverted list: dictionary + postings. How to implement an AND, OR and NOT queries, and their time complexities. The structure of a search engine. | {{:magistraleinformatica:ir:ir15:lect_01-intro_new.ppt|Slides}}\\ Chapt 1 of [MRS] |
-| 24/09/2015 | Web search engine: difficulties in their design and their ephocs. The Web graph: some useful structural properties (such as Boow Tie). Crawling: problems and algorithmic structure. An example: Mercator.  | {{:magistraleinformatica:ir:ir15:lect_02-crawling_and_storage_part_a_.ppt|Slides}},\\ Sections 19.1, 19.2, 19.4, 20.1, 20.2 of [MRS]. |+| 24/09/2015 | Web search engine: difficulties in their design and their ephocs. The Web graph: some useful structural properties (such as Bow Tie). Crawling: problems and algorithmic structure. An example: Mercator.  | {{:magistraleinformatica:ir:ir15:lect_02-crawling_and_storage_part_a_.ppt|Slides}},\\ Sections 19.1, 19.2, 19.4, 20.1, 20.2 of [MRS]. |
 | 29/09/2015 | Few useful algorithmic techniques for crawling the Web (and not only that!): Bloom Filter and Consistent Hashing. | {{:magistraleinformatica:ir:ir15:lect_02-crawling_and_storage_part_b_.ppt|Slides}}.\\ Sect 20.3 and 20.4 of [MRS]. For doubts on Bloom Filter see {{:magistraleinformatica:ir:ir12:reading-bloomfilter.pdf|paper}}. | | 29/09/2015 | Few useful algorithmic techniques for crawling the Web (and not only that!): Bloom Filter and Consistent Hashing. | {{:magistraleinformatica:ir:ir15:lect_02-crawling_and_storage_part_b_.ppt|Slides}}.\\ Sect 20.3 and 20.4 of [MRS]. For doubts on Bloom Filter see {{:magistraleinformatica:ir:ir12:reading-bloomfilter.pdf|paper}}. |
 | 01/10/2015 | Compressed storage of the Web graph. Compressed storage of documents: LZ-based compression. | {{:magistraleinformatica:ir:ir15:lect_03-compression_docs_and_graph_new_.ppt|Slides}},\\ Sect 19.1 and 19.2 of [MRS], and Sect 1.1 and 2.2 of {{:magistraleinformatica:ir:ir15:lz-bwt.pdf|Ferragina's notes}}. |  | 01/10/2015 | Compressed storage of the Web graph. Compressed storage of documents: LZ-based compression. | {{:magistraleinformatica:ir:ir15:lect_03-compression_docs_and_graph_new_.ppt|Slides}},\\ Sect 19.1 and 19.2 of [MRS], and Sect 1.1 and 2.2 of {{:magistraleinformatica:ir:ir15:lz-bwt.pdf|Ferragina's notes}}. | 
magistraleinformatica/ir/ir15/start.1449833424.txt.gz · Ultima modifica: 11/12/2015 alle 11:30 (10 anni fa) da Paolo Ferragina

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki