Spaces:
Sleeping
Sleeping
File size: 12,346 Bytes
48e7c56 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 |
BSc: Information Retrieval
==========================
Contents
--------
* [1 Information Retrieval](#Information_Retrieval)
+ [1.1 Short Description](#Short_Description)
+ [1.2 Prerequisites](#Prerequisites)
- [1.2.1 Prerequisite subjects](#Prerequisite_subjects)
- [1.2.2 Prerequisite topics](#Prerequisite_topics)
+ [1.3 Course Topics](#Course_Topics)
+ [1.4 Intended Learning Outcomes (ILOs)](#Intended_Learning_Outcomes_.28ILOs.29)
- [1.4.1 What is the main purpose of this course?](#What_is_the_main_purpose_of_this_course.3F)
- [1.4.2 ILOs defined at three levels](#ILOs_defined_at_three_levels)
* [1.4.2.1 Level 1: What concepts should a student know/remember/explain?](#Level_1:_What_concepts_should_a_student_know.2Fremember.2Fexplain.3F)
* [1.4.2.2 Level 2: What basic practical skills should a student be able to perform?](#Level_2:_What_basic_practical_skills_should_a_student_be_able_to_perform.3F)
* [1.4.2.3 Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?](#Level_3:_What_complex_comprehensive_skills_should_a_student_be_able_to_apply_in_real-life_scenarios.3F)
+ [1.5 Grading](#Grading)
- [1.5.1 Course grading range](#Course_grading_range)
- [1.5.2 Course activities and grading breakdown](#Course_activities_and_grading_breakdown)
- [1.5.3 Recommendations for students on how to succeed in the course](#Recommendations_for_students_on_how_to_succeed_in_the_course)
+ [1.6 Resources, literature and reference materials](#Resources.2C_literature_and_reference_materials)
- [1.6.1 Open access resources](#Open_access_resources)
- [1.6.2 Closed access resources](#Closed_access_resources)
- [1.6.3 Software and tools used within the course](#Software_and_tools_used_within_the_course)
* [2 Teaching Methodology: Methods, techniques, & activities](#Teaching_Methodology:_Methods.2C_techniques.2C_.26_activities)
+ [2.1 Activities and Teaching Methods](#Activities_and_Teaching_Methods)
+ [2.2 Formative Assessment and Course Activities](#Formative_Assessment_and_Course_Activities)
- [2.2.1 Ongoing performance assessment](#Ongoing_performance_assessment)
* [2.2.1.1 Section 1](#Section_1)
* [2.2.1.2 Section 2](#Section_2)
* [2.2.1.3 Section 3](#Section_3)
* [2.2.1.4 Section 4](#Section_4)
- [2.2.2 Final assessment](#Final_assessment)
- [2.2.3 The retake exam](#The_retake_exam)
Information Retrieval
=====================
* **Course name**: Information Retrieval
* **Code discipline**: CSE306
* **Subject area**: Data Science; Computer systems organization; Information systems; Real-time systems; Information retrieval; World Wide Web; Recommender systems
Short Description
-----------------
The course gives an introduction to practical and theoretical aspects of information search and recommender systems.
This course covers the following concepts: Indexing; Search quality assessment; Relevance; Ranking; Information retrieval; Query; Recommendations; Multimedia retrieval.
Prerequisites
-------------
### Prerequisite subjects
* CSE204 — Analytic Geometry And Linear Algebra II: matrix multiplication, matrix decomposition (SVD, ALS) and approximation (matrix norm), sparse matrix, stability of solution (decomposition), vector spaces, metric spaces, manifold, eigenvector and eigenvalue.
* CSE113 — Philosophy I - (Discrete Math and Logic): graphs, trees, binary trees, balanced trees, metric (proximity) graphs, diameter, clique, path, shortest path.
* CSE206 — Probability And Statistics: probability, likelihood, conditional probability, Bayesian rule, stochastic matrix and properties. Analysis: DFT, [discrete] gradient.
### Prerequisite topics
Course Topics
-------------
Course Sections and Topics
| Section | Topics within the section
|
| --- | --- |
| Information retrieval basics | 1. Introduction to IR, major concepts.
2. Crawling and Web.
3. Quality assessment.
|
| Text processing and indexing | 1. Building inverted index for text documents. Boolean retrieval model.
2. Language, tokenization, stemming, searching, scoring.
3. Spellchecking and wildcard search.
4. Suggest and query expansion.
5. Language modelling. Topic modelling.
|
| Vector model and vector indexing | 1. Vector model
2. Machine learning for vector embedding
3. Vector-based index structures
|
| Advanced topics. Media processing | 1. Image and video processing, understanding and indexing
2. Content-based image retrieval
3. Audio retrieval
4. Relevance feedback
|
Intended Learning Outcomes (ILOs)
---------------------------------
### What is the main purpose of this course?
The course is designed to prepare students to understand background theories of information retrieval systems and introduce different information retrieval systems. The course will focus on the evaluation and analysis of such systems as well as how they are implemented. Throughout the course, students will be involved in discussions, readings, and assignments to experience real world systems. The technologies and algorithms covered in this class include machine learning, data mining, natural language processing, data indexing, and so on.
### ILOs defined at three levels
#### Level 1: What concepts should a student know/remember/explain?
By the end of the course, the students should be able to ...
* Terms and definitions used in area of information retrieval,
* Search engine and recommender system essential parts,
* Quality metrics of information retrieval systems,
* Contemporary approaches to semantic data analysis,
* Indexing strategies.
#### Level 2: What basic practical skills should a student be able to perform?
By the end of the course, the students should be able to ...
* Understand background theories behind information retrieval systems,
* How to design a recommender system from scratch,
* How to evaluate quality of a particular information retrieval system,
* Core ideas and system implementation and maintenance,
* How to identify and fix information retrieval system problems.
#### Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?
By the end of the course, the students should be able to ...
* Build a recommender service from scratch,
* Implement a proper index for an unstructured dataset,
* Plan quality measures for a new recommender service,
* Run initial data analysis and problem evaluation for a business task, related to information retrieval.
Grading
-------
### Course grading range
| Grade | Range | Description of performance
|
| --- | --- | --- |
| A. Excellent | 90-100 | -
|
| B. Good | 75-89 | -
|
| C. Satisfactory | 60-74 | -
|
| D. Poor | 0-59 | -
|
### Course activities and grading breakdown
| Activity Type | Percentage of the overall course grade
|
| --- | --- |
| Assignments | 60
|
| Quizzes | 40
|
| Exams | 0
|
### Recommendations for students on how to succeed in the course
The simples way to succeed is to participate in labs and pass coding assignments in timely manner. This guarantees up to 60% of the grade. Participation in lecture quizzes allow to differentiate the grade.
Resources, literature and reference materials
---------------------------------------------
### Open access resources
* Manning, Raghavan, Schütze, An Introduction to Information Retrieval, 2008, Cambridge University Press
* Baeza-Yates, Ribeiro-Neto, Modern Information Retrieval, 2011, Addison-Wesley
* Buttcher, Clarke, Cormack, Information Retrieval: Implementing and Evaluating Search Engines, 2010, MIT Press
* [Course repository in github](https://github.com/IUCVLab/information-retrieval).
### Closed access resources
### Software and tools used within the course
Teaching Methodology: Methods, techniques, & activities
=======================================================
Activities and Teaching Methods
-------------------------------
Activities within each section
| Learning Activities | Section 1 | Section 2 | Section 3 | Section 4
|
| --- | --- | --- | --- | --- |
| Development of individual parts of software product code | 1 | 1 | 1 | 1
|
| Homework and group projects | 1 | 1 | 1 | 1
|
| Testing (written or computer based) | 1 | 1 | 1 | 1
|
Formative Assessment and Course Activities
------------------------------------------
### Ongoing performance assessment
#### Section 1
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | Enumerate limitations for web crawling. | 1
|
| Question | Propose a strategy for A/B testing. | 1
|
| Question | Propose recommender quality metric. | 1
|
| Question | Implement DCG metric. | 1
|
| Question | Discuss relevance metric. | 1
|
| Question | Crawl website with respect to robots.txt. | 1
|
| Question | What is typical IR system architecture? | 0
|
| Question | Show how to parse a dynamic web page. | 0
|
| Question | Provide a framework to accept/reject A/B testing results. | 0
|
| Question | Compute DCG for an example query for random search engine. | 0
|
| Question | Implement a metric for a recommender system. | 0
|
| Question | Implement pFound. | 0
|
#### Section 2
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | Build inverted index for a text. | 1
|
| Question | Tokenize a text. | 1
|
| Question | Implement simple spellchecker. | 1
|
| Question | Implement wildcard search. | 1
|
| Question | Build inverted index for a set of web pages. | 0
|
| Question | build a distribution of stems/lexemes for a text. | 0
|
| Question | Choose and implement case-insensitive index for a given text collection. | 0
|
| Question | Choose and implement semantic vector-based index for a given text collection. | 0
|
#### Section 3
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | Embed the text with an ML model. | 1
|
| Question | Build term-document matrix. | 1
|
| Question | Build semantic index for a dataset using Annoy. | 1
|
| Question | Build kd-tree index for a given dataset. | 1
|
| Question | Why kd-trees work badly in 100-dimensional environment? | 1
|
| Question | What is the difference between metric space and vector space? | 1
|
| Question | Choose and implement persistent index for a given text collection. | 0
|
| Question | Visualize a dataset for text classification. | 0
|
| Question | Build (H)NSW index for a dataset. | 0
|
| Question | Compare HNSW to Annoy index. | 0
|
| Question | What are metric space index structures you know? | 0
|
#### Section 4
| Activity Type | Content | Is Graded?
|
| --- | --- | --- |
| Question | Extract semantic information from images. | 1
|
| Question | Build an image hash. | 1
|
| Question | Build a spectral representation of a song. | 1
|
| Question | Whats is relevance feedback? | 1
|
| Question | Build a "search by color" feature. | 0
|
| Question | Extract scenes from video. | 0
|
| Question | Write a voice-controlled search. | 0
|
| Question | Semantic search within unlabelled image dataset. | 0
|
### Final assessment
**Section 1**
1. Implement text crawler for a news site.
2. What is SBS (side-by-side) and how is it used in search engines?
3. Compare pFound with CTR and with DCG.
4. Explain how A/B testing works.
5. Describe PageRank algorithm.
**Section 2**
1. Explain how (and why) KD-trees work.
2. What are weak places of inverted index?
3. Compare different text vectorization approaches.
4. Compare tolerant retrieval to spellchecking.
**Section 3**
1. Compare inverted index to HNSW in terms of speed, memory consumption?
2. Choose the best index for a given dataset.
3. Implement range search in KD-tree.
**Section 4**
1. What are the approaches to image understanding?
2. How to cluster a video into scenes and shots?
3. How speech-to-text technology works?
4. How to build audio fingerprints?
### The retake exam
**Section 1**
1. Solve a complex coding problem similar to one of the homework or lab.
**Section 2**
1. Solve a complex coding problem similar to one of the homework or lab.
**Section 3**
1. Solve a complex coding problem similar to one of the homework or lab.
**Section 4**
1. Solve a complex coding problem similar to one of the homework or lab.
|