magistraleinformatica:ir:ir15:start
Differenze
Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.
| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente | ||
| magistraleinformatica:ir:ir15:start [25/11/2015 alle 14:29 (10 anni fa)] – [Content of the Lectures] Paolo Ferragina | magistraleinformatica: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: | + | | 11/01/2016 | L1 (9: |
| - | | 01/02/2016 | L1 (9: | + | | 01/02/2016 | L1 (9: |
| + | | 27/ | ||
| + | | 19/07/2016 | L1 (9: | ||
| + | | 02/09/2016 | L1 (9: | ||
| ===== 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. | {{: | | 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. | {{: | ||
| - | | 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. | + | | 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. |
| | 29/09/2015 | Few useful algorithmic techniques for crawling the Web (and not only that!): Bloom Filter and Consistent Hashing. | {{: | | 29/09/2015 | Few useful algorithmic techniques for crawling the Web (and not only that!): Bloom Filter and Consistent Hashing. | {{: | ||
| | 01/10/2015 | Compressed storage of the Web graph. Compressed storage of documents: LZ-based compression. | {{: | | 01/10/2015 | Compressed storage of the Web graph. Compressed storage of documents: LZ-based compression. | {{: | ||
| Linea 57: | Linea 60: | ||
| | 19 and 20\\ 11/2015 | Lab on Lucene.\\ You need to configure your laptop as follows: Linux system (may be a virtual machine) with debian-like OS (e.g. '' | | 19 and 20\\ 11/2015 | Lab on Lucene.\\ You need to configure your laptop as follows: Linux system (may be a virtual machine) with debian-like OS (e.g. '' | ||
| | 24/11/2015 | Performance measures: precision, recall, F1 and user happiness. Random Walks. Link-based ranking: pagerank and personalized pagerank. | {{: | | 24/11/2015 | Performance measures: precision, recall, F1 and user happiness. Random Walks. Link-based ranking: pagerank and personalized pagerank. | {{: | ||
| - | | 26/11/2015 | CoSim Rank and HITS. Projections to smaller spaces: Latent Semantic Indexing (LSI). | {{: | + | | 26/11/2015 | CoSim Rank and HITS. Recommendation systems and Web advertising. | {{: |
| - | | 27/11/2015 | Random Projections: Johnson-Linderstauss Lemma and its applications. Recommendation | + | | 27/11/2015 | Projections to smaller spaces: Latent Semantic Indexing (LSI). |
| - | | 01/12/2015 | | | | + | | 01/12/2015 | Semantic-annotation tools: basics, Wikipedia structure, TAGME and other annotators. How to evaluate those systems. Various approaches to text representation. | {{: |
| - | | 03/12/2015 | | + | | 03/12/2015 | More on topics annotators and their applications. Clustering: flat, hierarchical, |
| - | | 10/12/2015 | | | | + | | 10/12/2015 | Locality-sensitive hashing: basics, hamming distance, Jaccard similarity, sketch of the main theorem. |
| - | | 11/12/2015 | Extra lecture (11: | + | | 11/12/2015 | Exercise |
| - | | 15/12/2015 | | | | + | | 15/12/2015 | Exercise |
| - | ===== Last year lectures (just for backup!!!) ===== | ||
| - | ^ Date ^ Argument ^ Refs ^ | ||
| - | | | More on Rank and Select on binary arrays. Rank and Select on general arrays: the Wavelet Tree. Binary tree encoding and navigation. | | | ||
| - | | | Suffix arrays: data structure and search operations. Text mining over suffix arrays. | | | ||
| - | | | How to compute the SCC I/ | ||
| - | | | Semantic-annotation tools: basics and TAGME. | | | ||
| - | | | Semantic-annotation tools: advanced and some applications. | ||
| - | | | Extra lecture: 9-11, M1: Clustering: flat, hierarchical, | ||
| - | | | Exercises | ||
magistraleinformatica/ir/ir15/start.1448461766.txt.gz · Ultima modifica: 25/11/2015 alle 14:29 (10 anni fa) da Paolo Ferragina